Abstract
Cooperative multi-agent systems are rapidly growing subclass of the multi-agent systems where autonomous components allow to built and use several agent types acting in parallel while cooperatively solving a task. Possible form of such cooperation may be based, for example, on adaptive memory methods, where partial elements of good solutions are stored and next combined to create new complete solutions. Alternative possibility forms central memory approaches, where complete elite solutions are exchanged among various heuristics. Moreover, cooperatively solving a task is often combined with learning mechanism, where agents adapt their behavior to the new conditions of environment during the process of solving the problem. The goal of the paper is to propose a dedicated cooperative multi-agent system for solving the Vehicle Routing Problem with a reinforcement learning mechanism implemented in it.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Barbucha, D., Czarnowski, I., Jȩdrzejowicz, P., Ratajczak-Ropel, E., Wierzbowska, I.: An Implementation of the JADE-based A-Team Environment. International Transactions on System Science and Applications 3(4), 319–328 (2008)
Le Bouthillier, A., Crainic, T.G., Kropf, P.: A Guided Cooperative Search for the Vehicle Routing Problem with Time Windows. IEEE Intelligent Systems 20(4), 36–42 (2005)
Golden, B., Stewart, W.: Empirical Analysis of Heuristics. In: Lawler, E., Lenstra, J., Rinnoy, A., Shmoys, D. (eds.) Travelling Salesman Problem, pp. 207–250. Wiley-Interscience, New York (1985)
Jennings, N.R., Sycara, K., Wooldridge, M.: A Roadmap of Agent Research and Development. Autonomous Agents and Multi-Agent Systems 1, 7–38 (1998)
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)
Nareyek, A.: Choosing Search Heuristics by Non-Stationary Reinforcement Learning. In: Resende, M.G.C., de Sousa, J.P. (eds.) Metaheuristics: Computer Decision-Making, pp. 523–544. Kluwer Academic Publishers, Dordrecht (2003)
Panait, L., Luke, S.: Cooperative Multi-Agent Learning: The State of the Art. Autonomous Agents and Multi-Agent Systems 11(3), 387–434 (2005)
Rochat, Y., Taillard, E.D.: Probabilistic Diversification and Intensification in Local Search for Vehicle Routing. Journal of Heuristics 1(1), 147–167 (1995)
Talukdar, S., Baeretzen, L., Gove, A., de Souza, P.: Asynchronous teams: Cooperation schemes for autonomous agents. Journal of Heuristics 4, 295–321 (1998)
Toth, P., Vigo, D. (eds.): The Vehicle Routing Problem. SIAM Monographs Discrete Mathematics and Applications. SIAM, Philadelphia (2002)
OR-Library, http://people.brunel.ac.uk/~mastjjb/jeb/orlib/vrpinfo.html
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Barbucha, D. (2010). Cooperative Solution to the Vehicle Routing Problem. In: Jędrzejowicz, P., Nguyen, N.T., Howlet, R.J., Jain, L.C. (eds) Agent and Multi-Agent Systems: Technologies and Applications. KES-AMSTA 2010. Lecture Notes in Computer Science(), vol 6071. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13541-5_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-13541-5_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13540-8
Online ISBN: 978-3-642-13541-5
eBook Packages: Computer ScienceComputer Science (R0)