An Ant Colony-Based Matheuristic Approach for Solving a Class of Vehicle Routing Problems

  • Umman Mahir YıldırımEmail author
  • Bülent Çatay
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9335)


We propose a matheuristic approach to solve several types of vehicle routing problems (VRP). In the VRP, a fleet of capacitated vehicles visits a set of customers exactly once to satisfy their demands while obeying problem specific characteristics and constraints such as homogeneous or heterogeneous fleet, customer service time windows, single or multiple depots. The proposed matheuristic is based on an ant colony optimization (ACO) algorithm which constructs good feasible solutions. The routes obtained in the ACO procedure are accumulated in a pool as columns which are then fed to an integer programming (IP) optimizer that solves the set-partitioning (-covering) formulation of the particular VRP. The (near-)optimal solution found by the solver is used to reinforce the pheromone trails in ACO. This feedback mechanism between the ACO and IP procedures helps the matheuristic better converge to high quality solutions. We test the performance of the proposed matheuristic on different VRP variants using well-known benchmark instances from the literature. Our computational experiments reveal competitive results: we report six new best solutions and meet the best-known solution in 120 instances out of 193.


Vehicle routing problem Matheuristic Ant colony optimization 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Alvarenga, G.B., Mateus, G.R., de Tomi, G.: A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows. Computers and Operations Research 34(6), 1561–1584 (2007)CrossRefzbMATHGoogle Scholar
  2. 2.
    Archetti, C., Speranza, M.: A survey on matheuristics for routing problems. EURO Journal on Computational Optimization 2, 223–246 (2014)CrossRefzbMATHGoogle Scholar
  3. 3.
    Archetti, C., Speranza, M., Savelsbergh, M.: An optimization-based heuristic for the split delivery vehicle routing problem. Transportation Science 42, 22–31 (2008)CrossRefGoogle Scholar
  4. 4.
    Bertazzi, L., Speranza, M.G.: Matheuristics for inventory routing problems. In: MontoyaTorres, J.R., Juan, A.A., Huatuco, L.H., Faulin, J., Rodriguez-Verjan, G.L. (eds.) Hybrid Algorithms for Service, Computing and Manufacturing Systems: Routing and Scheduling Solutions. IGI Global, Hershey (2011)Google Scholar
  5. 5.
    Boschetti, M.A., Maniezzo, V., Roffilli, M., Bolufé Röhler, A.: Matheuristics: optimization, simulation and control. In: Blesa, M.J., Blum, C., Di Gaspero, L., Roli, A., Sampels, M., Schaerf, A. (eds.) HM 2009. LNCS, vol. 5818, pp. 171–177. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  6. 6.
    Boschetti, M., Maniezzo, V.: A set covering based matheuristic for a real-world city logistics problem. International Transactions in Operational Research 22, 169–196 (2015)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Bullnheimer, B., Hartl, R.F., Strauss, C.: A new rank-based version of the ant system: A computational study. Central European Journal of Operations Research 7, 25–38 (1999)MathSciNetzbMATHGoogle Scholar
  8. 8.
    Christofides, N., Mingozzi, A., Toth, P.: The vehicle routing problem. In: Chrisofides, N., Mingozzi, A., Toth, P., Sandi, C. (eds.) Combinatorial Optimization, pp. 315–338. Wiley, Chichester (1979)Google Scholar
  9. 9.
    Cordeau, J.-F., Gendreau, M., Laporte, G.: A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks 30(2), 105–119 (1997)CrossRefzbMATHGoogle Scholar
  10. 10.
    Doerner, K.F., Schmid, V.: Survey: matheuristics for rich vehicle routing problems. In: Blesa, M.J., Blum, C., Raidl, G., Roli, A., Sampels, M. (eds.) HM 2010. LNCS, vol. 6373, pp. 206–221. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  11. 11.
    Golden, B.L., Assad, A.A., Levy, L., Gheysens, F.G.: The fleet size and mix vehicle routing problem. Computers and Operations Research 11, 49–66 (1984)CrossRefzbMATHGoogle Scholar
  12. 12.
    Groër, C., Golden, B., Wasil, E.: A library of local search heuristics for the vehicle routing problem. Mathematical Programming Computation 2, 79–101 (2010)MathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    Groër, C., Golden, B., Wasil, E.: A parallel algorithm for the vehicle routing problem. Informs Journal on Computing 23, 315–330 (2011)MathSciNetCrossRefzbMATHGoogle Scholar
  14. 14.
    Gulczynski, D., Golden, B., Wasil, E.: The period vehicle routing problem: new heuristics and real-world variants. Transportation Research Part E-Logistics 47, 648–668 (2011)CrossRefGoogle Scholar
  15. 15.
    Kelly, J.P., Xu, J.: A set-partitioning-based heuristic for the vehicle routing problem. Informs Journal on Computing 11, 161–172 (1999)MathSciNetCrossRefzbMATHGoogle Scholar
  16. 16.
    Maniezzo, V., Stützle, T., Voß, S.: Matheuristics: Hybridizing Metaheuristics and Mathematical Programming. Springer, New-York (2010)CrossRefzbMATHGoogle Scholar
  17. 17.
    Mendoza, J.E., Villegas, J.G.: A multi-space sampling heuristic for the vehicle routing problem with stochastic demands. Optimization Letters 7, 1503–1506 (2013)MathSciNetCrossRefzbMATHGoogle Scholar
  18. 18.
    Pirkwieser, S., Raidl, G.R.: Multiple variable neighborhood search enriched with ILP techniques for the periodic vehicle routing problem with time windows. In: Blesa, M.J., Blum, C., Di Gaspero, L., Roli, A., Sampels, M., Schaerf, A. (eds.) HM 2009. LNCS, vol. 5818, pp. 45–59. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  19. 19.
    Russell, R.A., Chiang, W.-C.: Scatter search for the vehicle routing problem with time windows. European Journal of Operational Research 169(2), 606–622 (2006)MathSciNetCrossRefzbMATHGoogle Scholar
  20. 20.
    Reinholz, A., Schneider, H.: A Hybrid (1+1)-Evolutionary Strategy for the Open Vehicle Routing Problem. Advances in Metaheuristics, Operations Research/Computer Science Interfaces Series 53, 127–141 (2013)CrossRefGoogle Scholar
  21. 21.
    Roberti, R.: Exact Algorithms for Different Classes of Vehicle Routing Problems. Dissertation in Control System Engineering and Operational Research. University of Bologna, Italy (2012)Google Scholar
  22. 22.
    Röpke, S.: Personal communication (2014)Google Scholar
  23. 23.
    Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations Research 35(2), 254–265 (1987)MathSciNetCrossRefzbMATHGoogle Scholar
  24. 24.
    Subramanian, A., Penna, P.H.V., Uchoa, E., Ochi, L.S.: A hybrid algorithm for the heterogeneous fleet vehicle routing problem. European Journal of Operational Research 221(2), 285–295 (2012)MathSciNetCrossRefzbMATHGoogle Scholar
  25. 25.
    Subramanian, A., Uchoa, E., Ochi, L.S.: A hybrid algorithm for a class of vehicle routing problems. Computers and Operations Research 40, 2519–2531 (2013)CrossRefzbMATHGoogle Scholar
  26. 26.
    Yildirim, U.M., Çatay, B.: A time-based pheromone approach for the ant system. Optimization Letters 6(6), 1081–1099 (2012)MathSciNetCrossRefzbMATHGoogle Scholar
  27. 27.
    Yıldırım, U.M., Çatay, B.: A parallel matheuristic for solving the vehicle routing problems. In: de Sousa, J.F., Rossi, R. (eds.) Computer-based Modelling and Optimization in Transportation. AISC, vol. 262, pp. 477–489. Springer International Publishing, Heidelberg (2014)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.School of Industrial EngineeringEindhoven University of TechnologyEindhovenThe Netherlands
  2. 2.Faculty of Engineering and Natural SciencesSabanci UniversityIstanbulTurkey

Personalised recommendations