IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0308951.html
   My bibliography  Save this article

Logistics–client stable matching under 4PL to reduce the empty-loaded rate

Author

Listed:
  • Jian Jiang
  • Jie Li
  • Boyuan Xia

Abstract

Logistics, as a tertiary industry, has developed rapidly and become an important part of the national economy. However, owing to the behindhand logistics pattern, the logistics vehicles drive empty-loaded on their return trip, resulting in wastage of half of the delivery resources. This paper proposes a logistics–client matching model under fourth-party logistics (4PL) to reduce the empty-loaded rate. First, a preference calculation model between logistics providers and clients was constructed. Next, for clients with small quantities of goods, a linear logistics−client one-to-one stable matching model was constructed based on the stable marriage matching model. Then, for clients with large quantities of goods, a linear logistics−client many-to-one stable matching model was constructed with a novel linear many-to-one stable matching constraint. Finally, the case study indicated that the linear model supports large-scale and global optimization. The real case study verified that the proposed stable matching model is effective in reducing the empty-loaded rate compared to the ordinary matching model, and the matching solution was fairer.

Suggested Citation

  • Jian Jiang & Jie Li & Boyuan Xia, 2025. "Logistics–client stable matching under 4PL to reduce the empty-loaded rate," PLOS ONE, Public Library of Science, vol. 20(3), pages 1-26, March.
    • Handle: RePEc:plo:pone00:0308951
    DOI: 10.1371/journal.pone.0308951
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0308951
    Download Restriction: no
    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0308951&type=printable
    Download Restriction: no
    File URL: https://libkey.io/10.1371/journal.pone.0308951?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
    ---><---

    References listed on IDEAS

    as
    1. Bettina Klaus & Flip Klijn, 2006. "Procedurally fair and stable matching," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 27(2), pages 431-447, January.
    2. Pablo Revilla, 2004. "Many-to-one Matching When Colleagues Matter," Economic Working Papers at Centro de Estudios Andaluces E2004/85, Centro de Estudios Andaluces.
    3. Revilla, Pablo, 2007. "Many-to-One Matching when Colleagues Matter," Coalition Theory Network Working Papers 7443, Fondazione Eni Enrico Mattei (FEEM).
    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. Emiliya Lazarova & Dinko Dimitrov, 2013. "Status-seeking in hedonic games with heterogeneous players," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 40(4), pages 1205-1229, April.
    2. Dur, Umut Mert & Wiseman, Thomas, 2019. "School choice with neighbors," Journal of Mathematical Economics, Elsevier, vol. 83(C), pages 101-109.
    3. Kucuksenel Serkan, 2011. "Implementation of the Core in College Admissions Problems When Colleagues Matter," The B.E. Journal of Theoretical Economics, De Gruyter, vol. 11(1), pages 1-14, September.
    4. Dimitrov, Dinko & Lazarova, Emiliya A., 2008. "Coalitional Matchings," Coalition Theory Network Working Papers 37523, Fondazione Eni Enrico Mattei (FEEM).
    5. Emiliya Lazarova & Dinko Dimitrov, 2010. "Status-Seeking In Coalitional Matching Problems," Economics Working Papers 10-02, Queen's Management School, Queen's University Belfast.
    6. Kominers, Scott Duke, 2010. "Matching with preferences over colleagues solves classical matching," Games and Economic Behavior, Elsevier, vol. 68(2), pages 773-780, March.
    7. Bettina Klaus & Flip Klijn, 2007. "Corrigendum to “On randomized matching mechanisms” [Economic Theory 8(1996)377–381]," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 32(2), pages 411-416, August.
    8. Federico Echenique & SangMok Lee & Matthew Shum & M. Bumin Yenmez, 2021. "Stability and Median Rationalizability for Aggregate Matchings," Games, MDPI, vol. 12(2), pages 1-15, April.
    9. Karla Atkins & Achla Marathe & Chris Barrett, 2007. "A computational approach to modeling commodity markets," Computational Economics, Springer;Society for Computational Economics, vol. 30(2), pages 125-142, September.
    10. Bettina Klaus & Flip Klijn, 2006. "Median Stable Matching for College Admissions," International Journal of Game Theory, Springer;Game Theory Society, vol. 34(1), pages 1-11, April.
    11. Elette Boyle & Federico Echenique, 2009. "Sequential entry in many-to-one matching markets," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 33(1), pages 87-99, June.
    12. Zhan Wang & Jinpeng Ma & Hongwei Zhang, 2023. "Object-based unawareness: Theory and applications," The Journal of Mechanism and Institution Design, Society for the Promotion of Mechanism and Institution Design, University of York, vol. 8(1), pages 1-55, December.
    13. Echenique, Federico & Yenmez, M. Bumin, 2007. "A solution to matching with preferences over colleagues," Games and Economic Behavior, Elsevier, vol. 59(1), pages 46-71, April.
    14. Thayer Morrill, 2015. "Two simple variations of top trading cycles," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 60(1), pages 123-140, September.
    15. Li Xiong & Chengwen Wang & Zhaoran Xu, 2022. "Supply and demand matching model of P2P sharing accommodation platforms considering fairness," Electronic Commerce Research, Springer, vol. 22(3), pages 951-978, September.
    16. Dimitrov, Dinko & Lazarova, Emiliya, 2011. "Two-sided coalitional matchings," Mathematical Social Sciences, Elsevier, vol. 62(1), pages 46-54, July.
    17. Jay Sethuraman & Chung-Piaw Teo & Liwen Qian, 2006. "Many-to-One Stable Matching: Geometry and Fairness," Mathematics of Operations Research, INFORMS, vol. 31(3), pages 581-596, August.
    18. Sebastian Montano Correa, 2015. "Compulsory Social Service Matching Market for Physicians in Colombia," Documentos CEDE 12856, Universidad de los Andes, Facultad de Economía, CEDE.
    19. Rong Wang & Li Xu & Hashim Zameer & Yasir Ahmed Solangi, 2020. "Modeling Two-Sided Matching Considering Agents’ Psychological Behavior Based on Regret Theory," SAGE Open, , vol. 10(2), pages 21582440209, June.
    20. Aditya Kuvalekar & Antonio Romero-Medina, 2024. "A fair procedure in a marriage market," Review of Economic Design, Springer;Society for Economic Design, vol. 28(3), pages 533-550, September.

    More about this item

    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:plo:pone00:0308951. 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: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    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.