An electromagnetism metaheuristic for the unicost set covering problem.
Zahra Naji AzimiPaolo TothLaura GalliPublished in: Eur. J. Oper. Res. (2010)
Keyphrases
- set covering problem
- metaheuristic
- branch and bound algorithm
- ant colony optimization
- bi objective
- set covering
- optimal solution
- combinatorial optimization
- column generation
- integer programming
- simulated annealing
- optimization problems
- search space
- tabu search
- combinatorial optimization problems
- scatter search
- particle swarm optimization
- branch and bound
- path relinking
- genetic algorithm
- benchmark instances
- lower bound
- solution space
- vehicle routing problem
- nature inspired
- np hard
- linear programming
- test problems
- swarm intelligence
- feasible solution
- max sat
- variable neighborhood search
- upper bound
- traveling salesman problem
- lagrangian relaxation
- multi objective
- benchmark problems