Skip to main content
SpringerLink
Log in
Book cover

KES International Symposium on Agent and Multi-Agent Systems: Technologies and Applications

KES-AMSTA 2011: Agent and Multi-Agent Systems: Technologies and Applications pp 476–485Cite as

An Agent-Based Guided Local Search for the Capacited Vehicle Routing Problem

  • Conference paper

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

Abstract

The main contribution of the paper is to propose and validate a new agent-based method of solving instances of the Capacited Vehicle Routing Problem (CVRP). The approach adopts a guided local search metaheuristic and combines it with an asynchronous team (A-Team) concept. A-Team assumes that a collection of software agents, each representing a particular problem solving method, cooperate to solve a problem by dynamically evolving a population of solutions. In suggested implementation each software agent carries out a guided local search. The paper contains the CVRP formulation, an overview of the dedicated multi-agent framework and a description of the proposed implementation for solving CVRP. The approach is validated experimentally and results of computational experiment are included in the final part of the paper.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Backer, B.D., Furnon, V., Prosser, P., Kilby, P., Shaw, P.: Solving vehicle routing problems using constraint programming and metaheuristics. Journal of Heuristics 6(4), 501–523 (2000)

    Article  MATH  Google Scholar 

  2. Barbucha, D., Jędrzejowicz, P.: Agent-Based Approach to the Dynamic Vehicle Routing Problem. In: Demazeau, Y., Pavon, J., Corchado, J.M., Bajo, J. (eds.) 7th Int. Conf. on Practical Applications of Agents and Multi-Agent Systems, Advances in Intelligent and Soft Computing, vol. 55, pp. 169–178. Springer, Berlin (2009)

    Google Scholar 

  3. Barbucha, D.: Cooperative Solution to the Vehicle Routing Problem. In: Jędrzejowicz, P., Nguyen, N.T., Howlet, R.J., Jain, L.C. (eds.) KES-AMSTA 2010. LNCS, vol. 6071, pp. 180–189. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  4. Berger, J., Barkaoui, M.: A new hybrid genetic algorithm for the capacitated vehicle routing problem. Journal of the Operational Research Society 54, 1254–1262 (2003)

    Article  MATH  Google Scholar 

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

    MATH  Google Scholar 

  6. 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 

  7. Fisher, M.L., Jaikumar, R.: A generalized assignment heuristic for vehicle routing. Networks 11, 109–124 (1981)

    Article  MathSciNet  Google Scholar 

  8. Gendreau, M., Hertz, A., Laporte, G.: A tabu search heuristic for the vehicle routing problem. Management Science 40, 1276–1290 (1994)

    Article  MATH  Google Scholar 

  9. Gillett, B.E., Miller, L.R.: A heuristic algorithm for the vehicle dispatch problem. Operations Research 22, 240–349 (1974)

    Article  MATH  Google Scholar 

  10. 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, Heidelberg (2008)

    MATH  Google Scholar 

  11. Jennings, N.R., Sycara, K., Wooldridge, M.: A Roadmap of Agent Research and Development. Autonomous Agents and Multi-Agent Systems 1, 7–38 (1998)

    Article  Google Scholar 

  12. Kilby, P., Prosser, P., Shaw, P.: Guided local search for the vehicle routing problem. In: Voss, S., Martello, S., Osman, I.H., Roucairol, C. (eds.) Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, pp. 473–486. Kluwer Academic Publishers, Dordrecht (1999)

    Chapter  Google Scholar 

  13. Kinderwater, G.A.P., Savelsbergh, M.W.P.: Vehicle routing: handling edge exchanges. In: Aarts, E.H.L., Lenstra, J.K. (eds.) Local Search in Combinatorial Optimization, pp. 337–360. Wiley, Chichester (1997)

    Google Scholar 

  14. 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 

  15. Mester, D., Bräysy, O.: Active-guided evolution strategies for large-scale capacitated vehicle routing problems. Computers and Operations Research 34, 2964–2975 (2007)

    Article  MATH  Google Scholar 

  16. Prins, C.: A simple and effective evolutionary algorithm for the vehicle routing problem. Computers and Operations Research 31, 1985–2002 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  17. Reimann, M., Doerner, K., Hartl, R.F.: D-ants: savings based ants divide and conquer the vehicle routing problem. Computers and Operations Research 31, 563–591 (2004)

    Article  MATH  Google Scholar 

  18. Rochat, Y., Taillard, E.D.: Probabilistic Diversification and Intensification in Local Search for Vehicle Routing. Journal of Heuristics 1(1), 147–167 (1995)

    Article  MATH  Google Scholar 

  19. Taillard, E.D.: Parallel iterative search methods for vehicle routing problems. Networks 23, 661–673 (1993)

    Article  MATH  Google Scholar 

  20. Talukdar, S., Baeretzen, L., Gove, A., de Souza, P.: Asynchronous teams: Cooperation schemes for autonomous agents. Journal of Heuristics 4, 295–321 (1998)

    Article  MATH  Google Scholar 

  21. Thangiah, S.R., Shmygelska, O., Mennell, W.: An agent architecture for vehicle routing problem. In: Proc. of the ACM Symposium on Applied Computing (SAC 2001), Las Vegas, pp. 517-521 (2001)

    Google Scholar 

  22. Thompson, P.M., Psaraftis, H.N.: Cyclic transfer algorithms for the multivehicle routing and scheduling problems. Operations Research 41, 935–946 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  23. Toth, P., Vigo, D.: The Granular Tabu Search and Its Application to the Vehicle-Routing Problem. INFORMS Journal on Computing 15(4), 333–346 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  24. Van Breedam, A.: An analysis of the behavior of heuristics for the vehicle routing problem for a selection of problems with vehicle-related, customer-related, and time-related constraints. Ph.D. dissertation, University of Antwerp (1994)

    Google Scholar 

  25. Voudouris, C., Tsang, E.: Partial Constraint Satisfaction Problems and Guided Local Search. In: Proc. of 2nd Int. Conf. on Practical Application of Constraint Technology (PACT 1996), London, pp. 337–356 (1996)

    Google Scholar 

  26. Voudouris, C., Tsang, E.: Guided local search and its application to the traveling salesman problem. European Journal of Operational Research 113, 469–499 (1999)

    Article  MATH  Google Scholar 

  27. Xu, J., Kelly, J.P.: A network flow-based tabu search heuristic for the vehicle routing problem. Transportation Science 30, 379–393 (1996)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information Systems, Gdynia Maritime University, Morska 83, 81-225, Gdynia, Poland

    Dariusz Barbucha

Authors
  1. Dariusz Barbucha
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Manchester Metropolitan University, M1 5GD, Manchester, UK

    James O’Shea  & Keeley Crockett  & 

  2. Wroclaw University of Technology, Wyb. Wyspianskiego 27, 50-370, Wroclaw, Poland

    Ngoc Thanh Nguyen

  3. University of Bournemouth, BH12 5BB, Poole, UK

    Robert J. Howlett

  4. University of South Australia, 5095, Mawson Lakes, SA, Australia

    Lakhmi C. Jain

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Barbucha, D. (2011). An Agent-Based Guided Local Search for the Capacited Vehicle Routing Problem. In: O’Shea, J., Nguyen, N.T., Crockett, K., Howlett, R.J., Jain, L.C. (eds) Agent and Multi-Agent Systems: Technologies and Applications. KES-AMSTA 2011. Lecture Notes in Computer Science(), vol 6682. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22000-5_49

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22000-5_49

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-642-22000-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation