A morphing procedure to supplement a simulated annealing heuristic for cost- andcoverage-correlated set-covering problems.
Michael J. BruscoLarry W. JacobsGary M. ThompsonPublished in: Ann. Oper. Res. (1999)
Keyphrases
- simulated annealing
- set covering problem
- search procedure
- set covering
- tabu search
- branch and bound algorithm
- integer programming
- solution quality
- combinatorial optimization
- genetic algorithm
- column generation
- simulated annealing algorithm
- metaheuristic
- hill climbing
- benchmark problems
- branch and bound
- search algorithm
- bi objective
- heuristic function
- evolutionary algorithm
- lower bound
- highly correlated
- optimal cost
- total cost
- expected cost
- search effort
- heuristic search
- state space
- optimal solution
- fixed cost
- linear programming
- wireless sensor networks