Jorge Mario Cruz-Duarte

Dr. Jorge Mario Cruz-Duarte

Centre Inria de l'Université de Lille, University of Lille, Lille, Hauts-de-France, France
orcid

Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 August 2018 in Communications in Nonlinear Science and Numerical Simulation
Verified
Journal Article
Closed access
Jorge Mario Cruz-DuarteJorge Mario Cruz-Duarte
Jorge Mario Cruz-Duarte
JRJ. Juan Rosales
J. Juan Rosales
CCC. Rodrigo Correa–Cely
C. Rodrigo Correa–Cely
AGARTURO GARCIA-PEREZ
ARTURO GARCIA-PEREZ
Juan Gabriel Avina-CervantesJuan Gabriel Avina-Cervantes
Juan Gabriel Avina-Cervantes

14 July 2020 in IEEE Access
Verified
Journal Article
Open access
MSMelissa Sanchez
Melissa Sanchez
Jorge Mario Cruz-DuarteJorge Mario Cruz-Duarte
Jorge Mario Cruz-Duarte
José Carlos Ortiz-BaylissJosé Carlos Ortiz-Bayliss
José Carlos Ortiz-Bayliss
Hector G. CeballosHector G. Ceballos
Hector G. Ceballos
Hugo Terashima-MarinHugo Terashima-Marin
Hugo Terashima-Marin
Ivan AmayaIvan Amaya
Ivan Amaya
Hyper-heuristics aim at interchanging different solvers while solving a problem. The idea is to determine the best approach for solving a problem at its current state. This way, every time we make a move it gets us closer to a solution. The problem changes; so does its state. As a consequence, for the next move, a different solver may be invoked. Hyper-heuristics have been around for almost 20 years. However, combinatorial optimization problems date from way back. Thus, it is paramount to determine whether the efforts revolving around hyper-heuristic research have been targeted at the problems of the highest interest for the combinatorial optimization community. In this work, we tackle such an endeavor. We begin by determining the most relevant combinatorial optimization problems, and then we analyze them in the context of hyper-heuristics. The idea is to verify whether they remain as relevant when considering exclusively works related to hyper-heuristics. We find that some of the most relevant problem domains have also been popular for hyper-heuristics research. Alas, others have not and few efforts have been directed towards solving them. We identify the following problem domains, which may help in furthering the impact of hyper-heuristics: Shortest Path, Set Cover, Longest Path, and Minimum Spanning Tree. We believe that focusing research on ways for solving them may lead to an increase in the relevance and impact that hyper-heuristics have on combinatorial optimization problems.

1 September 2016 in Expert Systems with Applications
Verified
Journal Article
Closed access
EMElisee Ilunga Mbuyamba
Elisee Ilunga Mbuyamba
Jorge Mario Cruz-DuarteJorge Mario Cruz-Duarte
Jorge Mario Cruz-Duarte
Juan Gabriel Avina-CervantesJuan Gabriel Avina-Cervantes
Juan Gabriel Avina-Cervantes
CCCarlos Rodrigo Correa-Cely
Carlos Rodrigo Correa-Cely
DLDirk Lindner
Dirk Lindner
CCClaire Chalopin
Claire Chalopin

1 October 2021 in Swarm and Evolutionary Computation
Verified
Journal Article
Closed access
Jorge Mario Cruz-DuarteJorge Mario Cruz-Duarte
Jorge Mario Cruz-Duarte
Ivan AmayaIvan Amaya
Ivan Amaya
José Carlos Ortiz-BaylissJosé Carlos Ortiz-Bayliss
José Carlos Ortiz-Bayliss
SCSantiago Enrique Conant-Pablos
Santiago Enrique Conant-Pablos
HTHugo Terashima-Marín
Hugo Terashima-Marín
YSYong Shi
Yong Shi

