Optimal delivery routing with wider drone-delivery areas along a shorter truck-route

作者：

Highlights：

• Modeling an optimal delivery route based on a truck and drones.

• Approach on the wider drone-delivery areas along a shorter truck-route.

• Finding shift-weights by NLP model after K-means clustering and TSP modeling.

• Verifying the effectiveness of the shift-weights through paired t-tests.

摘要

•Modeling an optimal delivery route based on a truck and drones.•Approach on the wider drone-delivery areas along a shorter truck-route.•Finding shift-weights by NLP model after K-means clustering and TSP modeling.•Verifying the effectiveness of the shift-weights through paired t-tests.

论文关键词：Drone,K-means clustering,TSP (traveling salesman problem),Delivery routing,Nonlinear programming

论文评审过程：Received 8 December 2017, Revised 18 March 2018, Accepted 19 March 2018, Available online 20 March 2018, Version of Record 10 April 2018.

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