IDEAS home Printed from https://ideas.repec.org/a/eee/transe/v202y2025ics1366554525003151.html

How shared information contributes: A novel revenue allocation method for collaborative instant delivery with unmanned vehicles

Author

Listed:
  • Liu, Meng
  • Du, Mu
  • Yu, Mengqi

Abstract

Fair revenue allocation is essential for ensuring the stability of coalitions in collaborative logistics. This study examines horizontal collaboration among enterprises that provide instant delivery services using unmanned vehicles (UVs). While data-driven decision-making enhances efficiency, many enterprises hesitate to share operational information due to concerns about competitiveness. Therefore, designing a revenue allocation mechanism that incentivizes information sharing is a key challenge in collaborative delivery. To address this issue, we propose a novel contribution-based revenue allocation method that explicitly accounts for the value of shared information in addition to contributions from providing order and UVs. Specifically, we use the Shapley value to quantify the contribution of shared information on coalition performance. Furthermore, we formulate the decision problems arising in such collaborations and develop efficient solution methods. The numerical results show that both the final coalition structure and enterprises’ profits are influenced by their information disclosure preferences. More importantly, our proposed revenue allocation method effectively incentivizes the sharing of higher-quality information, thereby strengthening collaboration and improving overall system efficiency. This study is the first to explicitly address the heterogeneity of information sharing in collaborative delivery and to quantify the contribution of shared information within a revenue allocation framework, providing valuable insights for designing sustainable and data-driven logistics collaborations.

