An Improved Adaptive Multi-Start Approach to Finding Near-Optimal Solutions to the Euclidean TSP.
Dan BonacheaEugene IngermanJoshua LevyScott McPeakPublished in: GECCO (2000)
Keyphrases
- multi start
- iterated local search
- path relinking
- traveling salesman problem
- tabu search
- metaheuristic
- optimal solution
- vehicle routing problem with time windows
- stochastic approximation
- global optimization
- scatter search
- benchmark problems
- genetic programming
- ant colony optimization
- solution quality
- optimization problems
- solution space
- lower and upper bounds
- scheduling problem
- search space
- genetic algorithm