Carlos Segura

Dr. Carlos Segura

Centro de Investigación en Matemáticas
orcid

Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

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

Representative Publications

View All Publications
22 September 2015 in Annals of Operations Research
Verified
Journal Article
Closed access
PDF file
CSCarlos Segura
Carlos Segura
Carlos CoelloCarlos Coello
Carlos Coello
Gara MirandaGara Miranda
Gara Miranda
Coromoto LeónCoromoto León
Coromoto León

1 October 2018 in Renewable Energy
Verified
Journal Article
Closed access
DWDennis Wilson
Dennis Wilson
SRSilvio Rodrigues
Silvio Rodrigues
CSCarlos Segura
Carlos Segura
ILIlya Loshchilov
Ilya Loshchilov
FHFrank Hutter
Frank Hutter
SCSylvain Cussat-Blanc
Sylvain Cussat-Blanc

19 December 2016 in IEEE Transactions on Evolutionary Computation
Verified
Journal Article
Closed access
CSCarlos Segura
Carlos Segura
AHArturo Hernandez-Aguirre
Arturo Hernandez-Aguirre
FLFrancisco Luna
Francisco Luna
EAEnrique Alba
Enrique Alba
Metaheuristics have yielded very promising results for the frequency assignment problem (FAP). However, the results obtainable using currently published methods are far from ideal in complex, large-scale instances. This paper applies and extends some of the most recent advances in evolutionary algorithms to two common variants of the FAP, and shows how, in traditional techniques, two common issues affect their performance: 1) premature convergence and 2) the way in which neutral networks are handled. A recent replacement-based diversity management strategy is successfully applied to alleviate the premature convergence drawback. Additionally, by properly defining a distance metric, the performance in the presence of neutrality can also be greatly improved. The replacement strategy combines the principle of transforming a single-objective problem into a multiobjective one by considering diversity as an additional objective, with the idea of adapting the balance induced between exploration and exploitation to the requirements of the different optimization stages. Tests with 44 publicly available instances yield very competitive results. New best-known frequency plans were generated for 11 instances, whereas in the remaining ones the best-known solutions were replicated. Comparisons with a large number of strategies designed to delay convergence of the population clearly show the advantages of our novel proposals.

1 September 2013 in 4OR
Verified
Journal Article
Closed access
PDF file
CSCarlos Segura
Carlos Segura
Carlos CoelloCarlos Coello
Carlos Coello
Gara MirandaGara Miranda
Gara Miranda
Coromoto LeónCoromoto León
Coromoto León

1 December 2015 in Information Sciences
Verified
Journal Article
Closed access
CSCarlos Segura
Carlos Segura
Carlos CoelloCarlos Coello
Carlos Coello
AHAlfredo G. Hernández-Díaz
Alfredo G. Hernández-Díaz

1 August 2009 in International Journal on Artificial Intelligence Tools
Verified
Journal Article
Closed access
Coromoto LeónCoromoto León
Coromoto León
Gara MirandaGara Miranda
Gara Miranda
CSCarlos Segura
Carlos Segura