An Iterated Local Search Approach for Finding Provably Good Solutions for Very Large TSP Instances.
Peter MerzJutta HuhsePublished in: PPSN (2008)
Keyphrases
- iterated local search
- metaheuristic
- tabu search
- benchmark instances
- multi start
- ant colony optimization
- vehicle routing problem
- traveling salesman problem
- vehicle routing problem with time windows
- optimal solution
- combinatorial optimization
- search space
- optimization problems
- path relinking
- genetic algorithm
- search procedures
- simulated annealing
- scatter search
- np hard
- combinatorial optimization problems
- variable neighborhood descent
- variable neighborhood search
- combinatorial problems
- solution space
- global optimization
- valid inequalities
- memetic algorithm
- routing problem
- worst case
- heuristic methods
- cost function
- feasible solution