Ant-based load balancing in telecommunications networks
Adaptive Behavior
A Study of Some Properties of Ant-Q
PPSN IV Proceedings of the 4th International Conference on Parallel Problem Solving from Nature
An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem
INFORMS Journal on Computing
A survey of combinatorial optimization problems in multicast routing
Computers and Operations Research
A heuristic ant algorithm for solving QoS multicast routing problem
CEC '02 Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02
Ant colony system: a cooperative learning approach to the traveling salesman problem
IEEE Transactions on Evolutionary Computation
Data mining with an ant colony optimization algorithm
IEEE Transactions on Evolutionary Computation
Ant system: optimization by a colony of cooperating agents
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
QoS routing based on genetic algorithm
Computer Communications
Quality-of-service routing for supporting multimedia applications
IEEE Journal on Selected Areas in Communications
An evolvable cellular automata based data encryption algorithm
International Journal of Wireless and Mobile Computing
Research on half-mesh topology based on binary model and HTF-XY routing algorithm
International Journal of Computer Applications in Technology
International Journal of Wireless and Mobile Computing
Bio-inspired optimisation approach for data association in target tracking
International Journal of Wireless and Mobile Computing
International Journal of Wireless and Mobile Computing
International Journal of Wireless and Mobile Computing
Hi-index | 0.00 |
In this paper, some improvements on Ant Colony Optimisation (ACO) are presented and we use the improved algorithm to solve the multicast routing problem. The improvements are given as follows: A novel optimised implementing approach is designed to reduce the processing costs (the bandwidth, delay, mincost) involved with routing of ants in the conventional ACO. Based on the model of network routing, the set of candidates is limited to the nearest c points in order to reduce the counting of other points. And we also use the flags on the blocked points in order to prevent selecting these points. Simulations show that the speed of convergence of the improved algorithm can be enhanced greatly compared with the traditional algorithm.