Energy-constrained multi-visit TSP with multiple drones considering non-customer rendezvous locations

作者：

Highlights：

• We study a multi-visit traveling salesman problem with multiple drones.

• Drone energy consumption in all phases of flight is considered to plan drone trips.

• We propose a subproblem to locate candidate non-customer retrieval nodes for drones.

• MILP formulations are developed for the proposed subproblem and problem.

• Effective heuristic and matheuristic solution approaches are provided for problems.

摘要

•We study a multi-visit traveling salesman problem with multiple drones.•Drone energy consumption in all phases of flight is considered to plan drone trips.•We propose a subproblem to locate candidate non-customer retrieval nodes for drones.•MILP formulations are developed for the proposed subproblem and problem.•Effective heuristic and matheuristic solution approaches are provided for problems.

论文关键词：Drone,Traveling salesman problem,Logistics,Last-mile delivery,Mixed-integer programming,Matheuristic approach

论文评审过程：Received 19 March 2022, Revised 29 July 2022, Accepted 6 August 2022, Available online 11 August 2022, Version of Record 17 August 2022.

论文官网地址：https://doi.org/10.1016/j.eswa.2022.118479