Skip to main content
SpringerLink
Log in

A Hybrid Particle Swarm Optimization Algorithm for the Open Vehicle Routing Problem

  • Conference paper
Swarm Intelligence (ANTS 2012)

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

Included in the following conference series:

Abstract

This paper introduces a new hybrid algorithmic nature inspired approach based on Particle Swarm Optimization, for successfully solving one of the most popular supply chain management problems, the Open Vehicle Routing Problem. The Open Vehicle Routing Problem (OVRP) is a variant of the classic vehicle routing problem in which the vehicles do not return in the depot after the service of the customers. The proposed algorithm for the solution of the Open Vehicle Routing Problem, the Hybrid Particle Swarm Optimization (HybPSO), combines a Particle Swarm Optimization (PSO) Algorithm, the Variable Neighborhood Search (VNS) Strategy and a Path Relinking (PR) Strategy. The algorithm is suitable for solving large-scale open vehicle routing problems within short computational time. Two sets of benchmark instances are used in order to test the proposed algorithm.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Brandao, J.: A tabu search algorithm for the open vehicle routing problem. European Journal of Operational Research 157(3), 552–564 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  2. Christofides, N., Mingozzi, A., Toth, P.: The vehicle routing problem. In: Christofides, N., Mingozzi, A., Toth, P., Sandi, C. (eds.) Combinatorial Optimization. Wiley, Chichester (1979)

    Google Scholar 

  3. Clerc, M., Kennedy, J.: The particle swarm: explosion, stability and convergence in a multi-dimensional complex space. IEEE Transactions on Evolutionary Computation 6, 58–73 (2002)

    Article  Google Scholar 

  4. Fleszar, K., Osman, I.H., Hindi, K.S.: A variable neighbourhood search algorithm for the open vehicle routing problem. European Journal of Operational Research 195, 803–809 (2009)

    Article  MATH  Google Scholar 

  5. Fu, Z., Eglese, R., Li, L.: A new tabu search heuristic for the open vehicle routing problem. Journal of the Operational Research Society 56(2), 267–274 (2005)

    Article  MATH  Google Scholar 

  6. Gendreau, M., Laporte, G., Potvin, J.-Y.: Vehicle routing: modern heuristics. In: Aarts, E.H.L., Lenstra, J.K. (eds.) Local Search in Combinatorial Optimization, pp. 311–336. Wiley, Chichester (1997)

    Google Scholar 

  7. Glover, F., Laguna, M., Marti, R.: Scatter search and path relinking: Advances and applications. In: Glover, F., Kochenberger, G.A. (eds.) Handbook of Metaheuristics, pp. 1–36. Kluwer Academic Publishers, Boston (2003)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  9. Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceedings of 1995 IEEE International Conference on Neural Networks, vol. 4, pp. 1942–1948 (1995)

    Google Scholar 

  10. Li, F., Golden, B., Wasil, E.: The open vehicle routing problem: Algorithms, large-scale test problems, and computational results. Computers and Operations Research 34, 2918–2930 (2007)

    Article  MATH  Google Scholar 

  11. Lichtblau, D.: Discrete optimization using Mathematica. In: Callaos, N., Ebisuzaki, T., Starr, B., Abe, J.M., Lichtblau, D. (eds.) World Multi-Conference on Systemics, Cybernetics and Informatics (SCI 2002). International Institute of Informatics and Systemics, vol. 16, pp. 169–174 (2002)

    Google Scholar 

  12. Pisinger, D., Ropke, S.: A general heuristic for vehicle routing problems. Computers and Operations Research 34, 2403–2435 (2006)

    Article  MathSciNet  Google Scholar 

  13. Repoussis, P.P., Tarantilis, C.D., Braysy, O., Ioannou, G.: A hybrid evolution strategy for the open vehicle routing problem. Computers and Operations Research 37, 443–455 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  14. Sariklis, D., Powell, S.: A heuristic method for the open vehicle routing problem. The Journal of the Operational Research Society 51(5), 564–573 (2000)

    MATH  Google Scholar 

  15. Schrage, L.: Formulation and structure of more complex realistic routing and scheduling problem. Networks 11, 229–232 (1981)

    Article  Google Scholar 

  16. Tarantilis, C., Diakoulaki, D., Kiranoudis, C.: Combination of geographical information system and efficient routing algorithms for real life distribution operations. European Journal of Operational Research 152(2), 437–453 (2004)

    Article  MATH  Google Scholar 

  17. Tarantilis, C., Ioannou, G., Kiranoudis, C., Prastacos, G.: Solving the open vehicle routing problem via a single parameter metaheuristic algorithm. Journal of the Operational Research Society 56, 588–596 (2005)

    Article  MATH  Google Scholar 

  18. Zachariadis, E.E., Kiranoudis, C.T.: An open vehicle routing problem metaheuristic for examining wide solution neighborhoods. Computers and Operations Research 37, 712–723 (2010)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Decision Support Systems Laboratory, Department of Production Engineering and Management, Technical University of Crete, Chania, Greece

    Yannis Marinakis

  2. Industrial Systems Control Laboratory, Department of Production Engineering and Management, Technical University of Crete, Chania, Greece

    Magdalene Marinaki

Authors
  1. Yannis Marinakis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Magdalene Marinaki
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. IRIDIA, Université Libre de Bruxelles, CoDE, Av. F. Roosevelt 50, CP 194/6, 1050, Brussels, Belgium

    Marco Dorigo , Mauro Birattari  & Thomas Stützle ,  & 

  2. ALBCOM, Department Llenguatges i Sistemes Informatics, Universitat Politecnica de Catalunya, Jordi Girona 1-3, Omega 112 Campus Nord, 08034, Barcelona, Spain

    Christian Blum

  3. Instituto de Telecomunicações & Instituto Universitário de Lisboa (ISCTE-IUL), Av. das Foras Armadas, 1649-026, Lisboa, Portugal

    Anders Lyhne Christensen

  4. Department of Computer Science, University of Pretoria, 0002, Pretoria, South Africa

    Andries P. Engelbrecht

  5. Department of Automatic Control and Systems Engineering, The University of Sheffield, Mappin Street, S1 3JD, Sheffield, UK

    Roderich Groß

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Marinakis, Y., Marinaki, M. (2012). A Hybrid Particle Swarm Optimization Algorithm for the Open Vehicle Routing Problem. In: Dorigo, M., et al. Swarm Intelligence. ANTS 2012. Lecture Notes in Computer Science, vol 7461. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32650-9_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-32650-9_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-32649-3

  • Online ISBN: 978-3-642-32650-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation