loading
Papers

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Broderick Crawford 1 ; Ricardo Soto 1 ; Rodrigo Cuesta 1 ; Miguel Olivares-Suárez 1 ; Franklin Johnson 2 and Eduardo Olguín 3

Affiliations: 1 Pontificia Universidad Católica de Valparaíso, Chile ; 2 Universidad de Playa Ancha, Chile ; 3 Universidad San Sebastián, Chile

ISBN: 978-989-758-036-9

Keyword(s): Weighted Set Covering Problem, Metaheuristics, Firefly Algorithm, Artificial Bee Colony Algorithm, Swarm Intelligence.

Related Ontology Subjects/Areas/Topics: Artificial Intelligence ; Decision Support Systems ; Enterprise Software Technologies ; Intelligent Problem Solving ; Knowledge Engineering and Ontology Development ; Knowledge-Based Systems ; Software Engineering ; Symbolic Systems

Abstract: The Weighted Set Covering problem is a formal model for many industrial optimization problems. In the Weighted Set Covering Problem the goal is to choose a subset of columns of minimal cost in order to cover every row. Here, we present its resolution with two novel metaheuristics: Firefly Algorithm and Artificial Bee Colony Algorithm. The Firefly Algorithm is inspired by the flashing behaviour of fireflies. The main purpose of flashing is to act as a signal to attract other fireflies. The flashing light can be formulated in such a way that it is associated with the objective function to be optimized. The Artificial Bee Colony Algorithm mimics the food foraging behaviour of honey bee colonies. In its basic version the algorithm performs a kind of neighbourhood search combined with random search. Experimental results show that both are competitive in terms of solution quality with other recent metaheuristic approaches.

PDF ImageFull Text

Download
CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 3.227.2.246

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Crawford, B.; Soto, R.; Cuesta, R.; Olivares-Suárez, M.; Johnson, F. and Olguín, E. (2014). Two Swarm Intelligence Algorithms for the Set Covering Problem.In Proceedings of the 9th International Conference on Software Engineering and Applications - Volume 1: ICSOFT-EA, (ICSOFT 2014) ISBN 978-989-758-036-9, pages 60-69. DOI: 10.5220/0005093500600069

@conference{icsoft-ea14,
author={Broderick Crawford. and Ricardo Soto. and Rodrigo Cuesta. and Miguel Olivares{-}Suárez. and Franklin Johnson. and Eduardo Olguín.},
title={Two Swarm Intelligence Algorithms for the Set Covering Problem},
booktitle={Proceedings of the 9th International Conference on Software Engineering and Applications - Volume 1: ICSOFT-EA, (ICSOFT 2014)},
year={2014},
pages={60-69},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005093500600069},
isbn={978-989-758-036-9},
}

TY - CONF

JO - Proceedings of the 9th International Conference on Software Engineering and Applications - Volume 1: ICSOFT-EA, (ICSOFT 2014)
TI - Two Swarm Intelligence Algorithms for the Set Covering Problem
SN - 978-989-758-036-9
AU - Crawford, B.
AU - Soto, R.
AU - Cuesta, R.
AU - Olivares-Suárez, M.
AU - Johnson, F.
AU - Olguín, E.
PY - 2014
SP - 60
EP - 69
DO - 10.5220/0005093500600069

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.