An efficient branch-and-cut algorithm for the parallel drone scheduling traveling salesman problem.
Minh Anh NguyenHai Long LuongMinh Hoàng HàHa-Bang BanPublished in: CoRR (2021)
Keyphrases
- traveling salesman problem
- combinatorial optimization
- ant colony optimization
- hamiltonian cycle
- minimum spanning tree
- computational complexity
- cost function
- dynamic programming
- discrete particle swarm optimization
- ant colony optimization algorithm
- np hard
- optimal solution
- optimization problems
- combinatorial optimization problems
- objective function
- vehicle routing problem
- parallel machines
- reinforcement learning
- similarity measure
- genetic algorithm