无人机和储物柜的最后一英里配送

IF 1.6 4区计算机科学 Q4 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE

Networks Pub Date : 2023-10-04 DOI:10.1002/net.22190

Marco Antonio Boschetti, Stefano Novellani

{"title":"无人机和储物柜的最后一英里配送","authors":"Marco Antonio Boschetti, Stefano Novellani","doi":"10.1002/net.22190","DOIUrl":null,"url":null,"abstract":"Abstract In 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.","PeriodicalId":54734,"journal":{"name":"Networks","volume":"99 1","pages":"0"},"PeriodicalIF":1.6000,"publicationDate":"2023-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Last‐mile delivery with drone and lockers\",\"authors\":\"Marco Antonio Boschetti, Stefano Novellani\",\"doi\":\"10.1002/net.22190\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract In 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.\",\"PeriodicalId\":54734,\"journal\":{\"name\":\"Networks\",\"volume\":\"99 1\",\"pages\":\"0\"},\"PeriodicalIF\":1.6000,\"publicationDate\":\"2023-10-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1002/net.22190\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1002/net.22190","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}

引用次数: 0

摘要

在本文中，我们定义了一个新的路线问题，该问题出现在包裹的最后一英里交付中，在这种情况下，客户可以直接在家中由一辆有容量的卡车提供服务，或者可能使用卡车上的无人机，或者使用可用的储物柜之一以自助服务模式提供服务。我们研究了四种不同的配方，并为其中之一，我们提出了一个分支和切割方法。我们还讨论了原问题的一些可能的变体。在计算实验中，我们分析和比较了问题及其变体的四种公式的性能，并提供了一些有用的管理见解。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Last‐mile delivery with drone and lockers

Abstract In 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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Networks 工程技术-计算机：硬件

CiteScore

4.40

自引率

9.50%

发文量

审稿时长

12 months

期刊介绍： Network problems are pervasive in our modern technological society, as witnessed by our reliance on physical networks that provide power, communication, and transportation. As well, a number of processes can be modeled using logical networks, as in the scheduling of interdependent tasks, the dating of archaeological artifacts, or the compilation of subroutines comprising a large computer program. Networks provide a common framework for posing and studying problems that often have wider applicability than their originating context. The goal of this journal is to provide a central forum for the distribution of timely information about network problems, their design and mathematical analysis, as well as efficient algorithms for carrying out optimization on networks. The nonstandard modeling of diverse processes using networks and network concepts is also of interest. Consequently, the disciplines that are useful in studying networks are varied, including applied mathematics, operations research, computer science, discrete mathematics, and economics. Networks publishes material on the analytic modeling of problems using networks, the mathematical analysis of network problems, the design of computationally eﬃcient network algorithms, and innovative case studies of successful network applications. We do not typically publish works that fall in the realm of pure graph theory (without signiﬁcant algorithmic and modeling contributions) or papers that deal with engineering aspects of network design. Since the audience for this journal is then necessarily broad, articles that impact multiple application areas or that creatively use new or existing methodologies are especially appropriate. We seek to publish original, well-written research papers that make a substantive contribution to the knowledge base. In addition, tutorial and survey articles are welcomed. All manuscripts are carefully refereed.