Agent-Based Approach to the Dynamic Vehicle Routing Problem

  • Dariusz Barbucha
  • Piotr Jȩdrzejowicz
Part of the Advances in Intelligent and Soft Computing book series (AINSC, volume 55)


The term dynamic transportation problems refers to a wide range of problems where the required information is not given a priori to the decision maker but is revealed concurrently with the decision-making process. Among the most important problems belonging to this group are routing problems, which involve dynamic decision making with respect to vehicle routing in response to the flow of customer demands. The goal of such routing is to provide the required transportation with minimal service cost subject to various constraints. The paper proposes an approach to the dynamic vehicle routing problem based on multi-agent paradigm.


Dynamic Vehicle Mean Relative Error Customer Request Current Route Static Request 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Barbucha, D., Czarnowski, I., Jȩdrzejowicz, P., Ratajczak, E., Wierzbowska, I.: An Implementation of the JADE-based A-Team Environment. International Transactions on Systems Science and Applications 3(4), 319–328 (2008)Google Scholar
  2. 2.
    Burckert, H.J., Fischer, K., Vierke, G.: Holonic Transport Scheduling with TeleTruck. Journal of Applied Artificial Intelligence 14, 697–725 (2000)CrossRefGoogle Scholar
  3. 3.
    Gillett, B.E., Miller, L.R.: A heuristic algorithm for the vehicle dispatch problem. Operations Research 22, 240–349 (1974)CrossRefGoogle Scholar
  4. 4.
    van Hentenryck, P.: Online Stochastic Combinatorial Optimization. MIT Press, Cambridge (2006)Google Scholar
  5. 5.
    Kozlak, J., Creput, J.C., Hilaire, V., Koukam, A.: Multi-agent environment for dynamic transport planning and scheduling. In: Bubak, M., van Albada, G.D., Sloot, P.M.A., Dongarra, J. (eds.) ICCS 2004. LNCS, vol. 3038, pp. 638–645. Springer, Heidelberg (2004)Google Scholar
  6. 6.
    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)CrossRefMathSciNetGoogle Scholar
  7. 7.
    Larsen, A.: The on-line vehicle routing problem. Ph.D. Thesis, Institute of Mathematical Modelling, Technical University of Denmark (2001)Google Scholar
  8. 8.
    Lund, K., Madsen, O.B.G., Rygaard, J.M.: Vehicle routing problems with varying degrees of dynamism. Technical report, Institute of Mathematical Modelling, Technical University of Denmark (1996)Google Scholar
  9. 9.
    Smith, R.G.: The Contract Net Protocol: High Level Communication and Control in a Distributed Problem Solver. IEEE Transactions on Computers 29(12), 1104–1113 (1980)CrossRefGoogle Scholar
  10. 10.
    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
  11. 11.

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Dariusz Barbucha
    • 1
  • Piotr Jȩdrzejowicz
    • 1
  1. 1.Dept. of Information SystemsGdynia Maritime UniversityGdyniaPoland

Personalised recommendations