{"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}
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.
期刊介绍：
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 efficient 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 significant 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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
