A heuristic circulation-network approach to solve the multi-traveling salesman problem.
Alberto Garcia-DiazPublished in: Networks (1985)
Keyphrases
- traveling salesman problem
- discrete optimization problems
- combinatorial optimization
- transportation networks
- lin kernighan
- traveling salesman
- variable neighborhood search
- optimization problems
- benchmark instances
- combinatorial optimization problems
- ant colony optimization
- neighborhood search
- minimum spanning tree
- hamiltonian cycle
- ant colony optimization algorithm
- combinatorial problems
- satisfy the triangle inequality
- discrete particle swarm optimization
- simulated annealing
- path relinking
- metaheuristic
- genetic local search
- valid inequalities
- crossover operator
- constraint satisfaction
- search algorithm
- vehicle routing problem
- solution quality
- branch and bound algorithm
- tabu search