Fast simulation of rare events in queueing and reliability models
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Ant-based load balancing in telecommunications networks
Adaptive Behavior
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Packet Routing with Genetically Programmed Mobile Agents
SMARTNET '00 Proceedings of the IFIP TC6 WG6.7 Sixth International Conference on Intelligence in Networks: Telecommunication Network Intelligence
AntNet: distributed stigmergetic control for communications networks
Journal of Artificial Intelligence Research
Active networks: Applications, security, safety, and architectures
IEEE Communications Surveys & Tutorials
Ant colony system: a cooperative learning approach to the traveling salesman problem
IEEE Transactions on Evolutionary Computation
Cross-Entropy Guided Ant-Like Agents Finding Cyclic Paths in Scarcely Meshed Networks
ANTS '02 Proceedings of the Third International Workshop on Ant Algorithms
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Laying Pheromone Trails for Balanced and Dependable Component Mappings
IWSOS '09 Proceedings of the 4th IFIP TC 6 International Workshop on Self-Organizing Systems
Revisiting the Auto-Regressive Functions of the Cross-Entropy Ant System
IWSOS '09 Proceedings of the 4th IFIP TC 6 International Workshop on Self-Organizing Systems
warm intelligence heuristics for component deployment
EUNICE'10 Proceedings of the 16th EUNICE/IFIP WG 6.6 conference on Networked services and applications: engineering, control and management
Component deployment using parallel ant-nests
International Journal of Autonomous and Adaptive Communications Systems
Restoration performance vs. overhead in a swarm intelligence path management system
ANTS'06 Proceedings of the 5th international conference on Ant Colony Optimization and Swarm Intelligence
Self-tuned refresh rate in a swarm intelligence path management system
IWSOS'06/EuroNGI'06 Proceedings of the First international conference, and Proceedings of the Third international conference on New Trends in Network Architectures and Services conference on Self-Organising Systems
Self-Management of virtual paths in dynamic networks
Self-star Properties in Complex Information Systems
| Hi-index | 0.00 |
The problem of finding paths in networks is general and many faceted with a wide range of engineering applications in communication networks. Finding the optimal path or combination of paths usually leads to NP-hard combinatorial optimization problems. A recent and promising method, the cross-entropy method proposed by Rubinstein, manages to produce optimal solutions to such problems in polynomial time. However this algorithm is centralized and batch oriented. In this paper we show how the cross-entropy method can be reformulated to govern the behaviour of multiple mobile agents which act independently and asynchronously of each other. The new algorithm is evaluate on a set of well known Travelling Salesman Problems. A simulator, based on the Network Simulator package, has been implemented which provide realistic simulation environments. Results show good performance and stable convergence towards near optimal solution of the problems tested.