Skip to main content
SpringerLink
Log in

A Variable Neighborhood Search Approach for Solving the Generalized Vehicle Routing Problem

  • Conference paper
Hybrid Artificial Intelligence Systems (HAIS 2014)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 8480))

Included in the following conference series:

Abstract

Variable Neighborhood Search (VNS) is quite a recent metaheuristic used for solving optimization problems based on a systematic change of the neighborhoods structures within the search in order to avoid local optima. In this paper, we propose a VNS based heuristic for solving the generalized vehicle routing problem (GVRP) that uses different neighborhood structures which are adapted for the problem. Computational results for an often used collection of benchmark instances show that our proposed heuristic delivered competitive results compared to the existing state-of-the-art algorithms for solving the GVRP.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Baldacci, R., Bartolini, E., Laporte, G.: Some applications of the generalized vehicle routing problem. J. of the Operational Research Society 61(7), 1072–1077 (2010)

    Article  MATH  Google Scholar 

  2. Bektas, T., Erdogan, G., Ropke, S.: Formulations and Branch-and-Cut Algorithms for the Generalized Vehicle Routing Problem. Transportation Science 45(3), 299–316 (2011)

    Article  Google Scholar 

  3. Clarke, G., Wright, J.W.: Scheduling of Vehicles from a Central Depot to a Number of Delivery Points. Operations Research 12, 568–581 (1964)

    Article  Google Scholar 

  4. Fischetti, M., Salazar, J.J., Toth, P.: A branch-and-cut algorithm for the symmetric generalized traveling salesman problem. Oper. Res. 45(3), 378–394 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  5. Ghiani, G., Improta, G.: An efficient transformation of the generalized vehicle routing problem. European Journal of Operational Research 122(1), 11–17 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  6. Hansen, P., Mladenovic, N.: Variable neighborhood search: Principles and applications. European Journal of Operational Research 130(3), 449–467 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  7. Mladenovic, N., Hansen, P.: Variable neighborhood search. Computers & Operations Research 24(11), 1097–1100 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  8. Moccia, L., Cordeau, J.-F., Laporte, G.: An incremental tabu search heuristic for the generalized vehicle routing problem with time windows. Journal of the Operational Research Society 63, 232–244 (2012)

    Article  Google Scholar 

  9. Or, I.: Traveling Salesman-Type Combinatorial Problems and Their Relation to the Logistics of Regional Blood Banking. Ph.D. Thesis (1976)

    Google Scholar 

  10. Pop, P.C.: Generalized Network Design Problems, Modelling and Optimization. De Gruyter, Germany (2012)

    Google Scholar 

  11. Pop, P.C., Pintea, C., Zelina, I., Dumitrescu, D.: Solving the Generalized Vehicle Routing Problem with an ACS-based Algorithm. American Institute of Physics 1117, 157–162 (2009)

    Google Scholar 

  12. Pop, P.C., Matei, O., Pop Sitar, C., Chira, C.: A genetic algorithm for solving the generalized vehicle routing problem. In: Corchado, E., Graña Romay, M., Manhaes Savio, A. (eds.) HAIS 2010, Part II. LNCS (LNAI), vol. 6077, pp. 119–126. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  13. Pop, P.C., Pop Sitar, C.: A new efficient transformation of the generalized vehicle routing problem into the classical vehicle routing problem. Yugoslav Journal of Operations Research 21(2), 187–198 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  14. Pop, P.C., Kara, I., Horvat Marc, A.: New Mathematical Models of the Generalized Vehicle Routing Problem and Extensions. Applied Mathematical Modelling 36(1), 97–107 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  15. Pop, P.C., Matei, O., Pop Sitar, C.: An improved hybrid algorithm for solving the generalized vehicle routing problem. Neurocomputing 109, 76–83 (2013)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Computer Science, Technical University of Cluj-Napoca, North University Center of Baia Mare, Romania

    Petrică C. Pop & Andrei Horvat Marc

  2. Indeco Soft, Baia Mare, Romania

    Levente Fuksz

Authors
  1. Petrică C. Pop
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Levente Fuksz
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Andrei Horvat Marc
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Electrical and Computer Engineering, University of Cyprus, 75 Kallipoleos Avenue, 1678, Nicosia, Cyprus

    Marios Polycarpou

  2. Department of Computer Science, University of Sao Paulo at Sao Carlos, Sao Carlos, SP, Brazil

    André C. P. L. F. de Carvalho

  3. Department of Electronic Engineering, National Kaohsiung University of Applied Sciences, No. 415, Chien Kung Road, 80778, Kaohsiung, Taiwan

    Jeng-Shyang Pan

  4. Wroclaw University of Technology, Wybrzeze Wyspianskiego 27, 50-370, Wroclaw, Poland

    Michał Woźniak

  5. University of Salamanca, Plaza de la Merced S/N, 37008 Salamanca, Spain and University of A Coruna, Escuela Universitaria Politecnica, Departamento de Enxeñeria Industrial, A Coruna, Spain

    Héctor Quintian

  6. University of Salamanca, Plaza de la Merced S/N, 37008, Salamanca, Spain

    Emilio Corchado

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Pop, P.C., Fuksz, L., Marc, A.H. (2014). A Variable Neighborhood Search Approach for Solving the Generalized Vehicle Routing Problem. In: Polycarpou, M., de Carvalho, A.C.P.L.F., Pan, JS., Woźniak, M., Quintian, H., Corchado, E. (eds) Hybrid Artificial Intelligence Systems. HAIS 2014. Lecture Notes in Computer Science(), vol 8480. Springer, Cham. https://doi.org/10.1007/978-3-319-07617-1_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-07617-1_2

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-07616-4

  • Online ISBN: 978-3-319-07617-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation