The optimum assignments and a new heuristic approach for the traveling salesman problem.
Kabekode V. S. BhatPublished in: Inf. Sci. (1982)
Keyphrases
- traveling salesman problem
- combinatorial optimization
- lin kernighan
- traveling salesman
- benchmark instances
- variable neighborhood search
- neighborhood search
- minimum spanning tree
- optimization problems
- ant colony optimization
- combinatorial problems
- satisfy the triangle inequality
- combinatorial optimization problems
- path relinking
- valid inequalities
- ant colony optimization algorithm
- discrete particle swarm optimization
- transportation networks
- branch and bound
- branch and bound algorithm
- vehicle routing problem
- tabu search
- metaheuristic
- simulated annealing
- neural network
- search algorithm
- hamiltonian cycle
- crossover operator
- quadratic assignment problem
- discrete optimization problems
- dynamic programming
- optimal solution
- objective function
- genetic local search
- exact algorithms
- heuristic methods
- hill climbing
- constraint satisfaction
- lower bound