LPPCM:合作快递服务的低成本包裹取件覆盖机制

IF 3 3区 计算机科学 Q2 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE
Pengfei Sun;Leixiao Li;Jianxiong Wan
{"title":"LPPCM:合作快递服务的低成本包裹取件覆盖机制","authors":"Pengfei Sun;Leixiao Li;Jianxiong Wan","doi":"10.1109/TSUSC.2023.3276206","DOIUrl":null,"url":null,"abstract":"With the swift development of express delivery industry, the increasingly attention has been shifted to express delivery mechanism design. Generally, the revenue of the courier is the difference between the users’ express fee and the courier's pickup cost. In order to improve the revenue of courier without increasing the user's express fee, this paper presents a low-cost package pickup covering system to find an optimal Hamiltonian pickup tour for the courier over a subset of packages, where packages who are not on the tour should be covered exactly by one package on the tour. A billing rule discounting the express fee to incentivize users to deliver their packages is also proposed. We formulate \n<italic>Low-cost Package Pickup Covering (LPPC)</i>\n problem to maximize the revenue of the courier. Considering the complexity of \n<italic>LPPC</i>\n, we propose a \n<italic>Low-cost Package Pickup Covering Mechanism (LPPCM)</i>\n to solve the \n<italic>LPPC</i>\n problem including problem transformation, hardness analyzing, \n<italic>Attention Model based on Encoder-Decoder Architecture (AMEDA)</i>\n model design and model training. \n<italic>AMEDA</i>\n is trained by a deep reinforcement learning algorithm in an unsupervised manner and it can directly output the solution based on the given instances. Through extensive simulations, we demonstrate that the average revenue of courier for \n<italic>AMEDA</i>\n is at least 10.1% higher than the traditional heuristic local search and is 18.5% lower than the optimal solution on average. \n<italic>AMEDA</i>\n provides a desired trade-off between the execution time and solution quality, which is well suited for the large-scale tasks which require quick decisions.","PeriodicalId":13268,"journal":{"name":"IEEE Transactions on Sustainable Computing","volume":"9 3","pages":"386-395"},"PeriodicalIF":3.0000,"publicationDate":"2023-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"LPPCM: A Low-Cost Package Pickup Covering Mechanism for Cooperative Express Services\",\"authors\":\"Pengfei Sun;Leixiao Li;Jianxiong Wan\",\"doi\":\"10.1109/TSUSC.2023.3276206\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"With the swift development of express delivery industry, the increasingly attention has been shifted to express delivery mechanism design. Generally, the revenue of the courier is the difference between the users’ express fee and the courier's pickup cost. In order to improve the revenue of courier without increasing the user's express fee, this paper presents a low-cost package pickup covering system to find an optimal Hamiltonian pickup tour for the courier over a subset of packages, where packages who are not on the tour should be covered exactly by one package on the tour. A billing rule discounting the express fee to incentivize users to deliver their packages is also proposed. We formulate \\n<italic>Low-cost Package Pickup Covering (LPPC)</i>\\n problem to maximize the revenue of the courier. Considering the complexity of \\n<italic>LPPC</i>\\n, we propose a \\n<italic>Low-cost Package Pickup Covering Mechanism (LPPCM)</i>\\n to solve the \\n<italic>LPPC</i>\\n problem including problem transformation, hardness analyzing, \\n<italic>Attention Model based on Encoder-Decoder Architecture (AMEDA)</i>\\n model design and model training. \\n<italic>AMEDA</i>\\n is trained by a deep reinforcement learning algorithm in an unsupervised manner and it can directly output the solution based on the given instances. Through extensive simulations, we demonstrate that the average revenue of courier for \\n<italic>AMEDA</i>\\n is at least 10.1% higher than the traditional heuristic local search and is 18.5% lower than the optimal solution on average. \\n<italic>AMEDA</i>\\n provides a desired trade-off between the execution time and solution quality, which is well suited for the large-scale tasks which require quick decisions.\",\"PeriodicalId\":13268,\"journal\":{\"name\":\"IEEE Transactions on Sustainable Computing\",\"volume\":\"9 3\",\"pages\":\"386-395\"},\"PeriodicalIF\":3.0000,\"publicationDate\":\"2023-03-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Transactions on Sustainable Computing\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10124369/\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Sustainable Computing","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10124369/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0

摘要

随着快递业的迅速发展,人们越来越关注快递机制的设计。一般来说,快递员的收入是用户快递费与快递员取件成本之间的差额。为了在不增加用户快递费的情况下提高快递员的收入,本文提出了一种低成本包裹取件覆盖系统,为快递员在包裹子集上寻找一个最优哈密顿取件游程,其中不在游程上的包裹应正好被游程上的一个包裹覆盖。此外,我们还提出了快递费打折的计费规则,以激励用户投递包裹。我们提出了低成本包裹取件覆盖(LPPC)问题,以实现快递员收入的最大化。考虑到低成本包裹取件覆盖问题的复杂性,我们提出了一种低成本包裹取件覆盖机制(LPPCM)来解决低成本包裹取件覆盖问题,包括问题转换、硬度分析、基于编码器-解码器架构的注意力模型(AMEDA)模型设计和模型训练。AMEDA 采用深度强化学习算法进行无监督训练,可根据给定实例直接输出解。通过大量仿真,我们证明 AMEDA 的快递平均收入比传统启发式局部搜索至少高 10.1%,比最优解平均低 18.5%。AMEDA 在执行时间和解决方案质量之间实现了理想的权衡,非常适合需要快速决策的大规模任务。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
LPPCM: A Low-Cost Package Pickup Covering Mechanism for Cooperative Express Services
With the swift development of express delivery industry, the increasingly attention has been shifted to express delivery mechanism design. Generally, the revenue of the courier is the difference between the users’ express fee and the courier's pickup cost. In order to improve the revenue of courier without increasing the user's express fee, this paper presents a low-cost package pickup covering system to find an optimal Hamiltonian pickup tour for the courier over a subset of packages, where packages who are not on the tour should be covered exactly by one package on the tour. A billing rule discounting the express fee to incentivize users to deliver their packages is also proposed. We formulate Low-cost Package Pickup Covering (LPPC) problem to maximize the revenue of the courier. Considering the complexity of LPPC , we propose a Low-cost Package Pickup Covering Mechanism (LPPCM) to solve the LPPC problem including problem transformation, hardness analyzing, Attention Model based on Encoder-Decoder Architecture (AMEDA) model design and model training. AMEDA is trained by a deep reinforcement learning algorithm in an unsupervised manner and it can directly output the solution based on the given instances. Through extensive simulations, we demonstrate that the average revenue of courier for AMEDA is at least 10.1% higher than the traditional heuristic local search and is 18.5% lower than the optimal solution on average. AMEDA provides a desired trade-off between the execution time and solution quality, which is well suited for the large-scale tasks which require quick decisions.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IEEE Transactions on Sustainable Computing
IEEE Transactions on Sustainable Computing Mathematics-Control and Optimization
CiteScore
7.70
自引率
2.60%
发文量
54
×
引用
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学术官方微信