Affiliation:
1. Dipartimento di Matematica Università di Bologna Cesena Italy
2. Facultad de Ingeniería y Ciencias Universidad Adolfo Ibáñez Viña del Mar Chile
Abstract
AbstractIn this article, we define a new routing problem that arises in the last‐mile delivery of parcels, in which customers can be served either directly at home by a capacitated truck, or possibly with a drone carried on the truck, or in a self‐service mode using one of the available lockers. We investigate four different formulations, and for one of them, we propose a branch‐and‐cut approach. We also discuss some possible variants of the original problem. In the computational experiments, we analyze and compare the performance of the four formulations for the problem and its variants, and we provide some useful managerial insights.
Funder
Ministry for Universities and Research
Subject
Computer Networks and Communications,Hardware and Architecture,Information Systems,Software
Reference90 articles.
1. Optimization Approaches for the Traveling Salesman Problem with Drone
2. Alibaba.Alibaba's drones deliver packages to islands.http://www.chinadaily.com.cn/business/2017‐11/07/content_34230012.htm 2022.
3. Amazon.Amazon hub.https://www.amazon.com/ulp/view 2022.
4. Amazon.Amazon primeair.https://www.aboutamazon.com/news/transportation/amazon‐prime‐air‐prepares‐for‐drone‐deliveries 2022.
5. Aphabet.Wing—transforming the way goods are transported.https://x.company/projects/wing/ 2022.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献