Solving the set covering problem with a shuffled frog leaping algorithm

Broderick Crawford, Ricardo Soto, Cristian Peña, Wenceslao Palma, Franklin Johnson, Fernando Paredes

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

28 Citas (Scopus)

Resumen

In this paper we design and evaluate a shuffled frog leaping algorithm that solves the set covering problem. The shuffled frog leaping algorithm is a novel metaheuristic inspired by natural memetics. It consists of an individual memetic evolution and a global memetic information exchange between a population of virtual frogs representing possible solutions of a problem at hand. The experimental results show the effectiveness of our approach which produces competitive results solving a portfolio of set covering problems from the OR-Library.

Idioma originalInglés
Título de la publicación alojadaIntelligent Information and Database Systems - 7th Asian Conference, ACIIDS 2015, Proceedings
EditoresNgoc Thanh Nguyen, Bogdan Trawiński, Ngoc Thanh Nguyen, Raymond Kosala
EditorialSpringer Verlag
Páginas41-50
Número de páginas10
ISBN (versión digital)9783319157047
DOI
EstadoPublicada - 2015
Publicado de forma externa
Evento7th Asian Conference on Intelligent Information and Database Systems, ACIIDS 2015 - Bali, Indonesia
Duración: 23 mar. 201525 mar. 2015

Serie de la publicación

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

Conferencia

Conferencia7th Asian Conference on Intelligent Information and Database Systems, ACIIDS 2015
País/TerritorioIndonesia
CiudadBali
Período23/03/1525/03/15

Huella

Profundice en los temas de investigación de 'Solving the set covering problem with a shuffled frog leaping algorithm'. En conjunto forman una huella única.

Citar esto