Suggested Citation

  • Liu, Meng & Du, Mu & Yu, Mengqi, 2025. "How shared information contributes: A novel revenue allocation method for collaborative instant delivery with unmanned vehicles," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 202(C).
  • Handle: RePEc:eee:transe:v:202:y:2025:i:c:s1366554525003151
    DOI: 10.1016/j.tre.2025.104274
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S1366554525003151
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.tre.2025.104274?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    References listed on IDEAS

    as
    1. Wang, Junwei & Yu, Yang & Tang, Jiafu, 2018. "Compensation and profit distribution for cooperative green pickup and delivery problem," Transportation Research Part B: Methodological, Elsevier, vol. 113(C), pages 54-69.
    2. Stefan Ropke & David Pisinger, 2006. "An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows," Transportation Science, INFORMS, vol. 40(4), pages 455-472, November.
    3. Los, Johan & Schulte, Frederik & Spaan, Matthijs T.J. & Negenborn, Rudy R., 2020. "The value of information sharing for platform-based collaborative vehicle routing," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 141(C).
    4. Ben Jouida, Sihem & Guajardo, Mario & Klibi, Walid & Krichen, Saoussen, 2021. "Profit maximizing coalitions with shared capacities in distribution networks," European Journal of Operational Research, Elsevier, vol. 288(2), pages 480-495.
    5. Li, Yuan & Chen, Haoxun & Prins, Christian, 2016. "Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests," European Journal of Operational Research, Elsevier, vol. 252(1), pages 27-38.
    6. Liu, Jia-Cai & Sheu, Jiuh-Biing & Li, Deng-Feng & Dai, Yong-Wu, 2021. "Collaborative profit allocation schemes for logistics enterprise coalitions with incomplete information," Omega, Elsevier, vol. 101(C).
    7. Mengdi Zhang & Saurabh Pratap & George Q. Huang & Zhiheng Zhao, 2017. "Optimal collaborative transportation service trading in B2B e-commerce logistics," International Journal of Production Research, Taylor & Francis Journals, vol. 55(18), pages 5485-5501, September.
    8. Rahmani-Dabbagh, Saeed & Sheikh-El-Eslami, Mohammad Kazem, 2016. "A profit sharing scheme for distributed energy resources integrated into a virtual power plant," Applied Energy, Elsevier, vol. 184(C), pages 313-328.
    9. Gansterer, Margaretha & Hartl, Richard F. & Savelsbergh, Martin, 2020. "The value of information in auction-based carrier collaborations," International Journal of Production Economics, Elsevier, vol. 221(C).
    10. Lai, Minghui & Cai, Xiaoqiang & Hu, Qian, 2017. "An iterative auction for carrier collaboration in truckload pickup and delivery," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 107(C), pages 60-80.
    11. Lyu, Xiaohui & Chen, Haoxun & Wang, Nengmin & Yang, Zhen, 2019. "A multi-round exchange mechanism for carrier collaboration in less than truckload transportation," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 129(C), pages 38-59.
    12. Yang, Yunshen & Bi, Gongbing & Liu, Lindong, 2020. "Profit allocation in investment-based crowdfunding with investors of dynamic entry times," European Journal of Operational Research, Elsevier, vol. 280(1), pages 323-337.
    13. An, Qingxian & Wen, Yao & Ding, Tao & Li, Yongli, 2019. "Resource sharing and payoff allocation in a three-stage system: Integrating network DEA with the Shapley value method," Omega, Elsevier, vol. 85(C), pages 16-25.
    14. Gansterer, Margaretha & Hartl, Richard F., 2018. "Collaborative vehicle routing: A survey," European Journal of Operational Research, Elsevier, vol. 268(1), pages 1-12.
    15. Berger, Susanne & Bierwirth, Christian, 2010. "Solutions to the request reassignment problem in collaborative carrier networks," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 46(5), pages 627-638, September.
    16. Chen, Haoxun, 2016. "Combinatorial clock-proxy exchange for carrier collaboration in less than truck load transportation," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 91(C), pages 152-172.
    17. Gansterer, Margaretha & Hartl, Richard F. & Sörensen, Kenneth, 2020. "Pushing frontiers in auction-based transport collaborations," Omega, Elsevier, vol. 94(C).
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Johan Los & Frederik Schulte & Margaretha Gansterer & Richard F. Hartl & Matthijs T. J. Spaan & Rudy R. Negenborn, 2025. "Large-scale collaborative vehicle routing," Annals of Operations Research, Springer, vol. 350(1), pages 201-233, July.
    2. Lyu, Xiaohui & Chen, Haoxun & Wang, Nengmin & Zhang, Xiaohong, 2025. "A multi-round combinatorial double auction for carrier collaboration with carbon emission permits trading in less than truckload transportation," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 200(C).
    3. Scherr, Yannick Oskar & Gansterer, Margaretha & Hartl, Richard F., 2024. "Request acceptance with overbooking in dynamic and collaborative vehicle routing," European Journal of Operational Research, Elsevier, vol. 314(2), pages 612-629.
    4. Lyu, Xiaohui & Chen, Haoxun & Wang, Nengmin & Yang, Zhen, 2019. "A multi-round exchange mechanism for carrier collaboration in less than truckload transportation," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 129(C), pages 38-59.
    5. Guo, Jiantao & Zhang, Juliang & Cheng, T.C.E., 2025. "Truthful online bundle double auction mechanisms for a transport market with dynamic demands and supplies," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 195(C).
    6. Nassim Mrabti & Nadia Hamani & Laurent Delahoche, 2022. "A Comprehensive Literature Review on Sustainable Horizontal Collaboration," Sustainability, MDPI, vol. 14(18), pages 1-38, September.
    7. Shejun Deng & Yingying Yuan & Yong Wang & Haizhong Wang & Charles Koll, 2020. "Collaborative multicenter logistics delivery network optimization with resource sharing," PLOS ONE, Public Library of Science, vol. 15(11), pages 1-31, November.
    8. Lai, Minghui & Cai, Xiaoqiang & Hu, Qian, 2017. "An iterative auction for carrier collaboration in truckload pickup and delivery," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 107(C), pages 60-80.
    9. Soriano, Adria & Gansterer, Margaretha & Hartl, Richard F., 2023. "The multi-depot vehicle routing problem with profit fairness," International Journal of Production Economics, Elsevier, vol. 255(C).
    10. Margaretha Gansterer & Richard F. Hartl, 2020. "Shared resources in collaborative vehicle routing," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 28(1), pages 1-20, April.
    11. Soriano, Adria & Gansterer, Margaretha & Hartl, Richard F., 2022. "Reprint of: The multi-depot vehicle routing problem with profit fairness," International Journal of Production Economics, Elsevier, vol. 250(C).
    12. Los, Johan & Schulte, Frederik & Spaan, Matthijs T.J. & Negenborn, Rudy R., 2020. "The value of information sharing for platform-based collaborative vehicle routing," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 141(C).
    13. Hatzenbühler, Jonas & Jenelius, Erik & Gidófalvi, Gyözö & Cats, Oded, 2023. "Modular vehicle routing for combined passenger and freight transport," Transportation Research Part A: Policy and Practice, Elsevier, vol. 173(C).
    14. Guo, Wenjing & Zhang, Yimeng & Li, Wenfeng & Negenborn, Rudy R. & Atasoy, Bilge, 2024. "Augmented Lagrangian relaxation-based coordinated approach for global synchromodal transport planning with multiple operators," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 185(C).
    15. Margaretha Gansterer & Richard F. Hartl & Sarah Wieser, 2021. "Assignment constraints in shared transportation services," Annals of Operations Research, Springer, vol. 305(1), pages 513-539, October.
    16. Liu, Jia-Cai & Sheu, Jiuh-Biing & Li, Deng-Feng & Dai, Yong-Wu, 2021. "Collaborative profit allocation schemes for logistics enterprise coalitions with incomplete information," Omega, Elsevier, vol. 101(C).
    17. Vetschera, Rudolf & Knyazev, Dmitriy, 2025. "Does carrier collaboration require combinatorial auctions?," European Journal of Operational Research, Elsevier, vol. 326(3), pages 481-497.
    18. Gansterer, Margaretha & Hartl, Richard F. & Sörensen, Kenneth, 2020. "Pushing frontiers in auction-based transport collaborations," Omega, Elsevier, vol. 94(C).
    19. Hammami, Farouk & Rekik, Monia & Coelho, Leandro C., 2019. "Exact and heuristic solution approaches for the bid construction problem in transportation procurement auctions with a heterogeneous fleet," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 127(C), pages 150-177.
    20. Minghui Lai & Weili Xue & Qian Hu, 2019. "An Ascending Auction for Freight Forwarder Collaboration in Capacity Sharing," Transportation Science, INFORMS, vol. 53(4), pages 1175-1195, July.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:transe:v:202:y:2025:i:c:s1366554525003151. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/description#description .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.