IDEAS home Printed from https://ideas.repec.org/a/eee/jomega/v111y2022ics030504832200069x.html
   My bibliography  Save this article

Random Serial Dictatorship for horizontal collaboration in logistics

Author

Listed:
  • Eirinakis, Pavlos
  • Mourtos, Ioannis
  • Zampou, Eleni

Abstract

In this paper, we propose the application of matching mechanisms to handle horizontal collaboration in logistics. Based on the requirements of a real-life setting, we introduce a new variation of matching under preferences. We provide a Random Serial Dictatorship (RSD) mechanism for finding a solution that incorporates Pareto optimality, incentive compatibility and fairness, which are desired properties for enabling collaboration between antagonistic participants. Further, we present an extensive experimental analysis that is twofold. We compare the proposed RSD mechanism to two well-known matching mechanisms, namely Maximising Cardinal Utilities (MAXCU) and Bundled Probabilistic Serial (BPS). We compare these mechanisms with respect to cardinal efficiency and envy, and highlight the complementarity between them for handling different settings. Most importantly, we show that RSD is the most appropriate choice for settings similar to the one motivating our study. Moreover, we examine the effect of randomisation of RSD to fairness. Finally, we discuss how our matching mechanism was applied in the real-life context of four 3rd Party Logistics providers. Results show that the proposed approach creates significant potential for synergies and may be used to support horizontal collaboration in logistics.

