Abstract
Complex system simulations can often be represented by an evolving graph which evolves with a one-to-one mapping between vertices and entities and between edges and communications. Performances depend directly on a good load balancing of the entities between available computing devices and on the minimization of the impact of the communications between them. We use competing colonies of numerical ants, each depositing distinctly colored pheromones, to find clusters of highly communicating entities. Ants are attracted by communications and their own colored pheromones, while repulsion interactions between colonies allow to preserve a good distribution.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Albert, R., Barabaśi, A.: Statistical mechanics of complex networks. Reviews of modern physics 74, 47–97 (2002)
Bokhari, S.H.: On the Mapping Problem. IEEE Transactions on Computers 30, 207–214 (1981)
Dorigo, M., Maniezzo, V., Colorni, A.: The ant system: optimization by a colony of cooperating agents. IEEE Trans. Systems Man Cybernet. 26, 29–41 (1996)
Eager, D.L., Lazowska, E.D., Zahorjan, J.: A comparison of receiver-initiated and sender-initiated adaptive load sharing. Performance evaluation 6, 53–68 (1986)
Erdös, P., Rényi, A.: On random graphs. Pubiones Mathematicaelicat 6, 290–297 (1959)
Faieta, B., Lumer, E.: Diversity and adaptation in populations of clustering ants. In: Simulation of Adaptive Behavior, pp. 501–508. MIT Press, Cambridge (1994)
Deneubourg, J.-L., Goss, S., Francks, N., Detrain, C., Chrétien, L.: The dynamics of collective sorting: Robot-like ants and ant-like robots. In: Simulation of Adaptive Behavior, pp. 356–363. MIT Press, Cambridge (1991)
Kuntz, P., Snyers, D.: Emergent colonization and graph partitionning. In: Simulation of Adaptive Behavior, pp. 494–500. MIT Press, Cambridge (1994)
Lin, F.C.H., Keller, R.M.: The gradient model load balancing method. IEEE TOSE 13, 32–38 (1987)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bertelle, C., Dutot, A., Guinand, F., Olivier, D. (2004). Colored Ants for Distributed Simulations. In: Dorigo, M., Birattari, M., Blum, C., Gambardella, L.M., Mondada, F., Stützle, T. (eds) Ant Colony Optimization and Swarm Intelligence. ANTS 2004. Lecture Notes in Computer Science, vol 3172. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-28646-2_31
Download citation
DOI: https://doi.org/10.1007/978-3-540-28646-2_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22672-7
Online ISBN: 978-3-540-28646-2
eBook Packages: Springer Book Archive