Benchmark Instances and Optimal Solutions for the Traveling Salesman Problem with Drone.
Mauro Dell'AmicoRoberto MontemanniStefano NovellaniPublished in: CoRR (2021)
Keyphrases
- traveling salesman problem
- benchmark instances
- optimal solution
- discrete particle swarm optimization
- metaheuristic
- ant colony optimization
- combinatorial optimization
- vehicle routing problem
- optimization problems
- variable neighborhood search
- combinatorial problems
- combinatorial optimization problems
- objective function
- search space
- tabu search
- feasible solution
- branch and bound
- branch and bound algorithm
- solution quality
- np hard
- path relinking
- hybrid algorithm
- simulated annealing
- minimum spanning tree
- evolutionary algorithm
- genetic algorithm
- lower bound
- linear programming
- search algorithm
- linear program
- job shop scheduling problem
- traveling salesman