Abstract
Systems composed of several interacting autonomous agents have a huge potential to efficiently address complex real-world problems. A new Learning Sensitive Agent System (LSAS) is proposed to address combinatorial optimization problems. Agents communicate by directly exchanging information and knowledge about the environment. Furthermore, agents of the proposed model are endowed with stigmergic behavior and are able to indirectly communicate by producing and being influenced by pheromone trails. Each stigmergic agent has a certain level of sensitivity to the pheromone allowing various types of reactions to a changing environment. For better search diversification and intensification, agents can learn to modify their sensitivity level according to environment characteristics and previous experience. The proposed LSAS model is tested for solving various instances of the Asymmetric Traveling Salesman Problem. Numerical experiments indicate the robustn ess and potential of the new metaheuristic.
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.
References
Camazine, S., Deneubourg, J.L., Franks, N.R., Sneyd, J., Theraulaz, G., Bonabeau, E.: Self organization in biological systems, Princeton Univ. Press (2001)
Chira, C., Pintea, C.-M., Dumitrescu, D.: Stigmergic Agents for Solving NP-difficult Problems, Proceedings of Bio-Inspired Computing: Theory and Applications Conference, Evolutionary Computing volume, 63–69, Wuhan, China (2006)
Chira, C., Pintea, C.-M., Dumitrescu, D.: Sensitive Stigmergic Agent Systems, Proceedings of the 7-th ALAMAS Symposium, MICC Tech. Report Series, no. 07-04, K. Tuyls, S.de Jong, M. Ponsen, K. Verbeeck (eds.) 51–57 (2007)
Dorigo, M., Di Caro, G., Gambardella, L.M.: Ant algorithms for discrete optimization, Artificial Life, 5, 137–172 (1999)
Dorigo M., Blum, C.: Ant Colony Optimization Theory: A Survey, Theoretical Computer Science, 344(2–3), 243–278 (2005)
Gambardella, L. M., Dorigo, M.: Solving Symmetric and Asymmetric TSPs by Ant Colonies, International Conference on Evolutionary Computation, 622–627 (1996)
Golden, B.L., Assad, A.A.: A decision-theoretic framework for comparing heuristics. European J. of Oper. Res., 18, 167–171 (1984)
Grassé, P.-P. : La Reconstruction du Nid et Les Coordinations Interindividuelles Chez Bellicositermes Natalensis et Cubitermes sp. La Thorie de la Stigmergie: Essai dinterpretation du Comportement des Termites Constructeurs, Insect Soc., 6, 41–80 (1959)
http://www.iwr.uni-heidelberg.de/groups/comopt/ software/TSPLIB95/
Jennings, N.R.: An agent-based approach for building complex software systems, Comms. of the ACM, 44(4), 35–41 (2001)
Nwana, H.S.: Software Agents: An Overview, Knowledge Engineering Review, 11, 1–40 (1996)
Stützle, T., Hoos, H.H.: The Max-Min Ant System and Local Search for the Travelling Salesman Problem, IEEE International Conference on Evolutionary Computation, Piscataway, T. Bäck, Z. Michalewicz and X. Yao (eds.), 309–314, IEEE Press (1997)
Wooldridge, M., Dunne, P.E.: The Complexity of Agent Design Problems: Determinism and History Dependence, Annals of Mathematics and Artificial Intelligence, 45(3–4), 343–371 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Chira, C., Pintea, C.M., Dumitrescu, D. (2008). Cooperative Learning Sensitive Agent System for Combinatorial Optimization. In: Krasnogor, N., Nicosia, G., Pavone, M., Pelta, D. (eds) Nature Inspired Cooperative Strategies for Optimization (NICSO 2007). Studies in Computational Intelligence, vol 129. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78987-1_31
Download citation
DOI: https://doi.org/10.1007/978-3-540-78987-1_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-78986-4
Online ISBN: 978-3-540-78987-1
eBook Packages: EngineeringEngineering (R0)