Abstract
Systems composed of several interacting autonomous agents have a huge potential to efficiently address complex real-world problems. Agents communicate by directly exchanging information and knowledge about the environment. To cope with complex combinatorial problems, agents of the proposed model are endowed with stigmergic behaviour. Agents 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. Resulting computational metaheuristic combines sensitive stigmergic behaviour and direct agent communication with the aim of better addressing combinatorial optimization NP-hard problems. The proposed model is tested for solving various instances of the Generalized Traveling Salesman Problem. Numerical experiments indicate the robustness 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
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, Wuhan, China (2006) 63–69
Camazine, S., Deneubourg, J.L., Franks, N.R., Sneyd, J., Theraulaz, G., Bonabeau, E.: “Self organization in biological systems”; Princeton Univ. Press (2001)
Grasse, P.-P.: “La Reconstruction du Nid et Les Coordinations Interindividuelles Chez Bellicositermes Natalensis et Cubitermes sp. La Thorie de la Stigmergie: Essai dinterprtation du Comportement des Termites Constructeurs”, Insect Soc., 6 (1959) 41–80
Dorigo, M., Di Caro, G., Gambardella, L.M.: “Ant algorithms for discrete optimization”, Artificial Life, 5 (1999) 137–172
Dorigo M., Blum, C.: “Ant Colony Optimization Theory: A Survey”, Theoretical Computer Science, 3442–3 (2005) 243–278
Nwana, H.S.: “Software Agents: An Overview”, Knowledge Engineering Review, 11 (1996) 1–40
Jennings, N. R.: “An agent-based approach for building complex software systems”, Comms. of the ACM, 444 (2001) 35–41
Wooldridge, M., Dunne, P. E.: “The Complexity of Agent Design Problems: Determinism and History Dependence”, Annals of Mathematics and Artificial Intelligence, 453–4 (2005) 343–371
Pintea, C-M., Pop, C. P., Chira, C.: “The Generalized Traveling Salesman Problem solved with Ant Algorithms”, Journal of Universal Computer Science, Graz, Springer-Verlag, in press (2007).
Renaud, J., Boctor, F.F.: “An efficient composite heuristic for the Symmetric Generalized Traveling Salesman Problem”, European Journal of Operational Research, 108 (1998) 571–584
Snyder, L.V., Daskin, M.S.: “A Random-Key Genetic Algorithm for the Generalized Traveling Salesman Problem”, European Journal of Operational Research (2006), 38–53
http://www.iwr.uni-heidelberg.de/groups/comopt/software/TSPLIB95/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Chira, C., Pintea, CM., Dumitrescu, D. (2007). Sensitive Stigmergic Agent Systems — A Hybrid Approach to Combinatorial Optimization. In: Corchado, E., Corchado, J.M., Abraham, A. (eds) Innovations in Hybrid Intelligent Systems. Advances in Soft Computing, vol 44. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74972-1_6
Download citation
DOI: https://doi.org/10.1007/978-3-540-74972-1_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74971-4
Online ISBN: 978-3-540-74972-1
eBook Packages: EngineeringEngineering (R0)