Advertisement

A Parallel Matheuristic for Solving the Vehicle Routing Problems

Chapter
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 262)

Abstract

In this chapter, we present a matheuristic approach for solving the Vehicle Routing Problems (VRP). Our approach couples the Ant Colony Optimization (ACO) algorithm with solving the Set Partitioning (SP) formulation of the VRP. As the ACO algorithm, we use a rank-based ant system approach where an agent level-based parallelization is implemented. The interim solutions which correspond to single vehicle routes are collected in a solution pool. To prevent duplicate routes, we present an elimination rule based on an identification key that is used to differentiate the routes. After a pre-determined number of iterations, the routes accumulated in the solution pool are used to solve the SP formulation of the problem to find a complete optimal solution. Once the optimal solution is obtained it is fed back to ACO as an elite solution that can be used in the pheromone reinforcement procedure. Our experimental study using the well-known VRP with Time-Windows benchmark instances of Solomon shows that the proposed methodology provides promising results.

Keywords

Vehicle routing problem Matheuristic Ant colony optimization 

References

  1. 1.
    Boschetti, M.A., Maniezzo, V., Roffilli, M., Röhler, A.B.: Matheuristics: optimization, simulation and control. In: Hybrid Metaheuristics. Lecture Notes Computer Science, vol. 5818, pp. 171–177 (2009)Google Scholar
  2. 2.
    Bertazzi, L., Speranza, M.G.: Matheuristics for inventory routing problems. In: Montoya-Torres, 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
  3. 3.
    Maniezzo, V., Stützle, T., Voß, S.: Matheuristics: Hybridizing Metaheuristics and Mathematical Programming. Springer, New-York (2010)CrossRefGoogle Scholar
  4. 4.
    Doerner, K.F., Schmid, V.: Survey: matheuristics for rich vehicle routing problems. In: 7th International Workshop on Hybrid Metaheuristics. Lecture Notes in Computer Science, vol. 6373, pp. 206–221 (2010)Google Scholar
  5. 5.
    Groër, C., Golden, B., Wasil, E.: A library of local search heuristics for the vehicle routing problem. Math. Program Comput. 2, 79–101 (2010)CrossRefMATHMathSciNetGoogle Scholar
  6. 6.
    Kelly, J.P., Xu, J.: A set-partitioning-based heuristic for the vehicle routing problem. Informs J. Comput. 11, 161–172 (1999)CrossRefMATHMathSciNetGoogle Scholar
  7. 7.
    Alvarenga, G.B., Mateus, G.R., Tomi, G.: A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows. Comput. Oper. Res. 34, 1561–1584 (2007)CrossRefMATHGoogle Scholar
  8. 8.
    Pirkwieser, S., Raidl, G.R.: Multiple variable neighborhood search enriched with ILP techniques for the periodic vehicle routing problem with time windows. In: Hybrid Metaheuristics. Lecture Notes Computer Science, vol. 5818, pp. 45–59 (2009)Google Scholar
  9. 9.
    Mendoza, J.E., Villegas, J.G.: A multi-space sampling heuristic for the vehicle routing problem with stochastic demands. Optim. Lett. (2012) (Available online)Google Scholar
  10. 10.
    Archetti, C., Speranza, M., Savelsbergh, M.: An optimization-based heuristic for the split delivery vehicle routing problem. Transp. Sci. 42, 22–31 (2008)CrossRefGoogle Scholar
  11. 11.
    Gulczynski, D., Golden, B., Wasil, E.: The period vehicle routing problem: new heuristics and real-world variants. Transp. Res. E-Log. 47, 648–668 (2011)CrossRefGoogle Scholar
  12. 12.
    Groër, C., Golden, B., Wasil, E.: A parallel algorithm for the vehicle routing problem. Informs J. Comput. 23, 315–330 (2011)CrossRefMATHMathSciNetGoogle Scholar
  13. 13.
    Subramanian, A., Penna, P.H.V., Uchoa, E., Ochi, L.S.: A hybrid algorithm for the heterogeneous fleet vehicle routing problem. Eur. J. Oper. Res. 221, 285–295 (2012)CrossRefMATHMathSciNetGoogle Scholar
  14. 14.
    Subramanian, A., Uchoa, E., Ochi, L.S.: A hybrid algorithm for a class of vehicle routing problems. Comput. Oper. Res. 40, 2519–2531 (2013)CrossRefGoogle Scholar
  15. 15.
    Villegas, J.G., Prins, C., Prodhon, C., Medaglia, A.L., Velasco, N.: A matheuristic for the truck and trailer routing problem. Eur. J. Oper. Res. 230, 231–244 (2013)CrossRefMathSciNetGoogle Scholar
  16. 16.
    Calvo, R.W., Touati-Moungla, N.: A matheuristic for the dial-a-ride problem. In: Network Optimization. Lecture Notes Computer Science, vol. 6701, pp. 450–463 (2011)Google Scholar
  17. 17.
    Rodríguez-Martín, I., Salazar-González, J.J.: The multi-commodity one-to-one pickup-and-delivery traveling salesman problem: a matheuristic. In: Network Optimization. Lecture Notes Computer Science, vol. 6701, pp. 401–405 (2011)Google Scholar
  18. 18.
    Pillac, V., Guéret, C., Medaglia, A.: A parallel matheuristic for the technician routing and scheduling problem. Optim. Lett. (2012) (Available online )Google Scholar
  19. 19.
    Gendreau, M., Potvin, J.-Y.: Metaheuristics in combinatorial optimization. Ann. Oper. Res. 140(1), 189–213 (2005)CrossRefMATHMathSciNetGoogle Scholar
  20. 20.
    Yıldırım, U.M., Çatay, B.: A time-based pheromone approach for the ant system. Optim. Lett. 6, 1081–1099 (2012)CrossRefMATHMathSciNetGoogle Scholar
  21. 21.
    Blosch, J.: Effective Java, 2nd edn. Addison-Wesley, Boston (2008)Google Scholar
  22. 22.
    Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35, 254–265 (1987)CrossRefMATHMathSciNetGoogle Scholar
  23. 23.
    Russell, R.A., Chiang, W-C.: Scatter search for the vehicle routing problem with time windows. Eur. J. Oper. Res. 169, 606–622 (2006)Google Scholar
  24. 24.
    Cordeau, J.-F., Laporte, G., Mercier, A.: A unified tabu search heuristic for vehicle routing problems with time windows. J. Oper. Res. Soc. 52, 928–936 (2001)CrossRefMATHGoogle Scholar
  25. 25.
    Jung, S., Moon, B-R.: A hybrid genetic algorithm for the vehicle routing problem with time windows. In: Proceedings of the 2002 Genetic and Evolutionary Computation Conference, pp. 1309–1316. GECCO 2002, New York (2002)Google Scholar
  26. 26.
    Oliveira, H.C.B., Vasconcelos, G.C.: A hybrid search method for the vehicle routing problem with time windows. Ann. Oper. Res. 180, 125–144 (2008)Google Scholar
  27. 27.
    Ombuki, B., Ross, B.J., Hanshar, F.: Multi-objective genetic algorithms for vehicle routing problem with time windows. Appl. Intell. 24, 17–30 (2006)CrossRefGoogle Scholar
  28. 28.
    Rochat, Y., Taillard, E.D.: Probabilistic diversification and intensification in local search for vehicle routing. J. Heuristics 1, 147–167 (1995)CrossRefMATHGoogle Scholar
  29. 29.
    Shaw, P.: Using constraint programming and local search methods to solve vehicle routing problems. In: Principles and Practice of Constraint Programming (CP’98). Lecture Notes Computer Science, vol. 1520, pp. 417–431 (1998)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  1. 1.Faculty of Engineering and Natural SciencesSabanci UniversityIstanbulTurkey

Personalised recommendations