An Improved Agent-Based Approach to the Dynamic Vehicle Routing Problem

  • Dariusz BarbuchaEmail author
Conference paper
Part of the Smart Innovation, Systems and Technologies book series (SIST, volume 56)


The paper proposes a multi-agent approach to the Dynamic Vehicle Routing Problem, where the process of solving instances of the problem is performed by a set of software agents with different abilities. The agents are responsible for generating new requests, managing a set of requests, allocating them to the available vehicles, and monitoring the behavior of the system. The main steps of the algorithm implemented in the system include dispatching the static and dynamic requests to the available vehicles. In order to increase the efficiency of these processes, a request buffering strategy has been implemented. Computational experiment confirmed its positive impact on the results obtained by the proposed approach.


Dynamic vehicle routing problem Multi-agent systems Buffering strategy 


  1. 1.
    Barbucha, D., Jȩdrzejowicz, P.: Multi-agent platform for solving the dynamic vehicle routing problem. In: Proceedings of the 11th International IEEE Conference on Intelligent Transportation Systems (ITSC 2008), pp. 517–522. IEEE Press, New York (2008)Google Scholar
  2. 2.
    Barbucha, D.: A multi-agent approach to the dynamic vehicle routing problem with time windows. In: Badica, C., Nguyen, N.T., Brezovan, M. (eds.) Computational Collective Intelligence. Technologies and Applications—5th International Conference, ICCCI 2013. LNCS, vol. 8083, pp. 467–476. Springer. Berlin (2013)Google Scholar
  3. 3.
    Branchini, R.M., Armentano, A.V., Lokketangen, A.: Adaptive granular local search heuristic for a dynamic vehicle routing problem. Comput. Oper. Res. 36(11), 2955–2968 (2009)CrossRefzbMATHGoogle Scholar
  4. 4.
    Christofides, N., Mingozzi, A., Toth, P., Sandi, C. (eds.): Combinatorial Optimization. John Wiley, Chichester (1979)zbMATHGoogle Scholar
  5. 5.
    Gendreau, M., Guertin, F., Potvin, J.-Y., Taillard, E.: Parallel Tabu search for real-time vehicle routing and dispatching. Transp. Sci. 33(4), 381–390 (1999)CrossRefzbMATHGoogle Scholar
  6. 6.
    Hanshar, F.T., Ombuki-Berman, B.M.: Dynamic vehicle routing using genetic algorithms. Appl. Intell. 27, 89–99 (2007)CrossRefzbMATHGoogle 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.
    Mitrovic-Minic, S., Laporte, G.: Waiting strategies for the dynamic pickup and delivery problem with time windows. Transp. Res. Part B 38, 635–655 (2004)Google Scholar
  10. 10.
    Mitrovic-Minic, S., Krishnamurti, R., Laporte, G.: Double-horizon based heuristics for the dynamic pickup and delivery problem with time windows. Transp. Res. Part B 38, 669-685 (2004)Google Scholar
  11. 11.
    Montemanni, R., Gambardella, L.M., Rizzoli, A.E., Donati, A.V.: A new algorithm for a dynamic vehicle routing problem based on ant colony system. J. Comb. Optim. 10, 327–343 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Pillac, V., Gendreau, M.: Guret, C., Medaglia, A.L.: A review of dynamic vehicle routing problems. Eur. J. Oper. Res. 225, 1–11 (2013)Google Scholar
  13. 13.
    Psaraftis, H.: A dynamic-programming solution to the single vehicle many-tomany immediate request dial-a-ride problem. Transp. Sci. 14(2), 130–154 (1980)Google Scholar
  14. 14.
    Pureza, V., Laporte, G.: Waiting and buffering strategies for the dynamic pickup and delivery problem with time windows. INFOR 46(3), 165–175 (2008)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  1. 1.Department of Information SystemsGdynia Maritime UniversityGdyniaPoland

Personalised recommendations