城市包裹众包配送的滚动优化调度与新订单插入

IF 4.1 2区 工程技术 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS
Xiaoping Liang , Hualong Yang , Zheng Wang
{"title":"城市包裹众包配送的滚动优化调度与新订单插入","authors":"Xiaoping Liang ,&nbsp;Hualong Yang ,&nbsp;Zheng Wang","doi":"10.1016/j.cor.2024.106779","DOIUrl":null,"url":null,"abstract":"<div><p>The rapid development of mobile information technology has introduced numerous new solutions for delivery companies to enhance profits. One such solution employed by some companies is crowdsourced delivery. In this paper, we focus on rolling optimal scheduling for urban parcel crowdsourced delivery by utilizing private cars that will be in passing with the incorporation of new order insertion. The bonus incentive strategy is introduced to enhance the delivery probability of private car drivers. A static model and a rolling optimization model to maximize profits and the number of parcels delivered by private cars are established. To address the NP-hard problem, a hybrid genetic algorithm and insertion algorithm are designed. Numerical experiments are carried out to verify the proposed method in different scenarios, including the scattered network, clustered network, Dalian network, and Foursquare network. The computational results demonstrate that the method enhances the matching ratio and increases profits. Utilizing private cars that will be in passing for urban parcel delivery reduces the need for dedicated vehicles, mitigating traffic growth and alleviating traffic congestion. Increasing the private car-parcel ratio improves profits and the matching ratio while reducing traffic growth. Raising the incentive coefficient for bonuses increases the matching ratio and detour distance, but profits first increase and then decrease, and delivery distance by dedicated vehicles decreases. Our research findings offer a more rational basis for green urban parcel delivery decision-making by companies.</p></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"171 ","pages":"Article 106779"},"PeriodicalIF":4.1000,"publicationDate":"2024-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Rolling optimal scheduling for urban parcel crowdsourced delivery with new order insertion\",\"authors\":\"Xiaoping Liang ,&nbsp;Hualong Yang ,&nbsp;Zheng Wang\",\"doi\":\"10.1016/j.cor.2024.106779\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>The rapid development of mobile information technology has introduced numerous new solutions for delivery companies to enhance profits. One such solution employed by some companies is crowdsourced delivery. In this paper, we focus on rolling optimal scheduling for urban parcel crowdsourced delivery by utilizing private cars that will be in passing with the incorporation of new order insertion. The bonus incentive strategy is introduced to enhance the delivery probability of private car drivers. A static model and a rolling optimization model to maximize profits and the number of parcels delivered by private cars are established. To address the NP-hard problem, a hybrid genetic algorithm and insertion algorithm are designed. Numerical experiments are carried out to verify the proposed method in different scenarios, including the scattered network, clustered network, Dalian network, and Foursquare network. The computational results demonstrate that the method enhances the matching ratio and increases profits. Utilizing private cars that will be in passing for urban parcel delivery reduces the need for dedicated vehicles, mitigating traffic growth and alleviating traffic congestion. Increasing the private car-parcel ratio improves profits and the matching ratio while reducing traffic growth. Raising the incentive coefficient for bonuses increases the matching ratio and detour distance, but profits first increase and then decrease, and delivery distance by dedicated vehicles decreases. Our research findings offer a more rational basis for green urban parcel delivery decision-making by companies.</p></div>\",\"PeriodicalId\":10542,\"journal\":{\"name\":\"Computers & Operations Research\",\"volume\":\"171 \",\"pages\":\"Article 106779\"},\"PeriodicalIF\":4.1000,\"publicationDate\":\"2024-07-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computers & Operations Research\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S030505482400251X\",\"RegionNum\":2,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers & Operations Research","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S030505482400251X","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

摘要

移动信息技术的快速发展为快递公司提高利润带来了许多新的解决方案。众包配送就是一些公司采用的解决方案之一。在本文中,我们重点研究了利用私家车进行城市包裹众包配送的滚动优化调度。本文引入了奖金激励策略,以提高私家车司机的配送概率。建立了一个静态模型和一个滚动优化模型,以实现利润最大化和私家车投递包裹数量最大化。为解决 NP 难问题,设计了混合遗传算法和插入算法。在分散网络、集群网络、大连网络和 Foursquare 网络等不同场景下进行了数值实验,验证了所提出的方法。计算结果表明,该方法提高了匹配率,增加了利润。利用顺路的私家车投递城市包裹,可以减少对专用车辆的需求,缓解交通流量的增长和交通拥堵。提高私家车与包裹的比例可以提高利润和匹配率,同时减少交通流量的增长。提高奖金激励系数可以提高匹配率和绕行距离,但利润先增后减、专车配送距离减少。我们的研究成果为企业的绿色城市包裹投递决策提供了更加合理的依据。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Rolling optimal scheduling for urban parcel crowdsourced delivery with new order insertion

The rapid development of mobile information technology has introduced numerous new solutions for delivery companies to enhance profits. One such solution employed by some companies is crowdsourced delivery. In this paper, we focus on rolling optimal scheduling for urban parcel crowdsourced delivery by utilizing private cars that will be in passing with the incorporation of new order insertion. The bonus incentive strategy is introduced to enhance the delivery probability of private car drivers. A static model and a rolling optimization model to maximize profits and the number of parcels delivered by private cars are established. To address the NP-hard problem, a hybrid genetic algorithm and insertion algorithm are designed. Numerical experiments are carried out to verify the proposed method in different scenarios, including the scattered network, clustered network, Dalian network, and Foursquare network. The computational results demonstrate that the method enhances the matching ratio and increases profits. Utilizing private cars that will be in passing for urban parcel delivery reduces the need for dedicated vehicles, mitigating traffic growth and alleviating traffic congestion. Increasing the private car-parcel ratio improves profits and the matching ratio while reducing traffic growth. Raising the incentive coefficient for bonuses increases the matching ratio and detour distance, but profits first increase and then decrease, and delivery distance by dedicated vehicles decreases. Our research findings offer a more rational basis for green urban parcel delivery decision-making by companies.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Computers & Operations Research
Computers & Operations Research 工程技术-工程:工业
CiteScore
8.60
自引率
8.70%
发文量
292
审稿时长
8.5 months
期刊介绍: Operations research and computers meet in a large number of scientific fields, many of which are of vital current concern to our troubled society. These include, among others, ecology, transportation, safety, reliability, urban planning, economics, inventory control, investment strategy and logistics (including reverse logistics). Computers & Operations Research provides an international forum for the application of computers and operations research techniques to problems in these and related fields.
×
引用
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学术官方微信