An efficient branch-and-cut algorithm for the parallel drone scheduling traveling salesman problem

11/09/2021

∙

by   Minh Anh Nguyen, et al.

∙

0

∙

share

We propose an efficient branch-and-cut algorithm to exactly solve the parallel drone scheduling traveling salesman problem. Our algorithm can find optimal solutions for all but two existing instances with up to 229 customers in a reasonable running time. To make the problem more challenging for future methods, we introduce two new sets of 120 larger instances with the number of customers varying from 318 to 783 and test our algorithm and investigate the performance of state-of-the-art metaheuristics on these instances.