The Art of Negotiation: Developing Efficient Agent-Based Algorithms for Solving Vehicle Routing Problem with Time Windows

  • Petr Kalina
  • Jiří Vokřínek
  • Vladimír Mařík
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8062)

Abstract

We present an ongoing effort in developing efficient agent-based algorithms for solving the vehicle routing problem with time windows. An abstract algorithm based on a generic agent decomposition of the problem is introduced featuring a clear separation between the local planning performed by the individual vehicles and the global coordination achieved by negotiation. The semantics of the underlying negotiation process is discussed as well as the alternative local planning strategies used by the individual vehicles. Finally a parallel version of the algorithm is presented based on efficient search diversification and intensification strategies. The presented effort is relevant namely for (i) yielding results significantly improving on all previous agent-based studies, (ii) the inclusion of relevant widely-used benchmarks missing from these studies and (iii) the breadth and depth of the provided evidence and analysis including relevant comparison to the state-of-the-art centralized solvers.

Keywords

multi-agent systems transportation logistics optimization 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bachem, A., Hochstattler, W., Malich, M.: The simulated trading heuristic for solving vehicle routing problems. Discrete Applied Mathematics 65(1-3), 47–72 (1996); First International Colloquium on Graphs and OptimizationGoogle Scholar
  2. 2.
    Bräysy, O., Gendreau, M.: Vehicle routing problem with time windows, part I route construction and local search algorithms. Transportation Science 39(1), 104–118 (2005)CrossRefGoogle Scholar
  3. 3.
    Bräysy, O., Gendreau, M.: Vehicle routing problem with time windows, part II metaheuristics. Transportation Science 39(1), 119–139 (2005)CrossRefGoogle Scholar
  4. 4.
    Dan, Z., Cai, L., Zheng, L.: Improved multi-agent system for the vehicle routing problem with time windows. Tsinghua Science Technology 14(3), 407–412 (2009)CrossRefGoogle Scholar
  5. 5.
    Fischer, K., Müller, J.P., Pischel, M.: Cooperative transportation scheduling: an application domain for dai. Journal of Applied Artificial Intelligence 10, 1–33 (1995)CrossRefGoogle Scholar
  6. 6.
    Homberger, J., Gehring, H.: A two-phase hybrid metaheuristic for the vehicle routing problem with time windows. European Journal of Operational Research 162(1), 220–238 (2005)MATHCrossRefGoogle Scholar
  7. 7.
    Kalina, P., Vokřínek, J.: Algorithm for vehicle routing problem with time windows based on agent negotiation. In: Proceedings of the 7th Workshop on Agents in Traffic and Transportation, AAMAS (2012)Google Scholar
  8. 8.
    Kalina, P., Vokřínek, J.: Improved agent based algorithm for vehicle routing problem with time windows using efficient search diversification and pruning strategy. In: Proceedings of the 3rd Workshop on Artificial Intelligence and Logistice (AILog) of the 2012 European Conference on Artificial Intelligence (ECAI), pp. 13–18 (2012)Google Scholar
  9. 9.
    Leong, H.W., Liu, M.: A multi-agent algorithm for vehicle routing problem with time window, pp. 106–111. ACM (2006)Google Scholar
  10. 10.
    Lim, A., Zhang, X.: A two-stage heuristic with ejection pools and generalized ejection chains for the vehicle routing problem with time windows. INFORMS Journal on Computing 19(3), 443–457 (2007)MathSciNetMATHCrossRefGoogle Scholar
  11. 11.
    Lu, Q., Dessouky, M.M.: A new insertion-based construction heuristic for solving the pickup and delivery problem with hard time windows. European Journal of Operational Research 175, 672–687 (2005)CrossRefGoogle Scholar
  12. 12.
    Nagata, Y., Bräysy, O.: A powerful route minimization heuristic for the vehicle routing problem with time windows. Operations Research Letters 37(5), 333–338 (2009)MathSciNetMATHCrossRefGoogle Scholar
  13. 13.
    Poon, P., Carter, J.: Genetic algorithm crossover operators for ordering applications. Computers and Operations Research 22(1), 135–147 (1995)MATHCrossRefGoogle Scholar
  14. 14.
    Ropke, S.: Heuristic and exact algorithms for vehicle routing problems, PHD Thesis, Technical University of Denmark (2005)Google Scholar
  15. 15.
    Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations Research 35, 254–265 (1987)MathSciNetMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Petr Kalina
    • 1
  • Jiří Vokřínek
    • 2
  • Vladimír Mařík
    • 3
  1. 1.Intelligent Systems GroupCzech Technical University in PragueCzech Republic
  2. 2.Agent Technology CenterCzech Technical University in PragueCzech Republic
  3. 3.Department of CyberneticsCzech Technical University in PragueCzech Republic

Personalised recommendations