Recent harmony search algorithms for 0–1 optimization problems

BRODERICK CRAWFORD LABRIN, RICARDO JAVIER SOTO DE GIORGIS, Néstor Guzmán, Franklin Johnson, Fernando Paredes

Resultado de la investigación: Capítulo del libro/informe/acta de congresoContribución a la conferenciarevisión exhaustiva

1 Cita (Scopus)

Resumen

The Set Covering Problem (SCP) has long been concentrating the interest of many researchers in the field of Combinatorial Optimization. SCP is a 0–1 integer programming problem that consists in finding a set of solutions which allow to cover a set of needs at the lowest cost possible. There are many applications of these kind of problems, the main ones are: location of services, files selection in a data bank, simplification of boolean expressions, balancing production lines, among others. Different metaheuristics have been proposed to solve it. Here, we present the possibilities to solve Set Covering Problems with Harmony Search.

Idioma originalInglés
Título de la publicación alojadaHCI International 2015 – Posters Extended Abstracts - International Conference, HCI International 2015, Proceedings
EditoresConstantine Stephanidis
EditorialSpringer Verlag
Páginas567-572
Número de páginas6
ISBN (versión impresa)9783319213798
DOI
EstadoPublicada - 1 ene 2015
Evento17th International Conference on Human Computer Interaction, HCI 2015 - Los Angeles, Estados Unidos
Duración: 2 ago 20157 ago 2015

Serie de la publicación

NombreCommunications in Computer and Information Science
Volumen528
ISSN (versión impresa)1865-0929

Conferencia

Conferencia17th International Conference on Human Computer Interaction, HCI 2015
PaísEstados Unidos
CiudadLos Angeles
Período2/08/157/08/15

Huella Profundice en los temas de investigación de 'Recent harmony search algorithms for 0–1 optimization problems'. En conjunto forman una huella única.

Citar esto