Variable and large neighborhood search to solve the multiobjective set covering problem.
Thibaut LustDaniel TuyttensPublished in: J. Heuristics (2014)
Keyphrases
- set covering problem
- multi objective
- bi objective
- set covering
- multiobjective optimization
- evolutionary algorithm
- optimization algorithm
- multi objective optimization
- branch and bound algorithm
- integer programming
- column generation
- multiple objectives
- pareto local search
- efficient solutions
- nsga ii
- vehicle routing problem
- particle swarm optimization
- objective function
- genetic algorithm
- neural network
- mathematical programming
- network design
- heuristic search