Journal of Heuristics

, Volume 19, Issue 6, pp 917–942 | Cite as

Less-Than-Truckload carrier collaboration problem: modeling framework and solution approach

Article

Abstract

Less-Than-Truckload (LTL) carriers generally serve geographical regions that are more localized than the inter-city line-hauls served by truckload carriers. That localization can lead to urban freight transportation routes that overlap. If trucks are traveling with less than full loads, there typically exist opportunities for carriers to collaborate over such routes. We introduce a two stage framework for LTL carrier collaboration. Our first stage involves collaboration between multiple carriers at the entrance to the city and can be formulated as a vehicle routing problem with time windows (VRPTW). We employ guided local search for solving this VRPTW. The second stage involves collaboration between carriers at transshipment facilities while executing their routes identified in phase one. For solving the second stage problem, we develop novel local search heuristics, one of which leverages integer programming to efficiently explore the union of neighborhoods defined by new problem-specific move operators. Our computational results indicate that integrating integer programming with local search results in at least an order of magnitude speed up in the second stage problem. We also perform sensitivity analysis to assess the benefits from collaboration. Our results indicate that distance savings of 7–15 % can be achieved by collaborating at the entrance to the city. Carriers involved in intra-city collaboration can further save 3–15 % in total distance traveled, and also reduce their overall route times.

Keywords

LTL collaboration Vehicle routing Constraint programming  Integer programming Integrated methods 

References

  1. Bräysy, O., Gendreau, M.: Vehicle routing with time windows, part 1: route construction and local search algorithms. Transp. Sci. 39(1), 104–118 (2005a)CrossRefGoogle Scholar
  2. Bräysy, O., Gendreau, M.: Vehicle routing with time windows, part 2: metaheuristics. Transp. Sci. 39(1), 119–139 (2005b)CrossRefGoogle Scholar
  3. Crainic, T.G., Ricciardi, N., Storchi, G.: Routing vehicles in two-level city logistics systems. In: 50th Canadian Operational Research Society Conference, Université Laval, Québec (2008)Google Scholar
  4. Cruijssen, F., Salomon, M.: Empirical study: Order sharing between transportation companies may result in cost reductions between 5 to 15 percent. Technical report, Tilburg University, Center for Economic Research (2004)Google Scholar
  5. De Backer, B., Furnon, V., Kilby, P., Prosser, P., Shaw, P.: Solving vehicle routing problems using constraint programming and metaheuristics. J. Heuristics 6(4), 501–523 (2000)CrossRefMATHGoogle Scholar
  6. Ergun, O., Kuyzu, G., Savelsbergh, M.: Shipper collaboration. Comput. Oper. Res. 34(6), 1551–1560 (2007)CrossRefMATHGoogle Scholar
  7. Finkel, R.A., Bentley, J.L.: Quadtrees: a data stucture for retrieval on composite keys. Acta Inf. 4, 1–9 (1974)CrossRefMATHGoogle Scholar
  8. Focacci, F., Lodi, A., Milano, M.: Cost-based domain filtering. In: Principles and Practice of Constraint Programming-CP99, pp. 189–203. Springer, Berlin (1999)Google Scholar
  9. Hooker, J.N.: Integrated methods for optimization. In: International Series in Operations Research and Management Science, vol. 100. Springer, New York (2007)Google Scholar
  10. Houghtalen, L., Ergun, Ö., Sokol, J.: Designing mechanisms for the management of carrier alliances. Transp. Sci. 45(4), 465 (2011)CrossRefGoogle Scholar
  11. Industry Canada: state of logistics: the canadian report 2008. Technical report, www.ic.gc.ca//logistics (2008)
  12. Jain, A.K., Murty, M.N., Flynn, P.J.: Data clustering: a review. ACM Comput. Surv. 31(3), 264–323 (1999)CrossRefGoogle Scholar
  13. Jain, V., Grossmann, I.E.: Algorithms for hybrid MILP/CP models for a class of optimization problems. INFORMS J. Comput. 13(4), 258–276 (2001)MathSciNetCrossRefMATHGoogle Scholar
  14. Kindervater, G.A.P., Savelsbergh, M.W.P.: Vehicle routing: handling edge exchanges. In: Local Search in Combinatorial Optimzation, chap. 10, pp. 337–360. Princeton University Press, Princeton (2003)Google Scholar
  15. Krajewska, M.A., Kopfer, H.: Collaborating freight forwarding enterprises. OR Spectrum 28(3), 301–317 (2006)CrossRefMATHGoogle Scholar
  16. Krajewska, M.A., Kopfer, H.: Transportation planning in freight forwarding companies: Tabu search algorithm for the integrated operational transportation planning problem. Eur. J. Oper. Res. 197(2), 741–751 (2009)CrossRefMATHGoogle Scholar
  17. Liu, R., Jiang, Z., Fung, R.Y.K., Chen, F., Liu, X.: Two-phase heuristic algorithms for full truckloads multi-depot capacitated vehicle routing problem in carrier collaboration. Comput. Oper. Res. 37(5), 950–959 (2010)CrossRefMATHGoogle Scholar
  18. Lynch, K.: Collaborative logistics networks: breaking traditional performance barriers for shippers and carriers. White paper, Nistevo, Minneapolis, Minnesota (2001)Google Scholar
  19. Özener, O.Ö., Ergun, Ö., Savelsbergh, M.: Lane-exchange mechanisms for truckload carrier collaboration. Transp. Sci. 45(1), 1–17 (2011)CrossRefGoogle Scholar
  20. Rossi, F., Van Beek, P., Walsh, T.: Handbook of knowledge representation. Foundations of Artificial Intelligence, chap. 4, pp. 181–212. Elsevier, Amsterdam (2007)Google Scholar
  21. Solomon, M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35(2), 254–265 (1987)MathSciNetCrossRefMATHGoogle Scholar
  22. Sutherland, J.L.: Collaborative transportation management: a solution to the current transportation crisis. CVCR white paper 0602, Lehigh University, Pennsylvania (2006)Google Scholar
  23. Taillard, I.D.: Parallel iterative search methods for vehicle routing problems. Networks 23(8), 661–676 (1993)CrossRefMATHGoogle Scholar
  24. van Hoeve, W.: A hybrid constraint programming and semidefinite programming approach for the stable set problem. In: Principles and Practice of Constraint Programming-CP 2003, pp. 407–421. Springer, Berlin (2003)Google Scholar
  25. Voudouris, C., Tsang, E.: Guided local search. Eur. J. Oper. Re. 113(2), 80–110 (1998)Google Scholar
  26. Voudouris, C., Tsang, E.: Handbook of Metaheuristics, vol. 57 of International Series in Operations Research and Management Science, chap. 7, pp. 185–218. Kluwer, Norwell (2002)Google Scholar
  27. Wilson, R.: CSCMP’s annual state of logistics report. Technical report, CSCMP, Lombard, Illinois (2007)Google Scholar
  28. Yunes, T.: Success stories in integrated optimization. http://moya.bus.miami.edu/~tallys/integrated.php (2012)

Copyright information

© Springer Science+Business Media New York 2013

Authors and Affiliations

  1. 1.Tepper School of BusinessCarnegie Mellon UniversityPittsburghUSA
  2. 2.Department of Management SciencesUniversity of WaterlooWaterlooCanada

Personalised recommendations