Do multiple-objective metaheuristics deliver on their promises? A computational experiment on the set-covering problem.
Andrzej JaszkiewiczPublished in: IEEE Trans. Evol. Comput. (2003)
Keyphrases
- set covering problem
- bi objective
- multiple objectives
- multi objective
- ant colony optimization
- multi objective optimization
- efficient solutions
- knapsack problem
- branch and bound algorithm
- set covering
- column generation
- linear programming problems
- integer programming
- shortest path problem
- particle swarm optimization
- fitness function
- optimal solution
- genetic algorithm
- evolutionary algorithm
- metaheuristic
- mathematical programming
- simulated annealing
- optimization problems
- objective function
- network design
- lower bound
- vehicle routing problem
- combinatorial optimization
- nature inspired