On the refinement of bounds of heuristic algorithms for the traveling salesman problem.
Bernd JerominFrank KörnerPublished in: Math. Program. (1985)
Keyphrases
- traveling salesman problem
- combinatorial optimization
- ant colony optimization
- optimization problems
- lower bound
- upper bound
- transportation networks
- combinatorial problems
- crossover operator
- genetic local search
- discrete optimization problems
- valid inequalities
- combinatorial optimization problems
- vehicle routing problem
- lower and upper bounds
- traveling salesman
- ant colony optimization algorithm
- discrete particle swarm optimization
- hamiltonian cycle
- metaheuristic
- evolutionary algorithm
- knapsack problem
- nature inspired
- neural network