Skip to main content
Springer Nature Link
Log in

Multiple Variable Neighborhood Search Enriched with ILP Techniques for the Periodic Vehicle Routing Problem with Time Windows

  • Conference paper
Hybrid Metaheuristics (HM 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5818))

Included in the following conference series:

Abstract

In this work we extend a VNS for the periodic vehicle routing problem with time windows (PVRPTW) to a multiple VNS (mVNS) where several VNS instances are applied cooperatively in an intertwined way. The mVNS adaptively allocates VNS instances to promising areas of the search space. Further, an intertwined collaborative cooperation with a generic ILP solver applied on a suitable set covering ILP formulation with this mVNS is proposed, where the mVNS provides the exact method with feasible routes of the actual best solutions, and the ILP solver takes a global view and seeks to determine better feasible route combinations. Experimental results were conducted on newly derived instances and show the advantage of the mVNS as well as of the hybrid approach. The latter yields for almost all instances a statistically significant improvement over solely applying the VNS in a standard way, often requiring less runtime, too.

This work is supported by the Austrian Science Fund (FWF) under contract number P20342-N13.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Cordeau, J.F., Laporte, G., Mercier, A.: A unified tabu search heuristic for vehicle routing problems with time windows. Journal of the Operational Research Society 52, 928–936 (2001)

    Article  MATH  Google Scholar 

  2. Pirkwieser, S., Raidl, G.R.: A variable neighborhood search for the periodic vehicle routing problem with time windows. In: Prodhon, C., et al. (eds.) Proceedings of the 9th EU/MEeting on Metaheuristics for Logistics and Vehicle Routing, Troyes, France (2008)

    Google Scholar 

  3. Polacek, M., Hartl, R.F., Doerner, K., Reimann, M.: A variable neighborhood search for the multi depot vehicle routing problem with time windows. Journal of Heuristics 10, 613–627 (2004)

    Article  Google Scholar 

  4. Hemmelmayr, V.C., Doerner, K.F., Hartl, R.F.: A variable neighborhood search heuristic for periodic routing problems. European Journal of Operational Research 195(3), 791–802 (2009)

    Article  MATH  Google Scholar 

  5. Pirkwieser, S., Raidl, G.R.: Boosting a variable neighborhood search for the periodic vehicle routing problem with time windows by ILP techniques. In: Caserta, M., Voß, S. (eds.) Proceedings of the 8th Metaheuristic International Conference (MIC 2009), Hamburg, Germany (2009)

    Google Scholar 

  6. Francis, P., Smilowitz, K., Tzur, M.: The period vehicle routing problem with service choice. Transportation Science 40(4), 439–454 (2006)

    Article  Google Scholar 

  7. Mourgaya, M., Vanderbeck, F.: Column generation based heuristic for tactical planning in multi-period vehicle routing. European Journal of Operational Research 183(3), 1028–1041 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  8. Francis, P.M., Smilowitz, K.R., Tzur, M.: The period vehicle routing problem and its extensions. In: Golden, B., et al. (eds.) The Vehicle Routing Problem: Latest Advances and New Challenges, pp. 73–102. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  9. Schmid, V., Doerner, K.F., Hartl, R.F., Savelsbergh, M.W.P., Stoecher, W.: A hybrid solution approach for ready-mixed concrete delivery. Transportation Science 43(1), 70–85 (2009)

    Article  Google Scholar 

  10. Danna, E., Le Pape, C.: Branch-and-price heuristics: A case study on the vehicle routing problem with time windows. In: Desaulniers, G., et al. (eds.) Column Generation, pp. 99–129. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  11. Raidl, G.R., Puchinger, J.: Combining (integer) linear programming techniques and metaheuristics for combinatorial optimization. In: Blum, C., et al. (eds.) Hybrid Metaheuristics: An Emerging Approach to Optimization. Studies in Computational Intelligence, vol. 114, pp. 31–62. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  12. García-López, F., Melián-Batista, B., Moreno-Pérez, J.A., Moreno-Vega, J.M.: The parallel variable neighborhood search for the p-median problem. Journal of Heuristics 8(3), 375–388 (2002)

    Article  MATH  Google Scholar 

  13. Moreno-Pérez, J.A., Hansen, P., Mladenović, N.: Parallel variable neighborhood search. In: Alba, E. (ed.) Parallel Metaheuristics: A New Class of Algorithms, pp. 247–266. John Wiley & Sons, NJ (2005)

    Chapter  Google Scholar 

  14. Hansen, P., Mladenović, N.: Variable neighborhood search. In: Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics, pp. 145–184. Kluwer Academic Publishers, Boston (2003)

    Chapter  Google Scholar 

  15. Potvin, J.Y., Rousseau, J.M.: An exchange heuristic for routeing problems with time windows. Journal of the Operational Research Society 46, 1433–1446 (1995)

    Article  MATH  Google Scholar 

  16. Kirkpatrick, S., Gelatt Jr., C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671–680 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  17. Desrosiers, J., Lübbecke, M.E.: A primer in column generation. In: Desaulniers, G., et al. (eds.) Column Generation, pp. 1–32. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Graphics and Algorithms, Vienna University of Technology, Vienna, Austria

    Sandro Pirkwieser & Günther R. Raidl

Authors
  1. Sandro Pirkwieser
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Günther R. Raidl
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Universitat Politècnica de Catalunya, Omega 213 Campus Nord, Jordi Girona 1-3, 08034, Barcelona, Spain

    María J. Blesa

  2. Universitat Politècnica de Catalunya, Omega 112 Campus Nord, Jordi Girona 1-3, 08034, Barcelona, Spain

    Christian Blum

  3. DIEGM, Università di Udine, via delle Scienze 208, 33100, Udine, Italy

    Luca Di Gaspero

  4. DEIS, Università di Bologna, Sede di Cesena, Via Venezia 52, 47521, Cesena, Italy

    Andrea Roli

  5. IRIDIA CP 194/6, Université Libre de Bruxelles, Avenue Franklin D. Roosevelt 50, 1050, Bruxelles, Belgium

    Michael Sampels

  6. DIEGM, University of Udine, via delle Scienze 208, 33100, Udine, Italy

    Andrea Schaerf

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pirkwieser, S., Raidl, G.R. (2009). 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) Hybrid Metaheuristics. HM 2009. Lecture Notes in Computer Science, vol 5818. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04918-7_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-04918-7_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-04917-0

  • Online ISBN: 978-3-642-04918-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics