DocumentCode
3292377
Title
Reconfigurable network based on ant algorithms
Author
Saad, E.M. ; El Adawy, M. ; Habashy, Shahird M.
Author_Institution
Helwan Univ., Cairo, Egypt
fYear
2004
fDate
16-18 March 2004
Lastpage
42377
Abstract
The social inset colony metaphor has provided computer scientists with powerful new models with which problems can be attached by means of swarm intelligence. The focus of this paper is on reviewing the idea behind ant algorithm and its application to determine the shortest path between two nodes in a reconfigurable network. The ants move across the network between arbitrary pairs of nodes selecting their path at each intermediate node according to the distribution of simulated pheromones at each node. As they move they deposit simulated pheromones as function of their congestion encountered on their journey.
Keywords
cooperative systems; evolutionary computation; reconfigurable architectures; ant algorithm; computer scientist; reconfigurable network; simulated pheromone; social insect colony metaphor; swarm intelligence; Ant colony optimization; Application software; Biological system modeling; Centralized control; Computational biology; Fluctuations; Insects; Negative feedback; Particle swarm optimization; Systems biology;
fLanguage
English
Publisher
ieee
Conference_Titel
Radio Science Conference, 2004. NRSC 2004. Proceedings of the Twenty-First National
Print_ISBN
977-5031-77-X
Type
conf
DOI
10.1109/NRSC.2004.1321844
Filename
1321844
Link To Document