A backbone based TSP heuristic for large instances.
Gerold JägerChangxing DongBoris GoldengorinPaul MolitorDirk RichterPublished in: J. Heuristics (2014)
Keyphrases
- traveling salesman problem
- lin kernighan
- travelling salesman
- benchmark instances
- traveling salesman
- random sat instances
- neighbourhood search
- optimal solution
- combinatorial optimization
- lagrangean relaxation
- stochastic local search
- initial solution
- cpu times
- heuristic solution
- timetabling problem
- optimization problems
- closest string
- valid inequalities
- ant colony optimization
- lower and upper bounds
- constructive heuristic
- randomly generated
- vehicle routing problem
- test instances
- metaheuristic
- randomly generated problem instances
- search space
- genetic algorithm
- mixed integer linear
- feasible solution
- search algorithm
- set of randomly generated instances
- quadratic assignment problem
- lower bound
- finding an optimal solution
- tabu search
- search procedures
- heuristic methods
- solution quality
- branch and bound algorithm