Abstract
In modern transportation systems, the potential for further reducing costs is severely limited. Increased competitiveness through cost reduction can be achieved if there is a collaboration among transportation companies. Participation in such collaboration can benefit all participating companies as a whole, as well as each company individually, by increasing the participants’ competitiveness. In this study, we propose a game-theoretical approach for collaboration among transportation companies in a transportation system consisting of several independent transportation companies. We introduce a new transportation game called the cost transportation game (CTG) and prove that the CTG is a transferable utility game with a super additive characteristic function and a non-empty core. To obtain the core allocations, we introduce the restriction of a feasible solution and theoretically demonstrate that points in the core cannot be expressed only by dual optimal solutions but also by the optimal restrictive transportation scheme (ORTS), which implies that the points in the core can be obtained by solving ORTS and the core allocations can be realized by implementing ORTS. Finally, we present computational results for real-life and artificial instances.
Similar content being viewed by others
References
Agarwal, R., & Ergun, Ö. (2010). Network design and allocation mechanisms for carrier alliances in liner shipping. Operations Research, 58(6), 1726–1742.
Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1993). Network Flows. Prentice Hall.
Audy, J.-F., Lehoux, N., D’Amours, S., & Rönnqvist, M. (2012). A framework for an efficient implementation of logistics collaborations. International Transactions in Operational Research, 19(5), 633–657.
Basso, F., D’Amours, S., Rönnqvist, M., & Weintraub, A. (2019). A survey on obstacles and difficulties of practical implementation of horizontal collaboration in logistics. International Transactions in Operational Research, 26, 775–793.
Borm, P., Hamers, H., & Hendrickx, R. (2001). Operations Research Games: A Survey. Top, 9(2), 139–216.
Chen, J., Ye, J., Liu, A., Fei, Y., Wan, Z., & Huang, X. (2022). Robust optimization of liner shipping alliance fleet scheduling with consideration of sulfur emission restrictions and slot exchange. Annals of Operations Research. https://doi.org/10.1007/s10479-022-04590-x
Cruijssen, F., & Salomon, M. (2004). Empirical study: Order sharing between transportation companies may result in cost reductions between 5 and 15 percent. CentER Discussion Paper 2004–80. Faculty of Economics and Business Administration, Tilburg University, The Netherlands.
Cruijssen, F., Dullaert, W., & Fleuren, H. (2007). Horizontal cooperation in transport and logistics: A literature review. Transportation Journal, 46(3), 22–39.
Ergun, Ö., Gui, L., Heier Stamm, J. L., Keskinocak, P., & Swann, J. (2014). Improving humanitarian operations through technology-enabled collaboration. Production and Operations Management, 23(6), 1002–1014.
Fiestras-Janeiro, M. G., García-Jurado, I., & Mosquera, M. A. (2011). Cooperative games and cost allocation problems. TOP, 19(1), 1–22.
Frisk, M., Göthe-Lundgren, M., Jörnsten, K., & Rönnqvist, M. (2010). Cost allocation in collaborative forest transportation. European Journal of Operational Research, 205(2), 448–458.
Gansterer, M., & Hartl, R. F. (2018). Collaborative vehicle routing: A survey. European Journal of Operational Research, 268, 1–12.
Gansterer, M., Hartl, R. F., & Wieser, S. (2021). Assignment constraints in shared transportation services. Annals of Operations Research, 305(1), 513–539.
Garrido, R. A., Lamas, P., & Pino, F. J. (2015). A stochastic programming approach for floods emergency logistics. Transportation Research Part E: Logistics and Transportation Review, 75, 18–31.
Graham, L. (2011). Transport collaboration in Europe. ProLogis Research Insights, Winter.
Guajardo, M., & Rönnqvist, M. (2016). A review on cost allocation method in collaborative transportation. International Transactions in Operational Research, 23(3), 371–392.
Gul, F. (1989). Bargaining foundations of the Shapley value. Econometrica, 75(1), 81–95.
Hitchcock, F. L. (1941). The distribution of a product from several sources to numerous localities. Journal of Mathematical Physics, 20, 224–230.
Houghtalen, L., Ergun, Ö., & Sokol, J. (2011). Designing mechanisms for the management of carrier alliances. Transportation Science, 45(4), 465–482.
Koopmans, T. C. (1949). Optimum utilization of the transportation system. Econometrica, 17, 136–146.
Krajewska, M., Kopfer, H., Laporte, G., Ropke, S., & Zaccour, G. (2008). Horizontal cooperation of freight carriers: Request allocation and profit sharing. The Journal of the Operational Research Society, 59, 1483–1491.
Li, H., & Lim, A. (2003). A metaheuristic for the pickup and delivery problem with time windows. International Journal on Artificial Intelligence Tools, 12(2), 173–186.
Los, J., Schulte, F., Gansterer, M., Hartl, R. F., Spaan, M. T. J., & Negenborn, R. R. (2022). Large-scale collaborative vehicle routing. Annals of Operations Research. https://doi.org/10.1007/s10479-021-04504-3
Luenberger, D. G., & Ye, Y. (2008). Linear and Nonlinear Programming (3rd ed.). Springer.
Maschler, M., Peleg, B., & Shapley, L. S. (1979). Geometric properties of the kernel, nucleolus, and related solution concepts. Mathematics of Operations Research, 4, 303–338.
Murty, K. G. (1983). Linear programming. Wiley.
Nagarajan, M., & Sošić, G. (2008). Game-theoretic analysis of cooperation among supply chain agents: Review and extensions. European Journal of Operational Research, 187(3), 719–745.
Owen, G. (1982). Game Theory (2nd ed.). Academic Press.
Özener, O. Ö., & Ergun, Ö. (2008). Allocating costs in a collaborative transportation procurement network. Transportation Science, 42(2), 146–165.
Pan, S., Trentesaux, D., Ballot, E., & Huang, G. Q. (2019). Horizontal collaborative transport: Survey of solutions and practical implementation issues. International Journal of Production Research, 57, 5340–5361.
Park, S. H., & Ungson, G. R. (2003). Inter-firm rivalry and managerial complexity: A conceptual framework of alliance failure. Organization Science, 12(1), 37–53.
Pérez-Castrillo, D., & Wettstein, D. (2001). Bidding for the surplus: A non-cooperative approach to the Shapley value. Journal of Economic Theory, 100(2), 274–294.
Samet, D., Tauman, Y., & Zang, I. (1984). An application of the Aumann-Shapley prices for cost allocation in transportation problems. Mathematics of Operations Research, 9, 25–42.
Sánchez-Soriano, J. (2006). Pairwise solutions and the core of transportation situations. European Journal of Operational Research, 175, 101–110.
Sánchez-Soriano, J., Llorca, N., Tijs, S., & Timmer, J. (2002). On the core of semi-infinite transportation games with divisible goods. European Journal of Operational Research, 142(3), 463–475.
Sánchez-Soriano, J., Lopez, M. A., & Garcı́a-Jurado, I. (2001). On the core of transportation games. Mathematical Social Sciences, 41, 215–225.
Schulz, S. F., & Blecken, A. (2010). Horizontal cooperation in disaster relief logistics: Benefits and implements. International Journal of Physical Distribution & Logistics Management, 40, 636–656.
Shapley, L. S. (1953). A value for n-person games. Contributions to the Theory of Games, 2(28), 307–317.
Shapley, L. S., & Shubik, M. (1972). The assignment game I: The core. International Journal of Game Theory, 1, 111–130.
Sprenger, R., & Mönch, L. (2009). An ant colony optimization approach to solve cooperative transportation planning problems. In Proceedings of the 2009 winter simulation conference, pp. 2488–2495.
Tijs, S. H., & Driessen, T. S. H. (1986). Game theory and cost allocation problems. Management Science, 32(8), 1015–1028.
Ypsilantis, P., & Zuidwijk, R. (2019). Collaborative fleet deployment and routing for sustainable transport. Sustainability, 11(20), 5666.
Zheng, J., Gao, Z., Yang, D., & Sun, Z. (2015). Network design and capacity exchange for liner alliances with fixed and variable container demands. Transportation Science, 49(4), 886–899.
Zhou, S., Zhang, H., Shi, N., Xu, Z., & Wang, F. (2020). A new convergent hybrid learning algorithm for two-stage stochastic programs. European Journal of Operational Research, 283(1), 33–46.
Acknowledgements
This work was funded by the National Natural Science Foundation of China (Grant No. 71701221, 72271251), the MOE (Ministry of Education in China) Project of Humanities and Social Sciences (Grant No. 17YJC630235), and the Natural Science Foundation of Guangdong Province, China (Grant No. 2023A1515010683).
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Yang, S., Zhang, J. & Zhou, S. The cost transportation game for collaboration among transportation companies. Ann Oper Res (2023). https://doi.org/10.1007/s10479-023-05466-4
Accepted:
Published:
DOI: https://doi.org/10.1007/s10479-023-05466-4