Experimental Analysis of Pheromone-Based Heuristic Column Generation Using irace

  • Florence Massen
  • Manuel López-Ibáñez
  • Thomas Stützle
  • Yves Deville
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7919)

Abstract

Pheromone-based heuristic column generation (ACO-HCG) is a hybrid algorithm that combines ant colony optimization and a MIP solver to tackle vehicle routing problems (VRP) with black-box feasibility. Traditionally, the experimental analysis of such a complex algorithm has been carried out manually by trial and error. Moreover, a full-factorial statistical analysis is infeasible due to the large number of parameters and the time required for each algorithm run. In this paper, we first automatically configure the algorithm parameters by using an automatic algorithm configuration tool. Then, we perform a basic sensitivity analysis of the tuned configuration in order to understand the significance of each parameter setting. In this way, we avoid wasting effort analyzing parameter settings that do not lead to a high-performing algorithm. Finally, we show that the tuned parameter settings improve the performance of ACO-HCG on the multi-pile VRP and the three-dimensional loading capacitated VRP.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Balaprakash, P., Birattari, M., Stützle, T.: Improvement strategies for the F-race algorithm: Sampling design and iterative refinement. In: Bartz-Beielstein, T., Blesa Aguilera, M.J., Blum, C., Naujoks, B., Roli, A., Rudolph, G., Sampels, M. (eds.) HM 2007. LNCS, vol. 4771, pp. 108–122. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  2. 2.
    Birattari, M.: Tuning Metaheuristics: A Machine Learning Perspective. SCI, vol. 197. Springer, Heidelberg (2009)Google Scholar
  3. 3.
    Bortfeldt, A.: A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints. Comp. & Op. Res. 39(9), 2248–2257 (2012)MathSciNetMATHCrossRefGoogle Scholar
  4. 4.
    Doerner, K.F., Fuellerer, G., Hartl, R.F., Gronalt, M., Iori, M.: Metaheuristics for the vehicle routing problem with loading constraints. Networks 49(4), 294–307 (2007)MathSciNetMATHCrossRefGoogle Scholar
  5. 5.
    Dorigo, M., Stützle, T.: Ant Colony Optimization. MIT Press (2004)Google Scholar
  6. 6.
    Fuellerer, G., Doerner, K.F., Hartl, R.F., Iori, M.: Metaheuristics for vehicle routing problems with three-dimensional loading constraints. EJOR 201(3), 751–759 (2010)MATHCrossRefGoogle Scholar
  7. 7.
    Gendreau, M., Iori, M., Laporte, G., Martello, S.: A tabu search algorithm for a routing and container loading problem. Trans. Sci. 40(3), 342–350 (2006)CrossRefGoogle Scholar
  8. 8.
    Hutter, F., Hoos, H.H., Leyton-Brown, K., Stützle, T.: ParamILS: an automatic algorithm configuration framework. Journal of Artificial Intelligence Research 36, 267–306 (2009)MATHGoogle Scholar
  9. 9.
    Iori, M., Martello, S.: Routing problems with loading constraints. TOP 18, 4–27 (2010)MathSciNetMATHCrossRefGoogle Scholar
  10. 10.
    López-Ibáñez, M., Dubois-Lacoste, J., Stützle, T., Birattari, M.: The irace package, iterated race for automatic algorithm configuration. Tech. Rep. TR/IRIDIA/2011-004, IRIDIA, Université Libre de Bruxelles, Belgium (2011)Google Scholar
  11. 11.
    Massen, F., Deville, Y., Van Hentenryck, P.: Pheromone-based heuristic column generation for vehicle routing problems with black box feasibility. In: Beldiceanu, N., Jussien, N., Pinson, É. (eds.) CPAIOR 2012. LNCS, vol. 7298, pp. 260–274. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  12. 12.
    Prescott-Gagnon, E., Desaulniers, G., Drexl, M., Rousseau, L.M.: European driver rules in vehicle routing with time windows. Trans. Sci. 44(4), 455–473 (2010)CrossRefGoogle Scholar
  13. 13.
    Reimann, M., Doerner, K., Hartl, R.F.: D-ants: Savings based ants divide and conquer the vehicle routing problem. Comp. & Op. Res. 31(4), 563–591 (2004)MATHCrossRefGoogle Scholar
  14. 14.
    Ren, J., Tian, Y., Sawaragi, T.: A relaxation method for the three-dimensional loading capacitated vehicle routing problem. In: 2011 IEEE/SICE International Symposium on System Integration (SII), pp. 750–755. IEEE (2011)Google Scholar
  15. 15.
    Ruan, Q., Zhang, Z., Miao, L., Shen, H.: A hybrid approach for the vehicle routing problem with three-dimensional loading constraints. Comp. & Op. Res. (2011)Google Scholar
  16. 16.
    Tarantilis, C., Zachariadis, E., Kiranoudis, C.: A hybrid metaheuristic algorithm for the integrated vehicle routing and three-dimensional container-loading problem. IEEE Transactions on Intelligent Transportation Systems 10(2), 255–271 (2009)CrossRefGoogle Scholar
  17. 17.
    Toth, P., Vigo, D. (eds.): The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications (2002)Google Scholar
  18. 18.
    Tricoire, F., Doerner, K.F., Hartl, R.F., Iori, M.: Heuristic and exact algorithms for the multi-pile vehicle routing problem. OR Spectrum 33(4), 931–959 (2011)MathSciNetMATHCrossRefGoogle Scholar
  19. 19.
    Benchmark instances for the 3L-CVRP, http://www.or.deis.unibo.it/research.html
  20. 20.
    Benchmark instances for the MPVRP, http://prolog.univie.ac.at/research/VRPandBPP/
  21. 21.
  22. 22.
    Zhu, W., Qin, H., Lim, A., Wang, L.: A two-stage tabu search algorithm with enhanced packing heuristics for the 3L-CVRP and M3L-CVRP. Comp. & Op. Res. 39(9), 2178–2195 (2012)MathSciNetMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Florence Massen
    • 1
  • Manuel López-Ibáñez
    • 2
  • Thomas Stützle
    • 2
  • Yves Deville
    • 1
  1. 1.ICTEAMUniversité catholique de LouvainBelgium
  2. 2.IRIDIAUniversité libre de BruxellesBelgium

Personalised recommendations