A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem.
Athanassios NikolakopoulosHaralambos SarimveisPublished in: Eur. J. Oper. Res. (2007)
Keyphrases
- traveling salesman problem
- lin kernighan
- neighborhood search
- combinatorial optimization
- traveling salesman
- threshold accepting
- benchmark instances
- metaheuristic
- discrete optimization problems
- initial solution
- ant colony optimization
- simulated annealing
- variable neighborhood search
- job shop scheduling problem
- optimal solution
- valid inequalities
- quadratic assignment problem
- optimization problems
- path relinking
- tabu search
- combinatorial optimization problems
- aco algorithm
- solution quality
- vehicle routing problem
- search procedures
- search procedure
- solution space
- optimization method
- benchmark problems
- scatter search
- memetic algorithm
- mathematical model
- harmony search
- evolutionary algorithm
- lower bound
- search algorithm
- genetic algorithm
- branch and bound
- exact algorithms
- test instances
- branch and bound algorithm
- routing problem
- integer programming