A new hybrid heuristic approach for solving large traveling salesman problem.
Cheng-Fa TsaiChun-Wei TsaiChing-Chang TsengPublished in: Inf. Sci. (2004)
Keyphrases
- traveling salesman problem
- combinatorial optimization
- discrete optimization problems
- lin kernighan
- traveling salesman
- combinatorial problems
- simulated annealing
- variable neighborhood search
- combinatorial optimization problems
- benchmark instances
- neighborhood search
- metaheuristic
- ant colony optimization
- exact algorithms
- optimization problems
- branch and bound
- branch and bound algorithm
- vehicle routing problem
- path relinking
- ant colony optimization algorithm
- minimum spanning tree
- hamiltonian cycle
- genetic local search
- quadratic assignment problem
- tabu search
- discrete particle swarm optimization
- linear programming
- optimal solution
- discrete optimization
- dynamic programming
- subtour elimination