An efficient composite heuristic for the symmetric generalized traveling salesman problem.
Jacques RenaudFayez F. BoctorPublished in: Eur. J. Oper. Res. (1998)
Keyphrases
- traveling salesman problem
- satisfy the triangle inequality
- combinatorial optimization
- lin kernighan
- traveling salesman
- variable neighborhood search
- benchmark instances
- neighborhood search
- optimization problems
- minimum spanning tree
- discrete particle swarm optimization
- combinatorial problems
- combinatorial optimization problems
- ant colony optimization
- hamiltonian cycle
- ant colony optimization algorithm
- path relinking
- genetic local search
- vehicle routing problem
- metaheuristic
- simulated annealing
- transportation networks
- crossover operator
- beam search
- triangle inequality
- search procedure
- heuristic search
- dynamic programming