Combining autonomous delivery robots and traditional vehicles with public transportation infrastructure in last-mile distribution

IF 6.7 1区 工程技术 Q1 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS
Gianpaolo Ghiani, Emanuela Guerriero, Emanuele Manni, Deborah Pareo
{"title":"Combining autonomous delivery robots and traditional vehicles with public transportation infrastructure in last-mile distribution","authors":"Gianpaolo Ghiani,&nbsp;Emanuela Guerriero,&nbsp;Emanuele Manni,&nbsp;Deborah Pareo","doi":"10.1016/j.cie.2025.111001","DOIUrl":null,"url":null,"abstract":"<div><div>The recent boom of e-commerce and the resulting concern about emissions increase are promoting the development of alternative paradigms for last-mile delivery, involving greener vehicles, such as air drones and autonomous delivery robots, which are also less sensitive to traffic congestion. In this paper, we study a last-mile distribution problem in which a heterogeneous fleet composed of both traditional vehicles and autonomous delivery robots is used to service a large number of customer requests in an urban area. The delivery robots use stations of the public transportation network as their depots. The problem amounts to building both van and delivery-robot routes in such a way as to minimize the distribution cost, meeting the constraints imposed by the different ranges and capacities of both vehicles. At the same time, another decision involves choosing at which stations of the public transportation network the delivery robots are based. For this purpose, we develop two variants of a matheuristic scheme based on the solution of a hybrid set-partitioning and location-based model. We perform thorough computational experiments on instances inspired by the problem of distributing drugs to pharmacies in the urban area of Rome (Italy) and show that, when the instance size grows, the proposed solution approach allows us to obtain significant cost reductions compared to both a straightforward solution of a mathematical model and a classical metaheuristic scheme. In addition, we show that combining autonomous delivery robots with traditional vehicles allows us to achieve important cost and emission reductions with respect to a traditional delivery scheme.</div></div>","PeriodicalId":55220,"journal":{"name":"Computers & Industrial Engineering","volume":"203 ","pages":"Article 111001"},"PeriodicalIF":6.7000,"publicationDate":"2025-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers & Industrial Engineering","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0360835225001470","RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

The recent boom of e-commerce and the resulting concern about emissions increase are promoting the development of alternative paradigms for last-mile delivery, involving greener vehicles, such as air drones and autonomous delivery robots, which are also less sensitive to traffic congestion. In this paper, we study a last-mile distribution problem in which a heterogeneous fleet composed of both traditional vehicles and autonomous delivery robots is used to service a large number of customer requests in an urban area. The delivery robots use stations of the public transportation network as their depots. The problem amounts to building both van and delivery-robot routes in such a way as to minimize the distribution cost, meeting the constraints imposed by the different ranges and capacities of both vehicles. At the same time, another decision involves choosing at which stations of the public transportation network the delivery robots are based. For this purpose, we develop two variants of a matheuristic scheme based on the solution of a hybrid set-partitioning and location-based model. We perform thorough computational experiments on instances inspired by the problem of distributing drugs to pharmacies in the urban area of Rome (Italy) and show that, when the instance size grows, the proposed solution approach allows us to obtain significant cost reductions compared to both a straightforward solution of a mathematical model and a classical metaheuristic scheme. In addition, we show that combining autonomous delivery robots with traditional vehicles allows us to achieve important cost and emission reductions with respect to a traditional delivery scheme.
求助全文
约1分钟内获得全文 求助全文
来源期刊
Computers & Industrial Engineering
Computers & Industrial Engineering 工程技术-工程:工业
CiteScore
12.70
自引率
12.70%
发文量
794
审稿时长
10.6 months
期刊介绍: Computers & Industrial Engineering (CAIE) is dedicated to researchers, educators, and practitioners in industrial engineering and related fields. Pioneering the integration of computers in research, education, and practice, industrial engineering has evolved to make computers and electronic communication integral to its domain. CAIE publishes original contributions focusing on the development of novel computerized methodologies to address industrial engineering problems. It also highlights the applications of these methodologies to issues within the broader industrial engineering and associated communities. The journal actively encourages submissions that push the boundaries of fundamental theories and concepts in industrial engineering techniques.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信