Constructive metaheuristics for the set covering problem

Producción científica: Capítulo del libro/informe/acta de congresoContribución a la conferenciarevisión exhaustiva

19 Citas (Scopus)


Different criteria exist for the classification of the metaheuristics. One important classification is: improvement metaheuristics and constructive. On the one hand improvement metaheuristics, begins with an initial solution and iteratively improves the quality of the solution using neighborhood search. On the other hand, constructive metaheuristics, are those in which a solution is built from the beginning, finding in each iteration a local optimum. In this article, we to compare two constructive metaheuristics, Ant Colony Optimization and Intelligent Water Drops, by solving a classical NP-hard problem, such like the Set Covering Problem, which has many practical applications, including line balancing production, service installation and crew scheduling in railway, among others. The results reveal that Ant Colony Optimization has a better behavior than Intelligent Water Drops in relation to the problem considered.

Idioma originalInglés
Título de la publicación alojadaBioinspired Optimization Methods and Their Applications - 8th International Conference, BIOMA 2018, Proceedings
EditoresNouredine Melab, Peter Korosec, El-Ghazali Talbi
EditorialSpringer Verlag
Número de páginas12
ISBN (versión impresa)9783319916408
EstadoPublicada - 2018
Evento8th International Conference on Bioinspired Optimization Methods and Their Applications, BIOMA 2018 - Paris, Francia
Duración: 16 may. 201818 may. 2018

Serie de la publicación

NombreLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volumen10835 LNCS
ISSN (versión impresa)0302-9743
ISSN (versión digital)1611-3349


Conferencia8th International Conference on Bioinspired Optimization Methods and Their Applications, BIOMA 2018


Profundice en los temas de investigación de 'Constructive metaheuristics for the set covering problem'. En conjunto forman una huella única.

Citar esto