z-logo
open-access-imgOpen Access
A 2-level Metaheuristic for the Set Covering Problem
Author(s) -
Claudio Valenzuela,
Broderick Crawford,
Ricardo Soto,
Éric Monfroy,
Fernando Paredes
Publication year - 2014
Publication title -
international journal of computers communications and control
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.422
H-Index - 33
eISSN - 1841-9844
pISSN - 1841-9836
DOI - 10.15837/ijccc.2012.2.1417
Subject(s) - metaheuristic , computer science , parallel metaheuristic , mathematical optimization , ant colony optimization algorithms , crew scheduling , genetic algorithm , set (abstract data type) , scheduling (production processes) , combinatorial optimization , algorithm , mathematics , machine learning , meta optimization , programming language
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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom