Fleet Size and Mix Pickup and Delivery Problem with Time Windows: A Novel Approach by Column Generation Algorithm

  • M. N. Tchoupo
  • A. Yalaoui
  • L. Amodeo
  • F. Yalaoui
  • P. Flori
Part of the AIRO Springer Series book series (AIROSS, volume 1)


In this paper, a new efficient column generation algorithm is proposed to tackle the Fleet Size and Mix Pick-up and Delivery Problem with Time Windows (FSMPDPTW). This work is motivated by fleet sizing for a daily route planning arising at a Hospital centre. Indeed, a fleet of heterogeneous rented vehicles is used every day to pick up goods to the locations and to deliver it to other locations. The heterogeneous aspect of the fleet is in term of fixed cost, capacity, and fuel consumption. The objective function is the minimization of the total fixed cost of vehicles used and the total routing cost. The problem is modelled as a set partitioning problem, and an efficient column-generation algorithm is used to solve it. In the resolution, the pricing problem is decomposed in sub-problems, such that each vehicle type has its own sub-pricing problem. A mixed integer linear program, a powerful labelling algorithm and the regret heuristic is provided to solve the pricing sub-problems. Based on Li and Lim’s benchmark (altered Solomon’s benchmark) for demands and from Lui and Shen’s benchmark for vehicles types; a new set of benchmarks is proposed to test the efficiency of the propound algorithm.


Transportation logistics Pickup and delivery with time windows Heterogeneous fleet Column-generation algorithm 


  1. 1.
    Baldacci, R., Toth, P., Vigo, D.: Exact algorithms for routing problems under vehicle capacity constraints. Ann. Oper. Res. 175(1), 213–245 (2010)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Dumas, Y., Desrosiers, J., Soumis, F.: The pickup and delivery problem with time windows. Eur. J. Oper. Res. 54(1), 7–22 (1991)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Ferland, J.A., Michelon, P.: The vehicle scheduling problem with multiple vehicle types. J. Oper. Res. Soc. 39(6), 577–583 (1988)CrossRefGoogle Scholar
  4. 4.
    Golden, B., Assad, A., Levy, L., Gheysens, F.: The fleet size and mix vehicle routing problem. Comput. Oper. Res. 11(1), 49–66 (1984)CrossRefGoogle Scholar
  5. 5.
    Koç, Ç., Bektaş, T., Jabali, O., Laporte, G.: Thirty years of heterogeneous vehicle routing. Eur. J. Oper. Res. 249(1), 1–21 (2016)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Li, H., Lim, A.: A metaheuristic for the pickup and delivery problem with time windows. Int. J. Artif. Intell. Tools 12(02), 173–186 (2003)CrossRefGoogle Scholar
  7. 7.
    Liu, F.-H., Shen, S.-Y.: The fleet size and mix vehicle routing problem with time windows. J. Oper. Res. Soc. 50(7), 721–732 (1999)CrossRefGoogle Scholar
  8. 8.
    Noumbissi Tchoupo, M., Yalaoui, A., Amodeo, L., Yaloui, F., Lutz, F.: Problême de collectes et livraisons avec fenêtres de temps et flotte homogène (2016)Google Scholar
  9. 9.
    Parragh, S.N., Doerner, K.F., Hartl, R.F.: A survey on pickup and delivery problems. J. für Betr. Swirtschaft 58(1), 21–51 (2008)CrossRefGoogle Scholar
  10. 10.
    Qu, Y., Bard, J.F.: The heterogeneous pickup and delivery problem with configurable vehicle capacity. Transp. Res. Part C: Emerg. Technol. 32, 1–20 (2013)CrossRefGoogle Scholar
  11. 11.
    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
  12. 12.
    Xu, H., Chen, Z.-L., Rajagopal, S., Arunapuram, S.: Solving a practical pickup and delivery problem. Transp. Sci. 37(3), 347–364 (2003)CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2018

Authors and Affiliations

  • M. N. Tchoupo
    • 1
  • A. Yalaoui
    • 1
  • L. Amodeo
    • 1
  • F. Yalaoui
    • 1
  • P. Flori
    • 2
  1. 1.LOSI, ICD, UMR, CNRS, University of Technology of TroyesTroyesFrance
  2. 2.Hospital of TroyesTroyesFrance

Personalised recommendations