Vehicle routing problem with drones considering time windows

作者：

Highlights：

• Vehicle routing problem with drones and time window constraints is discussed.

• A mixed-integer programming formulation is presented.

• The model is solved with a metaheuristic based on variable neighborhood search.

• Comparison analysis to the benchmark algorithm is performed.

• Managerial insights are derived based on the results.

摘要

•Vehicle routing problem with drones and time window constraints is discussed.•A mixed-integer programming formulation is presented.•The model is solved with a metaheuristic based on variable neighborhood search.•Comparison analysis to the benchmark algorithm is performed.•Managerial insights are derived based on the results.

论文关键词：Vehicle routing problem with drones,Time windows,Unmanned aerial vehicles,Logistics,Variable neighborhood search

论文评审过程：Received 25 August 2021, Revised 30 October 2021, Accepted 19 November 2021, Available online 27 November 2021, Version of Record 3 December 2021.

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