Solving Full-Vehicle-Mode Vehicle Routing Problems Using ACO

  • Yahui LiuEmail author
  • Buyang Cao
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11184)


The capacitated vehicle routing problem is a very classic but simple type of vehicle routing problem (VRP). There are variants of the VRP in practice based on different constraints which are called rich VRP (RVRP). In this article, variants of the VRP, including fixed vehicle types and dynamic vehicle type combinations are analyzed. An improved ant colony optimization (ACO) algorithm is designed to resolve this group of VRPs. The fixed vehicle type VRP, homogenous fleet VRP and heterogeneous fleet VRP are defined by one or multiple vehicle types in RVRP. Because of the evolution of transportation equipment, some new vehicle types such as truck and full trailer as well as tractor and semitrailer are introduced. The static and dynamic usages of different vehicle types vary with the business operations. We define this kind of VRPs as full-vehicle-mode (FVM) VRP in this paper. The associated ACO algorithm is developed to solve FVM-VRP problems. Computational experiments are performed and the results are presented to demonstrate the efficiency of the proposed algorithm.


Vehicle routing problem Ant colony optimization Dynamic vehicle mode Multi vehicle type 



We are indebted to Prof. Stefan Voss and three anonymous reviewers for insightful observations and suggestions that have helped to improve our paper This work was partially supported by NSFC of China project [grant number 41771410], CIUC and TJAD [grant number CIUC20150011].


  1. 1.
    Caceres-Cruz, J., Arias, P., Guimarans, D., Riera, D., Juan, A.A.: Rich vehicle routing problem: survey. ACM Comput. Surv. (CSUR) 47(2), article #32 (2015)CrossRefGoogle Scholar
  2. 2.
    Lahyani, R., Khemakhem, M., Semet, F.: Rich vehicle routing problems: from a taxonomy to a definition. Eur. J. Oper. Res. 241(1), 1–14 (2015)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Lum, O., Chen, P., Wang, X., Golden, B., Wasil, E.: A heuristic approach for the swap-body vehicle routing problem. In: 14th INFORMS Computing Society Conference, pp. 172–187 (2015)Google Scholar
  4. 4.
    Parragh, S.N., Cordeau, J.F.: Branch-and-price and adaptive large neighborhood search for the truck and trailer routing problem with time windows. Comput. Oper. Res. 83, 28–44 (2017)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Drexl, M.: Branch-and-cut algorithms for the vehicle routing problem with trailers and transshipments. Networks 63(1), 119–133 (2014)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Rothenbächer, A.K., Drexl, M., Irnich, S.: Branch-and-price-and-cut for the truck-and-trailer routing problem with time windows. Transport. Sci. (2018). Online availableGoogle Scholar
  7. 7.
    Torres, I., Cruz, C., Verdegay, J.L.: Solving the truck and trailer routing problem with fuzzy constraints. Int. J. Comput. Intell. Syst. 8(4), 713–724 (2015)CrossRefGoogle Scholar
  8. 8.
    Li, H., Lv, T., Li, Y.: The tractor and semitrailer routing problem with many-to-many demand considering carbon dioxide emissions. Transp. Res. Part D: Transp. Environ. 34, 68–82 (2015)CrossRefGoogle Scholar
  9. 9.
    Pollaris, H., Braekers, K., Caris, A., Janssens, G., Limbourg, S.: The fleet size and mix vehicle routing problem with sequence-based pallet loading and axle weight constraints. In: Proceedings of the BIVEC-GIBET Transport Research Days 2017: Towards an Autonomous and Interconnected Transport Future, pp. 162–176 (2017)Google Scholar
  10. 10.
    Li, H., Lv, T., Lu, Y.: The combination truck routing problem: a survey. Procedia Eng. 137, 639–648 (2016)CrossRefGoogle Scholar
  11. 11.
    Ariyasingha, I.D.I.D., Fernando, T.G.I.: Performance analysis of the multi-objective ant colony optimization algorithms for the traveling salesman problem. Swarm Evol. Comput. 23, 11–26 (2015)CrossRefGoogle Scholar
  12. 12.
    Gambardella, L.M., Taillard, É., Agazzi, G.: MACS-VRPTW: a multiple colony system for vehicle routing problems with time windows. In: New Ideas in Optimization, pp. 63–76. McGraw-Hill (1999)Google Scholar
  13. 13.
    Reed, M., Yiannakou, A., Evering, R.: An ant colony algorithm for the multi-compartment vehicle routing problem. Appl. Soft Comput. 15, 169–176 (2014)CrossRefGoogle Scholar
  14. 14.
    Rajappa, G.P., Wilck, J.H., Bell, J.E.: An ant colony optimization and hybrid metaheuristics algorithm to solve the split delivery vehicle routing problem. Int. J. Appl. Indust. Eng. (IJAIE) 3(1), 55–73 (2016)CrossRefGoogle Scholar
  15. 15.
    Kalayci, C.B., Kaya, C.: An ant colony system empowered variable neighborhood search algorithm for the vehicle routing problem with simultaneous pickup and delivery. Expert Syst. Appl. 66, 163–175 (2016)CrossRefGoogle Scholar
  16. 16.
    Wang, X., Choi, T.M., Liu, H., Yue, X.: Novel ant colony optimization methods for simplifying solution construction in vehicle routing problems. IEEE Trans. Intell. Transp. Syst. 17(11), 3132–3141 (2016)CrossRefGoogle Scholar
  17. 17.

Copyright information

© Springer Nature Switzerland AG 2018

Authors and Affiliations

  1. 1.School of Software EngineeringTongji UniversityShanghaiChina

Personalised recommendations