Skip to main content
Log in

Matheuristic algorithms for the parallel drone scheduling traveling salesman problem

  • Original Research
  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

In a near future drones are likely to become a viable way of distributing parcels in a urban environment. In this paper we consider the parallel drone scheduling traveling salesman problem, where a set of customers requiring a delivery is split between a truck and a fleet of drones, with the aim of minimizing the total time required to service all the customers. We present a set of matheuristic methods for the problem. The new approaches are validated via an experimental campaign on two sets of benchmarks available in the literature. It is shown that the approaches we propose perform very well on small/medium size instances. Solving a mixed integer linear programming model to optimality leads to the first optimality proof for all the instances with 20 customers considered, while the heuristics are shown to be fast and effective on the same dataset. When considering larger instances with 48 to 229 customers, the results are competitive with state-of-the-art methods and lead to 28 new best known solutions out of the 90 instances considered.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

Download references

Acknowledgements

The authors are very grateful to Raïssa G. Mbiadou Saleu and Dominique Feillet for the suggestions and the useful discussions.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Roberto Montemanni.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Dell’Amico, M., Montemanni, R. & Novellani, S. Matheuristic algorithms for the parallel drone scheduling traveling salesman problem. Ann Oper Res 289, 211–226 (2020). https://doi.org/10.1007/s10479-020-03562-3

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-020-03562-3

Keywords

Navigation