17 November 2020 in Mathematics
Verified
Journal Article
Open access
PDF file
Jorge Mario Cruz-DuarteJorge Mario Cruz-Duarte
Jorge Mario Cruz-Duarte
José Carlos Ortiz-BaylissJosé Carlos Ortiz-Bayliss
José Carlos Ortiz-Bayliss
Ivan AmayaIvan Amaya
Ivan Amaya
YSYong Shi
Yong Shi
Hugo Terashima-MarinHugo Terashima-Marin
Hugo Terashima-Marin
NPNelishia Pillay
Nelishia Pillay
Metaheuristics have become a widely used approach for solving a variety of practical problems. The literature is full of diverse metaheuristics based on outstanding ideas and with proven excellent capabilities. Nonetheless, oftentimes metaheuristics claim novelty when they are just recombining elements from other methods. Hence, the need for a standard metaheuristic model is vital to stop the current frenetic tendency of proposing methods chiefly based on their inspirational source. This work introduces a first step to a generalised and mathematically formal metaheuristic model, which can be used for studying and improving them. This model is based on a scheme of simple heuristics, which perform as building blocks that can be modified depending on the application. For this purpose, we define and detail all components and concepts of a metaheuristic (i.e., its search operators), such as heuristics. Furthermore, we also provide some ideas to take into account for exploring other search operator configurations in the future. To illustrate the proposed model, we analyse search operators from four well-known metaheuristics employed in continuous optimisation problems as a proof-of-concept. From them, we derive 20 different approaches and use them for solving some benchmark functions with different landscapes. Data show the remarkable capability of our methodology for building metaheuristics and detecting which operator to choose depending on the problem to solve. Moreover, we outline and discuss several future extensions of this model to various problem and solver domains.

12 March 2021 in Mathematics
Verified
Journal Article
Open access
PDF file
Tat'y Mwata-VeluTat'y Mwata-Velu
Tat'y Mwata-Velu
JRJose Ruiz-Pinales
Jose Ruiz-Pinales
HRHoracio Rostro-Gonzalez
Horacio Rostro-Gonzalez
MIMario Alberto Ibarra-Manzano
Mario Alberto Ibarra-Manzano
Jorge Mario Cruz-DuarteJorge Mario Cruz-Duarte
Jorge Mario Cruz-Duarte
Juan Gabriel Avina-CervantesJuan Gabriel Avina-Cervantes
Juan Gabriel Avina-Cervantes
Advances in the field of Brain-Computer Interfaces (BCIs) aim, among other applications, to improve the movement capacities of people suffering from the loss of motor skills. The main challenge in this area is to achieve real-time and accurate bio-signal processing for pattern recognition, especially in Motor Imagery (MI). The significant interaction between brain signals and controllable machines requires instantaneous brain data decoding. In this study, an embedded BCI system based on fist MI signals is developed. It uses an Emotiv EPOC+ Brainwear®, an Altera SoCKit® development board, and a hexapod robot for testing locomotion imagery commands. The system is tested to detect the imagined movements of closing and opening the left and right hand to control the robot locomotion. Electroencephalogram (EEG) signals associated with the motion tasks are sensed on the human sensorimotor cortex. Next, the SoCKit processes the data to identify the commands allowing the controlled robot locomotion. The classification of MI-EEG signals from the F3, F4, FC5, and FC6 sensors is performed using a hybrid architecture of Convolutional Neural Networks (CNNs) and Long Short-Term Memory (LSTM) networks. This method takes advantage of the deep learning recognition model to develop a real-time embedded BCI system, where signal processing must be seamless and precise. The proposed method is evaluated using k-fold cross-validation on both created and public Scientific-Data datasets. Our dataset is comprised of 2400 trials obtained from four test subjects, lasting three seconds of closing and opening fist movement imagination. The recognition tasks reach 84.69% and 79.2% accuracy using our data and a state-of-the-art dataset, respectively. Numerical results support that the motor imagery EEG signals can be successfully applied in BCI systems to control mobile robots and related applications such as intelligent vehicles.