The Cost of Continuity in the Collaborative Pickup and Delivery Problem

  • Margaretha GanstererEmail author
  • Richard F. Hartl
  • Sarah Wieser
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11184)


We assess the potential total profit in collaborative pickup and delivery problems, where carriers are willing to exchange transportation requests. For this, we design an adaptive large neighborhood search method that is used to generate solutions of publicly available but yet unsolved test instances. Our computational study reveals that collaboration profits might go up to 40% of the initial total profit, but typically come with unevenly distributed workloads. Such solution are of course not acceptable in practice. Thus, the aim of this study is to elaborate on the cost of continuity, i.e. the possibility for carriers to not deviate too much from their initial situations. Carriers might, for instance, not be willing to give up on some of their customers or want to stay with minimum profits. The rational behind keeping customers is that carriers might have long-term or particular valuable customer relationships, which they do not want to abandon. We discuss different types of continuity constraints and assess their impact on the total collaboration profit. Our computational study shows that even in the presence of continuity constraints remarkable total collaboration profits can be achieved.


Logistics Collaboration Centralized planning Adaptive large neighborhood search 


  1. 1.
    Amous, M., Toumi, S., Jarboui, B., Eddaly, M.: A variable neighborhood search algorithm for the capacitated vehicle routing problem. Electron. Notes Discret. Math. 58, 231–238 (2017)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Archetti, C., Speranza, M., Vigo, D.: Vehicle routing problems with profits. In: Toth, P., Vigo, D. (eds.) Vehicle Routing: Problems, Methods, and Applications, pp. 273–297. MOS-SIAM Series on Optimization (2014)Google Scholar
  3. 3.
    Azi, N., Gendreau, M., Potvin, J.Y.: An adaptive large neighborhood search for a vehicle routing problem with multiple routes. Comput. Oper. Res. 41, 167–173 (2014)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Ballot, E., Fontane, F.: Reducing transportation \(\text{ CO }_2\) emissions through pooling of supply networks: perspectives from a case study in french retail chains. Prod. Plan. Control 21(6), 640–650 (2010)CrossRefGoogle Scholar
  5. 5.
    Bektaş, T., Demir, E., Laporte, G.: Green vehicle routing. In: Psaraftis, H. (ed.) Green Transportation Logistics. ISOR, pp. 243–265. Springer, Cham (2016). Scholar
  6. 6.
    Berbeglia, G., Cordeau, J.F., Gribkovskaia, I., Laporte, G.: Static pickup and delivery problems: a classification scheme and survey. TOP 15(1), 1–31 (2007)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Berbeglia, G., Cordeau, J.F., Laporte, G.: Dynamic pickup and delivery problems. Eur. J. Oper. Res. 202(1), 8–15 (2010)CrossRefGoogle Scholar
  8. 8.
    Berger, S., Bierwirth, C.: Solutions to the request reassignment problem in collaborative carrier networks. Transp. Res. Part E: Logist. Transp. Rev. 46, 627–638 (2010)CrossRefGoogle Scholar
  9. 9.
    Buijs, P., Alvarez, J.A.L., Veenstra, M., Roodbergen, K.J.: Improved collaborative transport planning at dutch logistics service provider fritom. Interfaces 46(2), 119–132 (2016)CrossRefGoogle Scholar
  10. 10.
    Cleophas, C., Cottrill, C., Ehmke, J.F., Tierney, K.: Collaborative urban transportation: recent advances in theory and practice. Eur. J. Oper. Res. (2018). Scholar
  11. 11.
    Cruijssen, F., Bräysy, O., Dullaert, W., Fleuren, H., Salomon, M.: Joint route planning under varying market conditions. Int. J. Phys. Distrib. Logist. Manag. 37(4), 287–304 (2007)CrossRefGoogle Scholar
  12. 12.
    Dai, B., Chen, H.: Mathematical model and solution approach for carriers collaborative transportation planning in less than truckload transportation. Int. J. Adv. Oper. Manag. 4, 62–84 (2012)Google Scholar
  13. 13.
    Defryn, C., Sörensen, K.: A fast two-level variable neighborhood search for the clustered vehicle routing problem. Comput. Oper. Res. 83, 78–94 (2017)MathSciNetCrossRefGoogle Scholar
  14. 14.
    Dragomir, A.G., Nicola, D., Soriano, A., Gansterer, M.: Multidepot pickup and delivery problems in multiple regions: a typology and integrated model. Int. Trans. Oper. Res. 25(2), 569–597 (2018)MathSciNetCrossRefGoogle Scholar
  15. 15.
    Fernandez, E., Roca-Riu, M., Speranza, M.G.: The shared customer collaboration vehicle routing problem. Eur. J. Oper. Res. 265(3), 1078–1093 (2018). Scholar
  16. 16.
    Gansterer, M., Hartl, R., Vetschera, R.: The cost of incentive compatibility in auction-based mechanisms for carrier collaboration. Networks (2018, forthcoming)Google Scholar
  17. 17.
    Gansterer, M., Hartl, R.F.: Request evaluation strategies for carriers in auction-based collaborations. OR Spectr. 38(1), 3–23 (2016)MathSciNetCrossRefGoogle Scholar
  18. 18.
    Gansterer, M., Hartl, R.F.: Bundle generation in combinatorial transportation auctions. Working Paper (2017)Google Scholar
  19. 19.
    Gansterer, M., Hartl, R.F.: Collaborative vehicle routing: a survey. Eur. J. Oper. Res. 268(1), 1–12 (2018)MathSciNetCrossRefGoogle Scholar
  20. 20.
    Gansterer, M., Hartl, R.F., Salzmann, P.E.H.: Exact solutions for the collaborative pickup and delivery problem. Central Eur. J. Oper. Res. 26(2), 357–371 (2018)MathSciNetCrossRefGoogle Scholar
  21. 21.
    Ghilas, V., Demir, E., Woensel, T.V.: An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows and scheduled lines. Comput. Oper. Res. 72, 12–30 (2016)MathSciNetCrossRefGoogle Scholar
  22. 22.
    Guajardo, M., Rönnqvist, M.: A review on cost allocation methods in collaborative transportation. Int. Trans. Oper. Res. 23(3), 371–392 (2016). Scholar
  23. 23.
    Haddad, M.N., et al.: Large neighborhood-based metaheuristic and branch-and-price for the pickup and delivery problem with split loads. Eur. J. Oper. Res. (2018). Scholar
  24. 24.
    Kovacs, A., Parragh, S., Hartl, R.: A template-based adaptive large neighborhood search for the consistent vehicle routing problem. Networks 63(1), 60–81 (2014)MathSciNetCrossRefGoogle Scholar
  25. 25.
    Krajewska, M., Kopfer, H.: Collaborating freight forwarding enterprises. OR Spectr. 28(3), 301–317 (2006)CrossRefGoogle Scholar
  26. 26.
    Lin, C., Choy, K., Ho, G., Chung, S., Lam, H.: Survey of green vehicle routing problem: past and future trends. Expert Syst. Appl. 41(4, Part 1), 1118–1138 (2014)CrossRefGoogle Scholar
  27. 27.
    Lin, C.: A cooperative strategy for a vehicle routing problem with pickup and delivery time windows. Comput. Ind. Eng. 55(4), 766–782 (2008)CrossRefGoogle Scholar
  28. 28.
    Lu, Q., Dessouky, M.: An exact algorithm for the multiple vehicle pickup and delivery problem. Transp. Sci. 38(4), 503–514 (2004)CrossRefGoogle Scholar
  29. 29.
    Matl, P., Hartl, R.F., Vidal, T.: Workload equity in vehicle routing problems: a survey and analysis. Transp. Sci. 52(2), 239–260 (2018). Scholar
  30. 30.
    Molenbruch, Y., Braekers, K., Caris, A.: Benefits of horizontal cooperation in dial-a-ride services. Transp. Res. Part E: Logist. Transp. Rev. 107, 97–119 (2017)CrossRefGoogle Scholar
  31. 31.
    Montoya-Torres, J.R., Muñoz-Villamizar, A., Vega-Mejia, C.A.: On the impact of collaborative strategies for goods delivery in city logistics. Prod. Plan. Control 27(6), 443–455 (2016)CrossRefGoogle Scholar
  32. 32.
    Nadarajah, S., Bookbinder, J.: Less-than-truckload carrier collaboration problem: Modeling framework and solution approach. J. Heuristics 19, 917–942 (2013)CrossRefGoogle Scholar
  33. 33.
    Parragh, S., Dörner, K., Hartl, R.: A survey on pickup and delivery problems. Part II: transportation between pickup and delivery locations. J. für Betriebswirtschaft 58, 21–51 (2008)CrossRefGoogle Scholar
  34. 34.
    Pérez-Bernabeu, E., Juan, A.A., Faulin, J., Barrios, B.B.: Horizontal cooperation in road transportation: a case illustrating savings in distances and greenhouse gas emissions. Int. Trans. Oper. Res. 22(3), 585–606 (2015)MathSciNetCrossRefGoogle Scholar
  35. 35.
    Polacek, M., Benkner, S., Doerner, K.F., Hartl, R.F.: A cooperative and adaptive variable neighborhood search for the multi depot vehicle routing problem with time windows. Bus. Res. 1(2), 207–218 (2008)CrossRefGoogle Scholar
  36. 36.
    Ropke, S., Pisinger, D.: An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transp. Sci. 40(4), 455–472 (2006)CrossRefGoogle Scholar
  37. 37.
    Sanchez, M., Pradenas, L., Deschamps, J.C., Parada, V.: Reducing the carbon footprint in a vehicle routing problem by pooling resources from different companies. NETNOMICS: Econ. Res. Electron. Netw. 17(1), 29–45 (2016)CrossRefGoogle Scholar
  38. 38.
    Speranza, M.G.: Trends in transportation and logistics. Eur. J. Oper. Res. 264(3), 830–836 (2018)MathSciNetCrossRefGoogle Scholar
  39. 39.
    Vanovermeire, C., Sörensen, K., Breedam, A.V., Vannieuwenhuyse, B., Verstrepen, S.: Horizontal logistics collaboration: decreasing costs through flexibility and an adequate cost allocation strategy. Int. J. Logist. Res. Appl. 17(4), 339–355 (2014)CrossRefGoogle Scholar
  40. 40.
    Verdonck, L., Caris, A., Ramaekers, K., Janssens, G.K.: Collaborative logistics from the perspective of road transportation companies. Transp. Rev. 33(6), 700–719 (2013)CrossRefGoogle Scholar
  41. 41.
    Wang, X., Kopfer, H., Gendreau, M.: Operational transportation planning of freight forwarding companies in horizontal coalitions. Eur. J. Oper. Res. 237(3), 1133–1141 (2014)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2018

Authors and Affiliations

  • Margaretha Gansterer
    • 1
    Email author
  • Richard F. Hartl
    • 1
  • Sarah Wieser
    • 1
  1. 1.Department for Business AdministrationUniversity of ViennaViennaAustria

Personalised recommendations