Suggested Citation

  • Eirinakis, Pavlos & Mourtos, Ioannis & Zampou, Eleni, 2022. "Random Serial Dictatorship for horizontal collaboration in logistics," Omega, Elsevier, vol. 111(C).
    • Handle: RePEc:eee:jomega:v:111:y:2022:i:c:s030504832200069x
    DOI: 10.1016/j.omega.2022.102662
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S030504832200069X
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.omega.2022.102662?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 search for a different version of it.

    References listed on IDEAS

    as
    1. Lars Ehlers & Bettina Klaus, 2003. "Coalitional strategy-proof and resource-monotonic solutions for multiple assignment problems," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 21(2), pages 265-280, October.
    2. Atila Abdulkadiroğlu & Parag A. Pathak & Alvin E. Roth, 2005. "The New York City High School Match," American Economic Review, American Economic Association, vol. 95(2), pages 364-367, May.
    3. Lafkihi, Mariam & Pan, Shenle & Ballot, Eric, 2019. "Freight transportation service procurement: A literature review and future research opportunities in omnichannel E-commerce," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 125(C), pages 348-365.
    4. Xing Wang & Niels Agatz & Alan Erera, 2018. "Stable Matching for Dynamic Ride-Sharing Systems," Transportation Science, INFORMS, vol. 52(4), pages 850-867, August.
    5. Yang, Kaidi & Roca-Riu, Mireia & Menéndez, Mónica, 2019. "An auction-based approach for prebooked urban logistics facilities," Omega, Elsevier, vol. 89(C), pages 193-211.
    6. Xu, Su Xiu & Huang, George Q., 2014. "Efficient auctions for distributed transportation procurement," Transportation Research Part B: Methodological, Elsevier, vol. 65(C), pages 47-64.
    7. Shenle Pan & Damien Trentesaux & Eric Ballot & George Q. Huang, 2019. "Horizontal collaborative transport: survey of solutions and practical implementation issues," Post-Print hal-02008934, HAL.
    8. John Hatfield, 2009. "Strategy-proof, efficient, and nonbossy quota allocations," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 33(3), pages 505-515, September.
    9. Atila Abdulkadiroğlu & Parag A. Pathak & Alvin E. Roth & Tayfun Sönmez, 2005. "The Boston Public School Match," American Economic Review, American Economic Association, vol. 95(2), pages 368-371, May.
    10. Theodoros P. Pantelidis & Joseph Y. J. Chow & Saeid Rasulkhani, 2019. "A many-to-many assignment game and stable outcome algorithm to evaluate collaborative Mobility-as-a-Service platforms," Papers 1911.04435, arXiv.org, revised Jun 2020.
    11. Zhang, Juliang & Xiang, Jie & Cheng, T.C. Edwin & Hua, Guowei & Chen, Cheng, 2019. "An optimal efficient multi-attribute auction for transportation procurement with carriers having multi-unit supplies," Omega, Elsevier, vol. 83(C), pages 249-260.
    12. Gansterer, Margaretha & Hartl, Richard F., 2018. "Collaborative vehicle routing: A survey," European Journal of Operational Research, Elsevier, vol. 268(1), pages 1-12.
    13. Delorme, Maxence & García, Sergio & Gondzio, Jacek & Kalcsics, Joerg & Manlove, David & Pettersson, William, 2021. "Stability in the hospitals/residents problem with couples and ties: Mathematical models and computational studies," Omega, Elsevier, vol. 103(C).
    14. Gansterer, Margaretha & Hartl, Richard F. & Sörensen, Kenneth, 2020. "Pushing frontiers in auction-based transport collaborations," Omega, Elsevier, vol. 94(C).
    15. Wu, Qingyun & Roth, Alvin E., 2018. "The lattice of envy-free matchings," Games and Economic Behavior, Elsevier, vol. 109(C), pages 201-211.
    16. Li, Yuanyuan & Liu, Yang, 2021. "Optimizing flexible one-to-two matching in ride-hailing systems with boundedly rational users," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 150(C).
    17. Bogomolnaia, Anna & Moulin, Herve, 2001. "A New Solution to the Random Assignment Problem," Journal of Economic Theory, Elsevier, vol. 100(2), pages 295-328, October.
    18. Perach, Nitsan & Anily, Shoshana, 2022. "Stable matching of student-groups to dormitories," European Journal of Operational Research, Elsevier, vol. 302(1), pages 50-61.
    19. Yan, Pengyu & Lee, Chung-Yee & Chu, Chengbin & Chen, Cynthia & Luo, Zhiqin, 2021. "Matching and pricing in ride-sharing: Optimality, stability, and financial sustainability," Omega, Elsevier, vol. 102(C).
    20. Nguyen, Thành & Peivandi, Ahmad & Vohra, Rakesh, 2016. "Assignment problems with complementarities," Journal of Economic Theory, Elsevier, vol. 165(C), pages 209-241.
    21. Anna Bogomolnaia & Herve Moulin, 2004. "Random Matching Under Dichotomous Preferences," Econometrica, Econometric Society, vol. 72(1), pages 257-279, January.
    22. Shenle Pan & Damien Trentesaux & Eric Ballot & George Q. Huang, 2019. "Horizontal collaborative transport: survey of solutions and practical implementation issues," International Journal of Production Research, Taylor & Francis Journals, vol. 57(15-16), pages 5340-5361, August.
    23. Mariam Lafkihi & Shenle Pan & Eric Ballot, 2019. "Freight transportation service procurement: A literature review and future research opportunities in omnichannel E-commerce," Post-Print hal-02086154, HAL.
    24. Su Xiu Xu & George Q. Huang, 2017. "Efficient Multi‐Attribute Multi‐Unit Auctions for B2B E‐Commerce Logistics," Production and Operations Management, Production and Operations Management Society, vol. 26(2), pages 292-304, February.
    25. Roth, Alvin E., 1982. "Incentive compatibility in a market with indivisible goods," Economics Letters, Elsevier, vol. 9(2), pages 127-132.
    26. Sophie Bade, 2020. "Random Serial Dictatorship: The One and Only," Mathematics of Operations Research, INFORMS, vol. 45(1), pages 353-368, February.
    27. Pantelidis, Theodoros P. & Chow, Joseph Y.J. & Rasulkhani, Saeid, 2020. "A many-to-many assignment game and stable outcome algorithm to evaluate collaborative mobility-as-a-service platforms," Transportation Research Part B: Methodological, Elsevier, vol. 140(C), pages 79-100.
    28. Biró, Péter & Gudmundsson, Jens, 2021. "Complexity of finding Pareto-efficient allocations of highest welfare," European Journal of Operational Research, Elsevier, vol. 291(2), pages 614-628.
    29. de Palma, André & Stokkink, Patrick & Geroliminis, Nikolas, 2022. "Influence of dynamic congestion with scheduling preferences on carpooling matching with heterogeneous users," Transportation Research Part B: Methodological, Elsevier, vol. 155(C), pages 479-498.
    30. Defryn, Christof & Sörensen, Kenneth & Dullaert, Wout, 2019. "Integrating partner objectives in horizontal logistics optimisation models," Omega, Elsevier, vol. 82(C), pages 1-12.
    31. Saban, Daniela & Sethuraman, Jay, 2014. "A note on object allocation under lexicographic preferences," Journal of Mathematical Economics, Elsevier, vol. 50(C), pages 283-289.
    32. Balinski, Michel & Sonmez, Tayfun, 1999. "A Tale of Two Mechanisms: Student Placement," Journal of Economic Theory, Elsevier, vol. 84(1), pages 73-94, January.
    33. Huang, George Q. & Xu, Su Xiu, 2013. "Truthful multi-unit transportation procurement auctions for logistics e-marketplaces," Transportation Research Part B: Methodological, Elsevier, vol. 47(C), pages 127-148.
    34. 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.
    35. Karaenke, Paul & Bichler, Martin & Merting, Soeren & Minner, Stefan, 2020. "Non-monetary coordination mechanisms for time slot allocation in warehouse delivery," European Journal of Operational Research, Elsevier, vol. 286(3), pages 897-907.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Xu, Xiaoyan & Choi, Tsan-Ming & Chung, Sai-Ho & Guo, Shu, 2023. "Collaborative-commerce in supply chains: A review and classification of analytical models," International Journal of Production Economics, Elsevier, vol. 263(C).

    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. Nassim Mrabti & Nadia Hamani & Laurent Delahoche, 2022. "A Comprehensive Literature Review on Sustainable Horizontal Collaboration," Sustainability, MDPI, vol. 14(18), pages 1-38, September.
    2. Guo, Jiantao & Zhang, Juliang & Cheng, T.C.E. & Zhao, Shouting, 2022. "Truthful double auction mechanisms for online freight platforms with transaction costs," Transportation Research Part B: Methodological, Elsevier, vol. 158(C), pages 164-186.
    3. Yu, Hao & Huang, Min & Chao, Xiuli & Yue, Xiaohang, 2022. "Truthful multi-attribute multi-unit double auctions for B2B e-commerce logistics service transactions," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 164(C).
    4. Lafkihi, Mariam & Pan, Shenle & Ballot, Eric, 2019. "Freight transportation service procurement: A literature review and future research opportunities in omnichannel E-commerce," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 125(C), pages 348-365.
    5. 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).
    6. Kojima, Fuhito, 2009. "Random assignment of multiple indivisible objects," Mathematical Social Sciences, Elsevier, vol. 57(1), pages 134-142, January.
    7. 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.
    8. 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).
    9. Hammami, Farouk & Rekik, Monia & Coelho, Leandro C., 2021. "Exact and hybrid heuristic methods to solve the combinatorial bid construction problem with stochastic prices in truckload transportation services procurement auctions," Transportation Research Part B: Methodological, Elsevier, vol. 149(C), pages 204-229.
    10. Roth, Alvin E. & Sonmez, Tayfun & Utku Unver, M., 2005. "Pairwise kidney exchange," Journal of Economic Theory, Elsevier, vol. 125(2), pages 151-188, December.
    11. Dellbrügge, Marius & Brilka, Tim & Kreuz, Felix & Clausen, Uwe, 2022. "Auction design in strategic freight procurement," Chapters from the Proceedings of the Hamburg International Conference of Logistics (HICL), in: Kersten, Wolfgang & Jahn, Carlos & Blecker, Thorsten & Ringle, Christian M. (ed.), Changing Tides: The New Role of Resilience and Sustainability in Logistics and Supply Chain Management – Innovative Approaches for the Shift to a New , volume 33, pages 295-325, Hamburg University of Technology (TUHH), Institute of Business Logistics and General Management.
    12. Kojima, Fuhito, 2013. "Efficient resource allocation under multi-unit demand," Games and Economic Behavior, Elsevier, vol. 82(C), pages 1-14.
    13. Haeringer, Guillaume & Klijn, Flip, 2009. "Constrained school choice," Journal of Economic Theory, Elsevier, vol. 144(5), pages 1921-1947, September.
    14. Kong, Xiang T.R. & Kang, Kai & Zhong, Ray Y. & Luo, Hao & Xu, Su Xiu, 2021. "Cyber physical system-enabled on-demand logistics trading," International Journal of Production Economics, Elsevier, vol. 233(C).
    15. Eric Budish & Judd B. Kessler, 2022. "Can Market Participants Report Their Preferences Accurately (Enough)?," Management Science, INFORMS, vol. 68(2), pages 1107-1130, February.
    16. Morrill, Thayer, 2015. "Making just school assignments," Games and Economic Behavior, Elsevier, vol. 92(C), pages 18-27.
    17. Kesten, Onur & Unver, Utku, 2015. "A theory of school choice lotteries," Theoretical Economics, Econometric Society, vol. 10(2), May.
    18. Alvin Roth, 2008. "Deferred acceptance algorithms: history, theory, practice, and open questions," International Journal of Game Theory, Springer;Game Theory Society, vol. 36(3), pages 537-569, March.
    19. Thomas Hacardiaux & Christof Defryn & Jean-Sébastien Tancrez & Lotte Verdonck, 2022. "Balancing partner preferences for logistics costs and carbon footprint in a horizontal cooperation," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 44(1), pages 121-153, March.
    20. Kojima, Fuhito & Manea, Mihai, 2010. "Incentives in the probabilistic serial mechanism," Journal of Economic Theory, Elsevier, vol. 145(1), pages 106-123, January.

    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:jomega:v:111:y:2022:i:c:s030504832200069x. 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/375/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.