Author
Listed:
- Seyed Mohammad Javad Mirzapour Al-E-Hashem
(AUT - Amirkabir University of Technology, Rennes SB - Rennes School of Business)
- Taha-Hossein Hejazi
(AUT - Amirkabir University of Technology)
- Ghazal Haghverdizadeh
(AUT - Amirkabir University of Technology)
- Mohsen Shidpour
(AUT - Amirkabir University of Technology)
Abstract
In response to the increasing demand for faster customer service and cost-effective solutions in competitive markets, many companies are exploring strategies and tools to streamline their services. One emerging approach involves the integration of drones with trucks, offering potential benefits such as reduced environmental impact and delivery time. This study focuses on the use of a single truck coordinating with multiple drones for postal package delivery. The drones are transported by the truck, and both vehicles are responsible for carrying out deliveries. To account for weather uncertainties, specifically wind direction and speed affecting drone travel time, a robust optimization model is developed to address the truck-drone routing problem. Additionally, a hybrid metaheuristic algorithm is proposed, combining Adaptive Large Neighborhood Search, Clarke and Wright Saving Algorithm, and Genetic Algorithm. The effectiveness of this algorithm is assessed through numerical experiments, including sensitivity analyses on key problem parameters. The findings demonstrate that the proposed model has practical applications in last-mile delivery services, while the algorithm provides near-optimal solutions within a reasonable timeframe (ALNS reaches the solutions 3500% faster than GAMS for small-sized problems in average). Also the results show that with the 100% increase in average distance between nodes in the network, the service time increases by more than 200%.
Suggested Citation
Seyed Mohammad Javad Mirzapour Al-E-Hashem & Taha-Hossein Hejazi & Ghazal Haghverdizadeh & Mohsen Shidpour, 2024.
"Optimizing last-mile delivery services: a robust truck-drone cooperation model and hybrid metaheuristic algorithm,"
Post-Print
hal-05741801, HAL.
Handle:
RePEc:hal:journl:hal-05741801
DOI: 10.1007/s10479-024-06164-5
Download full text from publisher
To our knowledge, this item is not available for
download. To find whether it is available, there are three
options:
1. Check below whether another version of this item is available online.
2. Check on the provider's
web page
whether it is in fact available.
3. Perform a
for a similarly titled item that would be
available.
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hal:journl:hal-05741801. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.