A Novel Tour Construction Heuristic for Traveling Salesman Problem Using LFF Principle.
Sheqin DongFan GuoJun YuanRensheng WangXianlong HongPublished in: JCIS (2006)
Keyphrases
- traveling salesman problem
- combinatorial optimization
- traveling salesman
- lin kernighan
- benchmark instances
- variable neighborhood search
- neighborhood search
- ant colony optimization
- hamiltonian cycle
- path relinking
- combinatorial optimization problems
- combinatorial problems
- optimization problems
- satisfy the triangle inequality
- minimum spanning tree
- metaheuristic
- ant colony optimization algorithm
- transportation networks
- discrete particle swarm optimization
- simulated annealing
- crossover operator
- valid inequalities
- exact algorithms
- vehicle routing problem
- branch and bound
- tabu search
- genetic local search
- quadratic assignment problem
- mixed integer programming
- discrete optimization problems
- optimal solution
- branch and bound algorithm
- search space