An Improved Heuristic for Solving TSP Based on the Evolution of Easy Instances.
Satoshi FujitaShin'ichiro UmezanePublished in: PDPTA (2004)
Keyphrases
- combinatorial optimization
- traveling salesman problem
- timetabling problem
- lin kernighan
- travelling salesman
- benchmark instances
- neighbourhood search
- optimal solution
- stochastic local search
- finding an optimal solution
- randomly generated test instances
- mip solver
- knapsack problem
- random sat instances
- valid inequalities
- quadratic assignment problem
- mixed integer program
- simulated annealing
- exact methods
- metaheuristic
- finding optimal solutions
- lagrangean relaxation
- optimization problems
- lower and upper bounds
- test instances
- exact algorithms
- branch and bound algorithm
- cpu times
- memetic algorithm
- randomly generated
- initial solution
- vehicle routing problem
- variable ordering
- heuristic solution
- tabu search
- np complete problems
- genetic algorithm
- search algorithm
- satisfy the triangle inequality
- search procedures
- dynamic programming
- ant colony optimization
- admissible heuristics
- sat instances
- lp relaxation
- linear programming relaxation
- search space
- np hard
- job shop scheduling problem
- feasible solution
- constraint satisfaction
- sliding tile