A Meta-heuristic with Orthogonal Experiment for the Set Covering Problem.
Jingpeng LiRaymond S. K. KwanPublished in: J. Math. Model. Algorithms (2004)
Keyphrases
- metaheuristic
- set covering problem
- branch and bound algorithm
- set covering
- ant colony optimization
- bi objective
- combinatorial optimization
- optimal solution
- column generation
- integer programming
- optimization problems
- tabu search
- simulated annealing
- search space
- scatter search
- genetic algorithm
- branch and bound
- combinatorial problems
- combinatorial optimization problems
- path relinking
- vehicle routing problem
- particle swarm optimization
- benchmark instances
- nature inspired
- knapsack problem
- solution space
- harmony search
- evolutionary algorithm
- linear programming
- variable neighborhood search
- mathematical programming
- neural network
- special case
- harmony search algorithm
- upper bound
- np hard