179
Views
0
CrossRef citations to date
0
Altmetric
Supply Chain & Logistics

Core-based cost allocation for collaborative multi-stop truckload shipping problem

ORCID Icon, ORCID Icon &
Received 13 Jun 2022, Accepted 18 Feb 2024, Published online: 11 Apr 2024

References

  • Aloui, A., Hamani, N., Derrouiche, R. and Delahoche, L. (2021) Systematic literature review on collaborative sustainable transportation: Overview, analysis and perspectives. Transportation Research Interdisciplinary Perspectives, 9, 100291.
  • Altan, B. and Özener, O.Ö. (2019) Cost allocation mechanisms in a peer-to-peer network. Networks, 73(1), 104–118.
  • Amap (2022) Route planning API document. Version 2.0, AutoNavi, Beijing. Available at https://lbs.amap.com/api/webservice/guide/api/direction (accessed 16 August 2022).
  • Atefi, R., Salari, M., Coelho, L.C. and Renaud, J. (2018) The open vehicle routing problem with decoupling points. European Journal of Operational Research, 265(1), 316–327.
  • Basso, F., D’Amours, S., Rönnqvist, M. and Weintraub, A. (2019) A survey on obstacles and difficulties of practical implementation of horizontal collaboration in logistics. International Transactions in Operational Research, 26(3), 775–793.
  • Beliën, J., Boute, R., Creemers, S., De Bruecker, P., Gijsbrechts, J., Padilla Tinoco, S.V. and Verheyen, W. (2017) Collaborative shipping: Logistics in the sharing economy. ORMS Today, 44(2), 20–23.
  • Bergantiños, G. and Vidal-Puga, J. (2020) One-way and two-way cost allocation in hub network problems. Operations-Research-Spektrum, 42(1), 199–234.
  • Biró, P., Kern, W. and Paulusma, D. (2012) Computing solutions for matching games. International Journal of Game Theory, 41(1), 75–90.
  • Borndörfer, R., Grötschel, M. and Pfetsch, M.E. (2007) A column-generation approach to line planning in public transport. Transportation Science, 41(1), 123–132.
  • Caprara, A. and Letchford, A.N. (2010) New techniques for cost sharing in combinatorial optimization games. Mathematical Programming, 124, 93–118.
  • Chabot, T., Bouchard, F., Legault-Michaud, A., Renaud, J. and Coelho, L.C. (2018) Service level, cost and environmental optimization of collaborative transportation. Transportation Research Part E: Logistics and Transportation Review, 110, 1–14.
  • Chen, S., Wang, H. and Meng, Q. (2023) Cost allocation of cooperative autonomous truck platooning: Efficiency and stability analysis. Transportation Research Part B: Methodological, 173, 119–141.
  • Chen, X.A. and Tsai, S. (2016) Multi-stop trucking: Understanding the true impact. August 3, Supply Chain Management Review, San Francisco. Available at https://www.scmr.com/article/multi_stop_trucking_understanding_the_true_impact (accessed 3 July 2023).
  • Cherkesly, M., Desaulniers, G. and Laporte, G. (2015) Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and last-in-first-out loading. Transportation Science, 49(4), 752–766.
  • Cleophas, C., Cottrill, C., Ehmke, J.F. and Tierney, K. (2019) Collaborative urban transportation: Recent advances in theory and practice. European Journal of Operational Research, 273(3), 801–816.
  • Creemers, S., Woumans, G., Boute, R. and Beliën, J. (2017) Tri-vizor uses an efficient algorithm to identify collaborative shipping opportunities. Interfaces, 47(3), 244–259.
  • Dahlberg, J., Engevall, S. and Göthe-Lundgren, M. (2018) Consolidation in urban freight transportation–cost allocation models. Asia-Pacific Journal of Operational Research, 35(04), 1850023.
  • Deppon Express (2022) Service price quote information. Technical report, Deppon Logistics Co., LTD, Shanghai. Available at https://www.deppon.com/newwebsite/mail/price (accessed 3 July 2023).
  • Derks, J. and Kuipers, J. (1997) On the core of routing games. International Journal of Game Theory, 26, 193–205.
  • Dror, M. (1990) Cost allocation: The traveling salesman, binpacking, and the knapsack. Applied Mathematics and Computation, 35(2), 191–207.
  • Engevall, S., Göthe-Lundgren, M. and Värbrand, P. (2004) The heterogeneous vehicle-routing game. Transportation Science, 38(1), 71–85.
  • Faigle, U., Fekete, S.P., Hochstättler, W. and Kern, W. (1998) On approximately fair cost allocation in Euclidean TSP games. Operations-Research-Spektrum, 20, 29–37.
  • Faigle, U. and Kern, W. (1993) On some approximately balanced combinatorial cooperative games. ZOR – Methods and Models of Operations Research, 38, 141–152.
  • Faigle, U. and Kern, W. (1998) Approximate core allocation for binpacking games. SIAM Journal on Discrete Mathematics, 11(3), 387–399.
  • Faigle, U., Kern, W., Fekete, S.P. and Hochstättler, W. (1998) The nucleon of cooperative games and an algorithm for matching games. Mathematical Programming, 83, 195–211.
  • Ferrell, W., Ellis, K., Kaminsky, P. and Rainwater, C. (2019) Horizontal collaboration: Opportunities for improved logistics planning. International Journal of Production Research, 58(14), 4267–4284.
  • Fishburn, P. and Pollak, H. (1983) Fixed-route cost allocation. The American Mathematical Monthly, 90(6), 366–378.
  • Gansterer, M. and Hartl, R.F. (2020) Shared resources in collaborative vehicle routing. TOP, 28, 1–20.
  • Gillies, D. (1959) Solutions to general non-zero sum games, in Contributions to the Theory of Games IV, Princeton University Press, Princeton, NJ, pp. 47–83.
  • Göthe-Lundgren, M., Jörnsten, K. and Värbrand, P. (1996) On the nucleolus of the basic vehicle routing game. Mathematical Programming, 72, 83–100.
  • Granot, D. (1987) The role of cost allocation in locational models. Operations Research, 35(2), 234–248.
  • Guajardo, M. and Rönnqvist, M. (2016) A review on cost allocation methods in collaborative transportation. International Transactions in Operational Research, 23(3), 371–392.
  • Hezarkhani, B., Slikker, M. and Van Woensel, T. (2016) A competitive solution for cooperative truckload delivery. Operations-Research-Spektrum, 38, 51–80.
  • Hezarkhani, B., Slikker, M. and Van Woensel, T. (2019) Gain-sharing in urban consolidation centers. European Journal of Operational Research, 279(2), 380–392.
  • Hezarkhani, B., Slikker, M. and Woensel, T.V. (2021) Collaboration in transport and logistics networks, in Network Design with Applications to Transportation and Logistics, Springer International Publishing, Cham, pp. 627–662.
  • Jain, K. and Vazirani, V. (2001) Applications of approximation algorithms to cooperative games, in Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, New York, NY, pp. 364–372.
  • Karsten, F., Slikker, M. and Van Houtum, G.-J. (2015) Resource pooling and cost allocation among independent service providers. Operations Research, 63(2), 476–488.
  • Kellner, F. and Schneiderbauer, M. (2019) Further insights into the allocation of greenhouse gas emissions to shipments in road freight transportation: The pollution routing game. European Journal of Operational Research, 278(1), 296–313.
  • Kern, W. and Paulusma, D. (2003) Matching games: The least core and the nucleolus. Mathematics of Operations Research, 28(2), 294–308.
  • Kimms, A. and Kozeletskyi, I. (2016) Core-based cost allocation in the cooperative traveling salesman problem. European Journal of Operational Research, 248(3), 910–916.
  • Kimms, A. and Kozeletskyi, I. (2017) Consideration of multiple objectives in horizontal cooperation with an application to transportation planning. IISE Transactions, 49(12), 1160–1171.
  • Lai, M., Cai, X. and Hall, N.G. (2022) Cost allocation for less-than-truckload collaboration via shipper consortium. Transportation Science, 56(3), 585–611.
  • Liu, L., Qi, X. and Xu, Z. (2016) Computing near-optimal stable cost allocations for cooperative games by Lagrangian relaxation. INFORMS Journal on Computing, 28(4), 687–702.
  • Liu, Z. (2009) Complexity of core allocation for the bin packing game. Operations Research Letters, 37(4), 225–229.
  • Luan, J., Daina, N., Reinau, K.H., Sivakumar, A. and Polak, J.W. (2022) A data-based opportunity identification engine for collaborative freight logistics based on a trailer capacity graph. Expert Systems with Applications, 210, 118494.
  • Marinakis, Y., Migdalas, A. and Pardalos, P.M. (2008) Cost allocation in combinatorial optimization games. in Pareto Optimality, Game Theory and Equilibria, Springer, New York, NY, pp. 217–247.
  • Maschler, M., Peleg, B. and Shapley, L.S. (1979) Geometric properties of the kernel, nucleolus, and related solution concepts. Mathematics of Operations Research, 4(4), 303–338.
  • Matsubayashi, N., Umezawa, M., Masuda, Y. and Nishino, H. (2005) A cost allocation problem arising in hub–spoke network systems. European Journal of Operational Research, 160(3), 821–838.
  • Öner, N. and Kuyzu, G. (2022) Nucleolus based cost allocation methods for a class of constrained lane covering games. Computers & Industrial Engineering, 172, 108583.
  • Osicka, O., Guajardo, M. and van Oost, T. (2020) Cooperative game-theoretic features of cost sharing in location-routing. International Transactions in Operational Research, 27(4), 2157–2183.
  • Özener, O.Ö. and Ergun, Ö. (2008) Allocating costs in a collaborative transportation procurement network. Transportation Science, 42(2), 146–165.
  • Özener, O.Ö., Ergun, Ö. and Savelsbergh, M. (2013) Allocating cost of service to customers in inventory routing. Operations Research, 61(1), 112–125.
  • Pál, M. and Tardos, É. (2003) Group strategy proof mechanisms via primal-dual algorithms, in Proceedings of 44th Annual IEEE Symposium on Foundations of Computer Science, IEEE Press, Piscataway, NJ, pp. 584–593.
  • Pallet Rack Guru (2022) How what are pallet dimensions and weight? Technical report, Pallet Rack Guru, Anaheim, CA. Available at https://palletrackguru.com/pallet-dimensions-weight/ (accessed 5 September 2022).
  • Parsa, P., Rossetti, M. and Zhang, S. (2017) Multi stop truckload planning, in Proceedings of the 2017 Industrial and Systems Engineering Conference, Institute of Industrial and Systems Engineers (IISE), Norcross, GA, pp. 1276–1281.
  • Popescu, D.C. and Kilby, P. (2020) Approximation of the Shapley value for the Euclidean travelling salesman game. Annals of Operations Research, 289, 341–362.
  • Potters, J.A., Curiel, I.J. and Tijs, S.H. (1992) Traveling salesman games. Mathematical Programming, 53, 199–211.
  • Qiu, X. and Kern, W. (2016) Approximate core allocations and integrality gap for the bin packing game. Theoretical Computer Science, 627, 26–35.
  • Robinson, C.H. (2016) Assessing the 5 biggest LTL savings opportunities. Technical report, C.H. Robinson Worldwide, Inc., Eden Prairie, MN. Available at https://www.chrobinson.com/en-US/Resources/White-Papers/ (accessed 16 August 2022).
  • Robinson, C.H. (2017) Multi-stop trucking: How it affects load acceptance and pricing and what you can do about it? Technical report, C.H. Robinson Worldwide, Inc., Eden Prairie, MN. Available at https://www.mytmc.com/en-us/resources/white-papers/ (accessed 16 August 2022).
  • Ropke, S. and Cordeau, J.-F. (2009) Branch and cut and price for the pickup and delivery problem with time windows. Transportation Science, 43(3), 267–286.
  • Shapley, L. and Shubik, M. (1966) Quasi-cores in a monetary economy with nonconvex preferences. Econometrica: Journal of the Econometric Society, 34(4), 805–827.
  • Skorin-Kapov, D. (1995) On the core of the minimum cost Steiner tree game in networks. Annals of Operations Research, 57, 233–249.
  • Skorin-Kapov, D. (2001) On cost allocation in hub-like networks. Annals of Operations Research, 106, 63–78.
  • Taherian, H. (2014) All you need to know about co-loadings. Technical report, Inbound Logistics, North Bethesda MD. Available at https://www.inboundlogistics.com/cms/article/all-you-need-to-know-about-co-loading/ (accessed 16 August 2022).
  • Tinoco, S.V.P., Creemers, S. and Boute, R.N. (2017) Collaborative shipping under different cost-sharing agreements. European Journal of Operational Research, 263(3), 827–837.
  • UberX Share (2021) What is uberx share? Technical report, Uber Technologies Inc., San Francisco, CA. Available at https://www.uber.com/us/en/ride/uberx-share/ (accessed 3 July 2023).
  • van Zon, M. and Desaulniers, G. (2021) The joint network vehicle routing game with optional customers. Computers & Operations Research, 133, 105375.
  • van Zon, M., Spliet, R. and van den Heuvel, W. (2021) The joint network vehicle routing game. Transportation Science, 55(1), 179–195.
  • Vanovermeire, C. and Sörensen, K. (2014a) Integration of the cost allocation in the optimization of collaborative bundling. Transportation Research Part E: Logistics and Transportation Review, 72, 125–143.
  • Vanovermeire, C. and Sörensen, K. (2014b) Measuring and rewarding flexibility in collaborative distribution, including two-partner coalitions. European Journal of Operational Research, 239(1), 157–165.
  • Vanovermeire, C., Sörensen, K., Van Breedam, A., Vannieuwenhuyse, B. and Verstrepen, S. (2014) Horizontal logistics collaboration: Decreasing costs through flexibility and an adequate cost allocation strategy. International Journal of Logistics Research and Applications, 17(4), 339–355.
  • Verheyen, W. and De Bruecker, P. (2020) Automated SME cargo bundling as a tool to reduce transaction costs while limiting the platform’s liability exposure, in Maritime Supply Chains, Elsevier, Cambridge, MA, pp. 167–204.
  • Wang, Y., Ma, X., Li, Z., Liu, Y., Xu, M. and Wang, Y. (2017) Profit distribution in collaborative multiple centers vehicle routing problem. Journal of Cleaner Production, 144, 203–219.
  • Wang, Y., Peng, S., Xu, C., Assogba, K., Wang, H., Xu, M. and Wang, Y. (2018) Two-echelon logistics delivery and pickup network optimization based on integrated cooperation and transportation fleet sharing. Expert Systems with Applications, 113, 44–65.
  • Yang, F., Dai, Y. and Ma, Z.-J. (2020) A cooperative rich vehicle routing problem in the last-mile logistics industry in rural areas. Transportation Research Part E: Logistics and Transportation Review, 141, 102024.
  • Yunmanman (2018) Yunmanman technology data contest. Technical report, JiangSu ManYun Software Technology Co., Ltd., Beijing. Available at http://ymmtech.ymm56.com (accessed 16 August 2022).
  • Zakharov, V.V. and Shchegryaev, A. (2015) Stable cooperation in dynamic vehicle routing problems. Automation and Remote Control, 76, 935–943.
  • Zibaei, S., Hafezalkotob, A. and Ghashami, S.S. (2016) Cooperative vehicle routing problem: An opportunity for cost saving. Journal of Industrial Engineering International, 12, 271–286.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.