A Snail Heuristic for the Euclidean Traveling Salesman Problem.
Monia BellalounaWalid KhaznajiMohamed Abdellahi AmarPublished in: CTW (2015)
Keyphrases
- traveling salesman problem
- combinatorial optimization
- lin kernighan
- traveling salesman
- benchmark instances
- variable neighborhood search
- neighborhood search
- minimum spanning tree
- ant colony optimization
- combinatorial optimization problems
- transportation networks
- ant colony optimization algorithm
- combinatorial problems
- satisfy the triangle inequality
- optimization problems
- simulated annealing
- euclidean distance
- hamiltonian cycle
- discrete particle swarm optimization
- metaheuristic
- discrete optimization problems
- valid inequalities
- path relinking
- crossover operator
- exact algorithms
- genetic local search
- similarity measure
- vehicle routing problem
- branch and bound algorithm
- tabu search
- dynamic programming
- optimal solution
- mixed integer programming
- lagrangian relaxation
- search space
- neural network