An Exact Algorithm for the Heterogeneous Fleet Vehicle Routing Problem with Time Windows and Three-Dimensional Loading Constraints

  • Vicky Mak-HauEmail author
  • I. Moser
  • Aldeida Aleti
Conference paper
Part of the Lecture Notes in Management and Industrial Engineering book series (LNMIE)


One of our industry partners distributes a multitude of orders of fibre boards all over each of the Australian capital cites, a problem that has been formalised as the Heterogeneous Fleet Vehicle Routing Problem with Time Windows and Three-Dimensional Loading Constraints (3L-HFVRPTW). The fleet consists of two types of trucks with flat loading surfaces and slots for spacers that allow a subdivision into stacks of different sizes. A customer’s delivery can be positioned on more than one partition, but the deliveries have to be loaded in a strict LIFO order. Optimising the truck loads beyond the 75% that can be achieved manually provides value to the company because the deliveries are generally last-minute orders and the customers depend on the deliveries for their contract work on refurbishments. This paper presents an exact integer linear programming model that serves two purposes: (1) providing exact solutions for problems of a modest size as a basis for comparing the quality of heuristic solution methodologies, and (2) for further exploration of various relaxations, stack generation, and decomposition strategies that are based on the ILP model. We solved a few real-life instances by obtaining the exact optimal solution using CPLEX 12.61, whereas previously, the problem was solved manually by staff members of the furniture company.


Delivery truck loading Routing Integer Programming 


  1. 1.
    Akartunali, K., Mak-Hau, V., Tran, T.: A unified mixed-integer programming model for simultaneous fluence weight and aperture optimization in vmat, tomotherapy, and cyberknife. Comput. Oper. Res. 56, 134–150 (2015)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Baldacci, R., Hadjiconstantinou, E., Mingozzi, A.: An exact algorithm for the capacitated vehicle routing problem based on a two-commodity network flow formulation. Oper. Res. 52(5), 723–738 (2004)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Barkaoui, M., Gendreau, M.: An adaptive evolutionary approach for real-time vehicle routing and dispatching. Comput. Oper. Res. 40(7), 1766–1776 (2013)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Bortfeldt, A.: A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints. Comput. Oper. Res. 39(9), 2248–2257 (2012)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Ceschia, S., Schaerf, A.: Local search for a multi-drop multi-container loading problem. J. Heuristics 19(2), 275–294 (2013)CrossRefGoogle Scholar
  6. 6.
    Finke, G., Claus, A., Gunn, E.: A two-commodity network flow approach to the traveling salesman problem. Congressus Numerantium 41(1), 167–178 (1984)MathSciNetzbMATHGoogle Scholar
  7. 7.
    Fleszar, K., Osman, I.H., Hindi, K.S.: A variable neighbourhood search algorithm for the open vehicle routing problem. Eur. J. Oper. Res. 195(3), 803–809 (2009)CrossRefzbMATHGoogle Scholar
  8. 8.
    Fukasawa, R., Lysgaard, J., Poggi de Arago, M., Reis, M., Uchoa, E., Werneck, R.: Robust branch-and-cut-and-price for the capacitated vehicle routing problem. In: Bienstock, D., Nemhauser, G. (eds.) Integer Programming and Combinatorial Optimization. Lecture Notes in Computer Science, vol. 3064, pp. 1–15. Springer, Berlin (2004)Google Scholar
  9. 9.
    Hong, L.: An improved lns algorithm for real-time vehicle routing problem with time windows. Comput. Oper. Res. 39(2), 151–163 (2012)CrossRefzbMATHGoogle Scholar
  10. 10.
    Junqueira, L., Morabito, R.: Heuristic algorithms for a three-dimensional loading capacitated vehicle routing problem in a carrier. Comput. Ind. Eng. 88, 110–130 (2015)CrossRefGoogle Scholar
  11. 11.
    Mak, V., Ernst, A.T.: New cutting-planes for the time-and/or precedence-constrained ATSP and directed VRP. Math. Methods Oper. Res. 66(1), 69–98 (2007)MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Miller, C., Tucker, A., Zemlin, R.A.: Integer programming formulations and travelling salesman problems. J. ACM 7, 326–329 (1960)CrossRefzbMATHGoogle Scholar
  13. 13.
    MirHassani, S., Abolghasemi, N.: A particle swarm optimization algorithm for open vehicle routing problem. Expert Syst. Appl. 38(9), 11547–11551 (2011)CrossRefGoogle Scholar
  14. 14.
    Moura, A., Oliveira, J.F.: An integrated approach to the vehicle routing and container loading problems. OR Spectrum 31(4), 775–800 (2009)MathSciNetCrossRefzbMATHGoogle Scholar
  15. 15.
    Rivera, J.C., Afsar, H.M., Prins, C.: Mathematical formulations and exact algorithm for the multitrip cumulative capacitated single-vehicle routing problem. Eur. J. Oper. Res. 249(1), 93–104 (2016)MathSciNetCrossRefzbMATHGoogle Scholar
  16. 16.
    Pace, S., Turky, A., Moser, I., Aleti, A.: Distributing fibre boards: a practical application of the heterogeneous fleet vehicle routing problem with time windows and three-dimensional loading constraints. In: International Conference On Computational Science, pp. 2257–2266. ACM, NY, USA (2015). doi: 10.1016/j.procs.2015.05.382
  17. 17.
    Subramanian, A., Uchoa, E., Ochi, L.S.: A hybrid algorithm for a class of vehicle routing problems. Comput. Oper. Res. 40(10), 2519–2531 (2013)CrossRefzbMATHGoogle Scholar
  18. 18.
    Szeto, W., Wu, Y., Ho, S.C.: An artificial bee colony algorithm for the capacitated vehicle routing problem. Eur. J. Oper. Res. 215(1), 126–135 (2011)CrossRefGoogle Scholar
  19. 19.
    Tao, Y., Wang, F.: An effective tabu search approach with improved loading algorithms for the 3l-cvrp. Comput. Oper. Res. 55(C), 127–140 (2015)Google Scholar
  20. 20.
    Tarantilis, C., Zachariadis, E., Kiranoudis, C.: A hybrid metaheuristic algorithm for the integrated vehicle routing and three-dimensional container-loading problem. IEEE Trans. Intell. Transp. Syst. 10(2), 255–271 (2009)CrossRefGoogle Scholar
  21. 21.
    Toth, P., Vigo, D.: Models, relaxations and exact approaches for the capacitated vehicle routing problem. Discrete Appl. Math. 123(1), 487–512 (2002)MathSciNetCrossRefzbMATHGoogle Scholar
  22. 22.
    Wei, L., Zhang, Z., Lim, A.: An adaptive variable neighborhood search for a heterogeneous fleet vehicle routing problem with three-dimensional loading constraints. IEEE Comput. Intell. Mag. 9(4), 18–30 (2014)CrossRefGoogle Scholar
  23. 23.
    Zachariadis, E.E., Tarantilis, C.D., Kiranoudis, C.T.: The pallet-packing vehicle routing problem. Transp. Sci. 46(3), 341–358 (2012)CrossRefGoogle Scholar
  24. 24.
    Zachariadis, E.E., Tarantilis, C.D., Kiranoudis, C.T.: Designing vehicle routes for a mix of different request types, under time windows and loading constraints. Eur. J. Oper. Res. 229(2), 303–317 (2013)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer International Publishing AG 2018

Authors and Affiliations

  1. 1.School of Information TechnologyDeakin UniversityGeelongAustralia
  2. 2.Department of Computer Science and Software EngineeringSwinburne University of TechnologyMelbourneAustralia
  3. 3.Faculty of Information TechnologyMonash UniversityCaulfieldAustralia

Personalised recommendations