@inproceedings{eb0d5ba4a0974761a3adab30dc282473,
title = "The impact of a new formulation when solving the set covering problem using the ACO metaheuristic",
abstract = "The Set Covering Problem (SCP) is a well-known NP hard discrete optimization problem that has been applied to a wide range of industrial applications, including those involving scheduling, production planning and location problems. The main difficulties when solving the SCP with a metaheuristic approach are the solution infeasibility and set redundancy. In this paper we evaluate a state of the art new formulation of the SCP which eliminates the need to address the infeasibility and set redundancy issues. The experimental results, conducted on a portfolio of SCPs from the Beasley{\textquoteright}s OR-Library, show the gains obtained when using a new formulation to solve the SCP using the ACO metaheuristic.",
keywords = "Ant Colony Optimization, Metaheuristics, Set Covering Problem",
author = "Broderick Crawford and Ricardo Soto and Wenceslao Palma and Fernando Paredes and Franklin Johnson and Enrique Norero",
note = "Publisher Copyright: {\textcopyright} Springer International Publishing Switzerland 2015.; 3rd International Conference on Modelling, Computation and Optimization in Information Systems and Management Sciences, MCO 2015 ; Conference date: 11-05-2015 Through 13-05-2015",
year = "2015",
doi = "10.1007/978-3-319-18167-7_19",
language = "English",
isbn = "9783319181660",
series = "Advances in Intelligent Systems and Computing",
publisher = "Springer Verlag",
pages = "209--218",
editor = "{Le Thi}, {Hoai An} and Nguyen, {Ngoc Thanh} and Dinh, {Tao Pham}",
booktitle = "Modelling, Computation and Optimization in Information Systems and Management Sciences - Proceedings of the 3rd International Conference on Modelling, Computation and Optimization in Information Systems and Management Sciences, MCO 2015 - Part II",
}