Molina Cabrera Daniel

Dr. Molina Cabrera Daniel

orcid

Research Focus & Metrics

Academic Career Length

23Years (2004-Present)

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

Representative Publications

View All Publications
1 June 2020 in Information Fusion
Verified
Journal Article
Closed access
AAAlejandro Barredo Arrieta
Alejandro Barredo Arrieta
NDNatalia Díaz-Rodríguez
Natalia Díaz-Rodríguez
Javier Del SerJavier Del Ser
Javier Del Ser
ABAdrien Bennetot
Adrien Bennetot
STSiham Tabik
Siham Tabik
FHFrancisco Herrera
Francisco Herrera

1 March 2011 in Swarm and Evolutionary Computation
Verified
Journal Article
Closed access
JDJoaquín Derrac
Joaquín Derrac
Salvador GarcíaSalvador García
Salvador García
MDMolina Cabrera Daniel
Molina Cabrera Daniel
FHFrancisco Herrera
Francisco Herrera


1 August 2019 in Swarm and Evolutionary Computation
Verified
Journal Article
Closed access
Javier Del SerJavier Del Ser
Javier Del Ser
Eneko OsabaEneko Osaba
Eneko Osaba
MDMolina Cabrera Daniel
Molina Cabrera Daniel
Xin-She YangXin-She Yang
Xin-She Yang
SSSancho Salcedo-Sanz
Sancho Salcedo-Sanz
Francisco HerreraFrancisco Herrera
Francisco Herrera

1 September 2004 in Evolutionary Computation
Verified
Journal Article
Closed access
MLManuel Lozano
Manuel Lozano
Francisco HerreraFrancisco Herrera
Francisco Herrera
NKNatalio Krasnogor
Natalio Krasnogor
MDMolina Cabrera Daniel
Molina Cabrera Daniel
This paper presents a real-coded memetic algorithm that applies a crossover hill-climbing to solutions produced by the genetic operators. On the one hand, the memetic algorithm provides global search (reliability) by means of the promotion of high levels of population diversity. On the other, the crossover hill-climbing exploits the self-adaptive capacity of real-parameter crossover operators with the aim of producing an effective local tuning on the solutions (accuracy). An important aspect of the memetic algorithm proposed is that it adaptively assigns different local search probabilities to individuals. It was observed that the algorithm adjusts the global/local search balance according to the particularities of each problem instance. Experimental results show that, for a wide range of problems, the method we propose here consistently outperforms other real-coded memetic algorithms which appeared in the literature.

1 March 2008 in European Journal of Operational Research
Verified
Journal Article
Closed access
CGC. García-Martínez
C. García-Martínez
MLM. Lozano
M. Lozano
Francisco HerreraFrancisco Herrera
Francisco Herrera
MDMolina Cabrera Daniel
Molina Cabrera Daniel
ASA.M. Sánchez
A.M. Sánchez