An Adaptive Heuristic Approach to Compute Upper and Lower Bounds for the Close-Enough Traveling Salesman Problem.
Francesco CarrabsCarmine CerroneRaffaele CerulliBruce L. GoldenPublished in: INFORMS J. Comput. (2020)
Keyphrases
- upper and lower bounds
- traveling salesman problem
- combinatorial optimization
- lin kernighan
- satisfy the triangle inequality
- traveling salesman
- upper bound
- lower and upper bounds
- lower bound
- ant colony optimization
- hamiltonian cycle
- simulated annealing
- crossover operator
- optimal solution
- metaheuristic
- search algorithm
- valid inequalities
- optimization problems
- branch and bound
- worst case
- solution quality
- vehicle routing problem
- tabu search
- beam search
- triangle inequality
- training data