Skip to main content

Effective Stopping Rule for Population-Based Cooperative Search Approach to the Vehicle Routing Problem

  • Conference paper
  • First Online:
Intelligent Decision Technologies (IDT 2017)

Part of the book series: Smart Innovation, Systems and Technologies ((SIST,volume 39))

Included in the following conference series:

  • 1472 Accesses

Abstract

The main goal of the paper is to propose an effective stopping criterion based on diversity of the population implemented in cooperative search approach to the vehicle routing problem. The main idea is to control diversity of the population during the whole process of solving particular problem and to stop algorithm when the stagnation in the population is observed, i.e. diversity of the population does not significantly change during a given period of time. Computational experiment which has been carried out confirmed that using the proposed diversity-based stopping criterion may significantly reduce the computation time when compared to using traditional criterion where algorithm stops after a given period of time (or iterations), without significant deterioration of the quality of obtained results.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover 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

References

  1. Barbucha, D., Czarnowski, I., Jȩdrzejowicz, P., Ratajczak-Ropel, E., Wierzbowska, I.: e-JABAT—an implementation of the web-based a-team. In: Nguyen, N.T., Jain, L.C. (eds.) Intelligent Agents in the Evolution of Web and Applications. Studies in Computational Intelligence, vol. 167, pp. 57–86. Springer, Berlin/Heidelberg (2009)

    Google Scholar 

  2. Barbucha, D.: Experimental Investigation of impact of migration topologies on performance of cooperative approach to the vehicle routing problem. In: Nguyen, N.T. et al. (eds.) ACIIDS 2015, LNAI 9011, pp. 250–259. Springer, Berlin/Heidelberg (2015)

    Google Scholar 

  3. Blum, C., Roli, A.: Metaheuristics in combinatorial optimization: overview and conceptual comparison. ACM Comput. Surv. 35(3), 268–308 (2003)

    Article  Google Scholar 

  4. Boese, K., Kahng, A., Muddu, S.: A new adaptive multistart technique for combinatorial global optimization. Oper. Res. Lett. 16, 101–113 (1994)

    Google Scholar 

  5. Christofides, N., Mingozzi, A., Toth, P., Sandi, C. (eds.): Combinatorial Optimization. John Wiley, Chichester (1979)

    MATH  Google Scholar 

  6. Dorigo, M., Stutzle, T.: Ant Colony Optimization. MIT Press, Cambridge, MA (2004)

    Book  MATH  Google Scholar 

  7. Eglese, R.W.: Simulated annealing: a tool for operational research. Eur. J. Oper. Res. 46, 271–281 (1990)

    Google Scholar 

  8. Feo, T.A., Resende, M.G.C.: Greedy randomized adaptive search procedures. J. Glob. Optim. 6, 109–133 (1995)

    Google Scholar 

  9. Ferreira, C.: Gene Expression Programming: Mathematical Modeling by an Artificial Intelligence. Springer, Heidelberg (2006)

    Google Scholar 

  10. Glover, F., Laguna, M.: Tabu Search. Kluwer, Boston (1997)

    Book  MATH  Google Scholar 

  11. Glover, F., Laguna, M., Marti, R.: Fundamentals of scatter search and path relinking. Control Cybern. 39, 653–684 (2000)

    Google Scholar 

  12. Holland, J.H.: Adaptation in Natural and Artificial Systems. The University of Michigan Press, Ann Arbor (1975)

    Google Scholar 

  13. Jaccard, P.: Etude comparative de la distribution florale dans une portion des Alpes et des Jura. Bulletin del la Societe Vaudoise des Sciences Naturelles 37, 547–579 (1901)

    Google Scholar 

  14. Kennedy, J., Eberhart, R.C.: Particle swarm optimization. In: Proceedings of IEEE International Conference on Neural Networks, pp. 1942–1948. Piscataway, NJ (1995)

    Google Scholar 

  15. Laporte, G., Gendreau, M., Potvin, J., Semet, F.: Classical and modern heuristics for the vehicle routing problem. Int. Trans. Oper. Res. 7, 285–300 (2000)

    Article  MathSciNet  Google Scholar 

  16. Michalewicz, Z.: Genetic Algorithms + Data Structures = Evolution Programs. Springer, Berlin-Heidelberg-New York (1994)

    Book  MATH  Google Scholar 

  17. Talbi, E.G.: Metaheuristics: From Design to Implementation. Wiley, New York (2009)

    Google Scholar 

  18. Toulouse, M., Thulasiraman, K., Glover, F.: Multi-level cooperative search: a new paradigm for combinatorial optimization and an application to graph partitioning. In: Amestoy, P., et al. (eds.) Euro-Par99 Parallel Processing, LNCS, vol. 1685, pp. 533–542. Springer, Heidelberg (1999)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Dariusz Barbucha .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Barbucha, D. (2015). Effective Stopping Rule for Population-Based Cooperative Search Approach to the Vehicle Routing Problem. In: Neves-Silva, R., Jain, L., Howlett, R. (eds) Intelligent Decision Technologies. IDT 2017. Smart Innovation, Systems and Technologies, vol 39. Springer, Cham. https://doi.org/10.1007/978-3-319-19857-6_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-19857-6_6

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-19856-9

  • Online ISBN: 978-3-319-19857-6

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics