A comparison of three recent nature-inspired metaheuristics for the set covering problem

Crawford B.; Soto R.; Peña C.; Riquelme-Leiva M.; Torres-Rojas C.; Misra S.; Johnson F.; Paredes F.

dc.contributor.author	Crawford B.
dc.contributor.author	Soto R.
dc.contributor.author	Peña C.
dc.contributor.author	Riquelme-Leiva M.
dc.contributor.author	Torres-Rojas C.
dc.contributor.author	Misra S.
dc.contributor.author	Johnson F.
dc.contributor.author	Paredes F.
dc.date.accessioned	2020-09-02T22:15:29Z
dc.date.available	2020-09-02T22:15:29Z
dc.date.issued	2015
dc.identifier	10.1007/978-3-319-21410-834
dc.identifier.citation	9158, , 431-443
dc.identifier.issn	03029743
dc.identifier.uri	https://hdl.handle.net/20.500.12728/4072
dc.description	The Set Covering Problem (SCP) is a classic problem in combinatorial optimization. SCP has many applications in engineering, including problems involving routing, scheduling, stock cutting, electoral redistricting and others important real life situations. Because of its importance, SCP has attracted attention of many researchers. However, SCP instances are known as complex and generally NP-hard problems. Due to the combinatorial nature of this problem, during the last decades, several metaheuristics have been applied to obtain efficient solutions. This paper presents a metaheuristics comparison for the SCP. Three recent nature-inspired metaheuristics are considered: Shuffled Frog Leaping, Firefly and Fruit Fly algorithms. The results show that they can obtainn optimal or close to optimal solutions at low computational cost. © Springer International Publishing Switzerland 2015.
dc.language.iso	en
dc.publisher	Springer Verlag
dc.source	Gavrilova M.L.Gervasi O.Murgante B.Misra S.Torre C.Taniar D.Apduhan B.O.Rocha A.M.A.C.Misra S.
dc.subject	Firefly algorithm
dc.subject	Fruit fly algorithm
dc.subject	Metaheuristics
dc.subject	Set Covering Problem
dc.subject	Shuffled Frog Leaping Algorithm
dc.subject	Algorithms
dc.subject	Bioluminescence
dc.subject	Combinatorial optimization
dc.subject	Computational complexity
dc.subject	Fruits
dc.subject	Heuristic algorithms
dc.subject	Firefly algorithms
dc.subject	Fruit flies
dc.subject	Meta heuristics
dc.subject	Set covering problem
dc.subject	Shuffled frog leaping algorithm (SFLA)
dc.subject	Optimization
dc.title	A comparison of three recent nature-inspired metaheuristics for the set covering problem
dc.type	Conference Paper

Ficheros en el ítem

Nombre:: item_2-s2.0-84949035299.pdf
Tamaño:: 2.546Kb
Formato:: PDF

Ver/

Este ítem aparece en la(s) siguiente(s) colección(ones)

Artículos científicos

Mostrar el registro sencillo del ítem

Repositorio Académico

A comparison of three recent nature-inspired metaheuristics for the set covering problem

Ficheros en el ítem

Este ítem aparece en la(s) siguiente(s) colección(ones)

Ítems relacionados

A binary fruit fly optimization algorithm to solve the set covering problem (2020) ﻿

Modified binary firefly algorithms with different transfer functions for solving set covering problems (2020) ﻿

Set covering problem solved by new binary firefly algorithm [Problema de Cobertura de Conjunto Resuelto por el Nuevo Algoritmo Luciérnaga Binario] (2020) ﻿

A binary fruit fly optimization algorithm to solve the set covering problem (2020)

Modified binary firefly algorithms with different transfer functions for solving set covering problems (2020)

Set covering problem solved by new binary firefly algorithm [Problema de Cobertura de Conjunto Resuelto por el Nuevo Algoritmo Luciérnaga Binario] (2020)