Skip to main content

A New Cooperative Search Strategy for Vehicle Routing Problem

  • Conference paper
Computational Collective Intelligence. Technologies and Applications (ICCCI 2012)

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

Included in the following conference series:

  • 1184 Accesses

Abstract

Cooperation as a problem-solving strategy is a widely used approach to solving complex hard optimization problems. It involves a set of highly autonomous programs (agents), each implementing a particular solution method, and a cooperation scheme combining these autonomous programs into a single problem-solving strategy. It is expected that such a collective of agents can produce better solutions than any individual members of such collective. The main goal of the paper is to propose a new population-based cooperative search approach for solving the Vehicle Routing Problem. It uses a set of search procedures, which attempt to improve solutions stored in a common, central memory. Access to a single common memory allows exploitation by one procedure solutions obtained by another procedure in order to guide the search through a new promising region of the search space, thus increasing chances for reaching the global optimum.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Similar content being viewed by others

References

  1. Barbucha, D., Czarnowski, I., JÄ™drzejowicz, P., Ratajczak-Ropel, E., Wierzbowska, I.: JABAT Middleware as a Tool for Solving Optimization Problems. In: Nguyen, N.T., Kowalczyk, R. (eds.) Transactions on CCI II. LNCS, vol. 6450, pp. 181–195. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  2. Barbucha, D.: Experimental Study of the Population Parameters Settings in Cooperative Multi-Agent System Solving Instances of the VRP. Submitted to LNCS Transactions on Computational Collective Intelligence (2012)

    Google Scholar 

  3. Blum, C., Roli, A.: Metaheuristics in Combinatorial Optimization: Overview and Conceptual Comparison. ACM Computing Surveys 35(3), 268–308 (2003)

    Article  Google Scholar 

  4. Crainic, T.G., Toulouse, M.: Explicit and Emergent Cooperation Schemes for Search Algorithms. In: Maniezzo, V., Battiti, R., Watson, J.-P. (eds.) LION 2007 II. LNCS, vol. 5313, pp. 95–109. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  5. Crainic, T.G., Toulouse, M.: Parallel Meta-heuristics. In: Gendreau, M., Potvin, J.-Y. (eds.) Handbook of Metaheuristics. International Series in Operations Research and Management Science, vol. 146, pp. 497–541. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

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

    MATH  Google Scholar 

  7. Golden, B.L., Raghavan, S., Wasil, E.A. (eds.): The Vehicle Routing Problem: Latest Advances and New Challenges. Operations Research Computer Science Interfaces Series, vol. 43. Springer (2008)

    Google Scholar 

  8. Laporte, G., Gendreau, M., Potvin, J., Semet, F.: Classical and modern heuristics for the vehicle routing problem. International Transactions in Operational Research 7, 285–300 (2000)

    Article  MathSciNet  Google Scholar 

  9. Le Bouthillier, A., Crainic, T.G.: A cooperative parallel meta-heuristic for the vehicle routing problem with time windows. Computers & Operations Research 32, 1685–1708 (2005)

    Article  MATH  Google Scholar 

  10. Lin, S.: Computer solutions of the traveling salesman problem. Bell Syst. Tech. J. 44, 2245–2269 (1965)

    MATH  Google Scholar 

  11. Masegosa, A.D., Pelta, D.A., Verdegay, J.L.: Cooperative Methods in Optimisation. Lambert Academic Publishing (2011)

    Google Scholar 

  12. Meignan, D., Creput, J.C., Koukam, A.: Coalition-based metaheuristic: a self-adaptive metaheuristic using reinforcement learning and mimetism. Journal of Heuristics 16(6), 859–879 (2010)

    Article  MATH  Google Scholar 

  13. Osman, I.H.: Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Annals of Operations Research 41, 421–451 (1993)

    Article  MATH  Google Scholar 

  14. Talbi, E.: A taxonomy of hybrid metaheuristics. Journal of Heuristics 8(5), 541–564 (2002)

    Article  Google Scholar 

  15. Toulouse, M., Crainic, T.G., Gendreau, M.: Communication issues in designing cooperative multi thread parallel searches. In: Osman, I.H., Kelly, J.P. (eds.) Meta-Heuristics: Theory & Applications, pp. 501–522. Kluwer, Norwell (1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Barbucha, D. (2012). A New Cooperative Search Strategy for Vehicle Routing Problem. In: Nguyen, NT., Hoang, K., JÈ©drzejowicz, P. (eds) Computational Collective Intelligence. Technologies and Applications. ICCCI 2012. Lecture Notes in Computer Science(), vol 7654. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34707-8_44

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-34707-8_44

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-34706-1

  • Online ISBN: 978-3-642-34707-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics