Title
A 2-level metaheuristic for the set covering problem
Date Issued
01 January 2012
Access level
open access
Resource Type
journal article
Author(s)
Pontificia Universidad Católica de Valparaíso
Publisher(s)
Agora University
Abstract
Metaheuristics are solution methods which combine local improvement procedures and higher level strategies for solving combinatorial and nonlinear optimization problems. In general, metaheuristics require an important amount of effort focused on parameter setting to improve its performance. In this work a 2-level metaheuristic approach is proposed so that Scatter Search and Ant Colony Optimization act as "low level" metaheuristics, whose parameters are set by a "higher level" Genetic Algorithm during execution, seeking to improve the performance and to reduce the maintenance. The Set Covering Problem is taken as reference since is one of the most important optimization problems, serving as basis for facility location problems, airline crew scheduling, nurse scheduling, and resource allocation. © 2006-2012 by CCC Publications.
Start page
377
End page
387
Volume
7
Issue
2
Language
English
OCDE Knowledge area
Ciencias de la computación
Matemáticas
Subjects
Scopus EID
2-s2.0-84862661432
Source
International Journal of Computers, Communications and Control
ISSN of the container
18419836
Sources of information:
Directorio de Producción Científica
Scopus