A New Cooperative Search Strategy for Vehicle Routing Problem

  • Dariusz Barbucha
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7654)

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.

Keywords

cooperative search population-based methods multi-agent systems vehicle routing problem 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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)CrossRefGoogle Scholar
  2. 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. 3.
    Blum, C., Roli, A.: Metaheuristics in Combinatorial Optimization: Overview and Conceptual Comparison. ACM Computing Surveys 35(3), 268–308 (2003)CrossRefGoogle Scholar
  4. 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)CrossRefGoogle Scholar
  5. 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)CrossRefGoogle Scholar
  6. 6.
    Christofides, N., Mingozzi, A., Toth, P., Sandi, C. (eds.): Combinatorial optimization. John Wiley, Chichester (1979)MATHGoogle Scholar
  7. 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. 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)MathSciNetCrossRefGoogle Scholar
  9. 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)MATHCrossRefGoogle Scholar
  10. 10.
    Lin, S.: Computer solutions of the traveling salesman problem. Bell Syst. Tech. J. 44, 2245–2269 (1965)MATHGoogle Scholar
  11. 11.
    Masegosa, A.D., Pelta, D.A., Verdegay, J.L.: Cooperative Methods in Optimisation. Lambert Academic Publishing (2011)Google Scholar
  12. 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)MATHCrossRefGoogle Scholar
  13. 13.
    Osman, I.H.: Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Annals of Operations Research 41, 421–451 (1993)MATHCrossRefGoogle Scholar
  14. 14.
    Talbi, E.: A taxonomy of hybrid metaheuristics. Journal of Heuristics 8(5), 541–564 (2002)CrossRefGoogle Scholar
  15. 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

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Dariusz Barbucha
    • 1
  1. 1.Department of Information SystemsGdynia Maritime UniversityGdyniaPoland

Personalised recommendations