IDEAS home Printed from https://ideas.repec.org/a/spr/josatr/v8y2023i1d10.1186_s41072-023-00155-8.html
   My bibliography  Save this article

Contemporary challenges and AI solutions in port operations: applying Gale–Shapley algorithm to find best matches

Author

Listed:
  • Mehran Farzadmehr

    (University of Antwerp)

  • Valentin Carlan

    (University of Antwerp)

  • Thierry Vanelslander

    (University of Antwerp)

Abstract

Artificial intelligence (AI) developments enable human capability to deliver the same outcome at a lower cost. This research performs a high-level matching between AI solutions and challenges within the port area by developing a novel academic approach. This way, the matching is carried out more structured than when one (manager, developer, challenge owner, etc.) fulfils it based on their opinion without following any structured approach. Therefore, the study defines first a comprehensive typology of port stakeholders' challenges, which can be solved via AI solutions. This typology presents challenges, including their main issues, widespread impact, and potential solutions. A state-of-the-art review of AI solutions that can address these challenges is carried out in parallel. Secondly, this review clearly distinguishes between AI solutions based on their technology and functionality. Thirdly, this research selects an appropriate AI solution for addressing each identified challenge in the port operation by upgrading the Gale–Shapley algorithm. Finally, it shows that the most critical presented AI solutions in this study use various machine learning (ML) techniques. Besides, concerning the AI solution's reusability feature and the result of high-level matching, this research shows that the implementation phase effort can be drastically reduced by using the recently developed matching algorithm.

Suggested Citation

  • Mehran Farzadmehr & Valentin Carlan & Thierry Vanelslander, 2023. "Contemporary challenges and AI solutions in port operations: applying Gale–Shapley algorithm to find best matches," Journal of Shipping and Trade, Springer, vol. 8(1), pages 1-44, December.
    • Handle: RePEc:spr:josatr:v:8:y:2023:i:1:d:10.1186_s41072-023-00155-8
    DOI: 10.1186/s41072-023-00155-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1186/s41072-023-00155-8
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1186/s41072-023-00155-8?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. Cheng-Hong Yang & Po-Yin Chang, 2020. "Forecasting the Demand for Container Throughput Using a Mixed-Precision Neural Architecture Based on CNN–LSTM," Mathematics, MDPI, vol. 8(10), pages 1-17, October.
    2. Davenport, Thomas H., 2018. "The AI Advantage: How to Put the Artificial Intelligence Revolution to Work," MIT Press Books, The MIT Press, edition 1, volume 1, number 0262039176, December.
    3. Iñigo L. Ansorena & César López Ansorena, 2020. "Managing uncertainty in ferry terminals: a machine learning approach," International Journal of Business Information Systems, Inderscience Enterprises Ltd, vol. 33(2), pages 285-297.
    4. Enrico Maria Fenoaltea & Izat B. Baybusinov & Jianyang Zhao & Lei Zhou & Yi-Cheng Zhang, 2021. "The Stable Marriage Problem: an Interdisciplinary Review from the Physicist's Perspective," Papers 2103.11458, arXiv.org.
    5. H. W. Kuhn, 1956. "Variants of the hungarian method for assignment problems," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 3(4), pages 253-258, December.
    6. Rachid Oucheikh & Tuwe Löfström & Ernst Ahlberg & Lars Carlsson, 2021. "Rolling Cargo Management Using a Deep Reinforcement Learning Approach," Logistics, MDPI, vol. 5(1), pages 1-18, February.
    7. Roth, Alvin E, 1984. "The Evolution of the Labor Market for Medical Interns and Residents: A Case Study in Game Theory," Journal of Political Economy, University of Chicago Press, vol. 92(6), pages 991-1016, December.
    8. Zhang, Canrong & Guan, Hao & Yuan, Yifei & Chen, Weiwei & Wu, Tao, 2020. "Machine learning-driven algorithms for the container relocation problem," Transportation Research Part B: Methodological, Elsevier, vol. 139(C), pages 102-131.
    9. Li Wang & Xiaoning Zhu, 2019. "Container Loading Optimization in Rail–Truck Intermodal Terminals Considering Energy Consumption," Sustainability, MDPI, vol. 11(8), pages 1-15, April.
    10. Valentin Carlan & Dries Naudts & Pieter Audenaert & Bart Lannoo & Thierry Vanelslander, 2019. "Toward implementing a fully automated truck guidance system at a seaport: identifying the roles, costs and benefits of logistics stakeholders," Journal of Shipping and Trade, Springer, vol. 4(1), pages 1-24, December.
    11. Zhihong Jin & Xin Lin & Linlin Zang & Weiwei Liu & Xisheng Xiao, 2021. "Lane Allocation Optimization in Container Seaport Gate System Considering Carbon Emissions," Sustainability, MDPI, vol. 13(7), pages 1-16, March.
    12. Markus Fruth & Frank Teuteberg, 2017. "Digitization in maritime logistics—What is there and what is missing?," Cogent Business & Management, Taylor & Francis Journals, vol. 4(1), pages 1411066-141, January.
    13. Roth, Alvin E & Vande Vate, John H, 1990. "Random Paths to Stability in Two-Sided Matching," Econometrica, Econometric Society, vol. 58(6), pages 1475-1480, November.
    14. Kim, Kap Hwan & Park, Kang Tae, 2003. "A note on a dynamic space-allocation method for outbound containers," European Journal of Operational Research, Elsevier, vol. 148(1), pages 92-101, July.
    15. Minoru Kitahara & Yasunori Okumura, 2021. "Improving efficiency in school choice under partial priorities," International Journal of Game Theory, Springer;Game Theory Society, vol. 50(4), pages 971-987, December.
    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. Marco LiCalzi, 2022. "Bipartite choices," Decisions in Economics and Finance, Springer;Associazione per la Matematica, vol. 45(2), pages 551-568, December.
    2. Jiang, Zhishan & Tian, Guoqiang, 2013. "Matching with Couples: Stability and Algorithm," MPRA Paper 57936, University Library of Munich, Germany, revised Jul 2014.
    3. Roth, Alvin E & Xing, Xiaolin, 1997. "Turnaround Time and Bottlenecks in Market Clearing: Decentralized Matching in the Market for Clinical Psychologists," Journal of Political Economy, University of Chicago Press, vol. 105(2), pages 284-329, April.
    4. Roth, Alvin E. & Sonmez, Tayfun & Utku Unver, M., 2005. "Pairwise kidney exchange," Journal of Economic Theory, Elsevier, vol. 125(2), pages 151-188, December.
    5. Bettina Klaus & David F. Manlove & Francesca Rossi, 2014. "Matching under Preferences," Cahiers de Recherches Economiques du Département d'économie 14.07, Université de Lausanne, Faculté des HEC, Département d’économie.
    6. 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.
    7. Assaf Romm, 2014. "Implications of capacity reduction and entry in many-to-one stable matching," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 43(4), pages 851-875, December.
    8. 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.
    9. Konishi, Hideo & Unver, M. Utku, 2006. "Credible group stability in many-to-many matching problems," Journal of Economic Theory, Elsevier, vol. 129(1), pages 57-80, July.
    10. Alfredo Salgado-Torres, 2012. "A simple decentralized matching mechanism in markets with couples," Economics Bulletin, AccessEcon, vol. 32(3), pages 2044-2055.
    11. Elliott Peranson & Alvin E. Roth, 1999. "The Redesign of the Matching Market for American Physicians: Some Engineering Aspects of Economic Design," American Economic Review, American Economic Association, vol. 89(4), pages 748-780, September.
    12. Joana Pais, 2008. "Random matching in the college admissions problem," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 35(1), pages 99-116, April.
    13. Radoslav Raykov, 2017. "Stability and Efficiency in Decentralized Two-Sided Markets with Weak Preferences," Staff Working Papers 17-4, Bank of Canada.
    14. Azar Abizada & Siwei Chen, 2015. "Stability and strategy-proofness for college admissions with an eligibility criterion," Review of Economic Design, Springer;Society for Economic Design, vol. 19(1), pages 47-66, March.
    15. Tello, Benjamín, 2023. "Restricted complementarity and paths to stability in matching with couples," Mathematical Social Sciences, Elsevier, vol. 126(C), pages 60-67.
    16. Diamantoudi, Effrosyni & Miyagawa, Eiichi & Xue, Licun, 2015. "Decentralized matching: The role of commitment," Games and Economic Behavior, Elsevier, vol. 92(C), pages 1-17.
    17. Florian M. Biermann, 2011. "A Measure to compare Matchings in Marriage Markets," Discussion Paper Series dp575, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
    18. Alvin E. Roth, 2024. "Market Design and Maintenance," NBER Chapters, in: New Directions in Market Design, National Bureau of Economic Research, Inc.
    19. Nikhil Agarwal, 2015. "An Empirical Model of the Medical Match," American Economic Review, American Economic Association, vol. 105(7), pages 1939-1978, July.
    20. Ning Sun & Zaifu Yang, 2016. "A Theory of Marriage with Mutually Consented Divorces," Discussion Papers 16/14, Department of Economics, University of York.

    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:spr:josatr:v:8:y:2023:i:1:d:10.1186_s41072-023-00155-8. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.