{"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}
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.