A 2-level Metaheuristic for the Set Covering Problem.
Claudio ValenzuelaBroderick CrawfordRicardo SotoÉric MonfroyFernando ParedesPublished in: Int. J. Comput. Commun. Control (2012)
Keyphrases
- metaheuristic
- set covering problem
- ant colony optimization
- simulated annealing
- scatter search
- branch and bound algorithm
- optimization problems
- optimal solution
- set covering
- combinatorial optimization
- tabu search
- search space
- column generation
- bi objective
- path relinking
- iterated local search
- solution space
- genetic algorithm
- vehicle routing problem
- integer programming
- combinatorial optimization problems
- branch and bound
- particle swarm optimization
- nature inspired
- variable neighborhood search
- search algorithm
- ant colony optimization metaheuristic
- benchmark instances
- heuristic search
- np complete
- lower bound
- guided local search