A 2-level metaheuristic for the set covering problem

Claudio Valenzuela, Broderick Crawford, Ricardo Soto, Eric Monfroy, Fernando Paredes

Research output: Contribution to journalArticlepeer-review

21 Scopus citations

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.

Original languageEnglish
Pages (from-to)377-387
Number of pages11
JournalInternational Journal of Computers, Communications and Control
Volume7
Issue number2
DOIs
StatePublished - 2012
Externally publishedYes

Keywords

  • Ant colony optimization
  • Genetic algorithm
  • Metaheuristics
  • Scatter search
  • Set covering problem

Fingerprint

Dive into the research topics of 'A 2-level metaheuristic for the set covering problem'. Together they form a unique fingerprint.

Cite this