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: 4OR (2023)
Keyphrases
- traveling salesman problem
- combinatorial optimization
- ant colony optimization
- hamiltonian cycle
- search space
- discrete particle swarm optimization
- cost function
- genetic local search
- particle swarm optimization
- dynamic programming
- parallel machines
- ant colony optimization algorithm
- objective function
- traveling salesman
- similarity measure
- simulated annealing
- scheduling problem
- swarm intelligence
- minimum spanning tree
- neural network