On the effectiveness of incorporating randomness and memory into a multi-start metaheuristic with application to the Set Covering Problem.
Guanghui LanGail W. DePuyPublished in: Comput. Ind. Eng. (2006)
Keyphrases
- multi start
- metaheuristic
- iterated local search
- tabu search
- set covering problem
- path relinking
- global optimization
- vehicle routing problem with time windows
- ant colony optimization
- optimization problems
- simulated annealing
- stochastic approximation
- column generation
- set covering
- scatter search
- combinatorial optimization problems
- optimal solution
- integer programming
- vehicle routing problem
- nature inspired
- search space
- solution space
- branch and bound algorithm
- combinatorial optimization
- genetic algorithm
- routing problem
- combinatorial problems
- bi objective
- solution quality
- particle swarm optimization
- linear programming