International Journal of Computer and Information Technology (ISSN: 2279 – 0764)
Volume 05 – Issue 06, November 2016
pheromone updating rule is that each time an ant uses a link its
pheromone trial is reduced, so that the link becomes less
desirable for the following ants, this allows an increase in the
exploration of arcs that have not been visited. So, the algorithm
does not show a stagnation behavior.
The performance of the algorithm has been evaluated
through experiments, which showed that it is efficient in
producing least cost multicast trees that satisfy the specified
The experiments showed that the costs of the multicast
trees obtained by our algorithm were less than those obtained
by TGBACA , and our algorithm takes considerably less
It showed also that as the number of ants increases, the
fitness of the best multicast trees decreases, and stabilizes after
reaching a certain number of ants. It showed also that as the
network size and the percentage of destination group increase
the cost of the multicast tree increases, and as the size of the
network increases the time increases.
 S. L. Hakimi, “Steiner problem in graphs and its implications“,
Networks, vol. 1, pp. 113-133, 1971.
 G. Lu and Z. Liu, "Multicast routing based on ant-algorithm with delay
and delay variation constraints", The 2000 IEEE Asia-Pacific
Conference on Circuits and Systems, APCCAS 2000, February 2000,
 Chao-Hsien Chu, JunHua Gu, Xiang Dan Hou, Qijun Gu, "A Hesristic
Ant Algorithm for Solving QoS Multicast Routing Problem",
Proceedings of the 2002 Congress on Evolutionary Computation, CEC
'02, 12-17 May 2002.
 B. Gong, L. Li, and X. Wang, “Multicast routing based on ant algorithm
with multiple constraints”, International Conference on Wireless
Communications, Networking and Mobile Computing, WiCom 2007,
21-25 Sept. 2007, Shanghai, pp. 1945-1948.
 H. Wang, Z. Shi, S. Li, "Multicast routing for delay variation bound
using a modified ant colony algorithm", Journal of Network and
Computer Applications, vol. 32, pp. 258–272, 2009.
 H. Wang, H. Xu, S. Yi, and Z. Shi, “A tree-growth ant colony algorithm
for QoS multicast routing problem”, Expert Systems with Applications,
vol. 38, no. 9, pp. 11787–11795, September 2011.
 D. Dhull and S. Dhull, "An Improved Ant Colony Otimization (IACO)
Based Multicasting in MANET", International Journal of Inventive
Engineering and Sciences (IJIES), vol. 1, no. 3, pp. 8-12, February 2013.
 W. Zhengying, S. Bingxin, and Z. Erdun, "Bandwidth-delay-constrained
least-cost multicast routing based on heuristic genetic algorithm",
Computer Communications, vol. 24, pp. 685-692, 2001.
 A. T. Haghighat, K. Faez, M. Dehghan, A. Mowlaei, and Y.
Ghahremani, “GA-based heuristic algorithms for bandwidth-delay-
constrained least-cost multicast routing“, Computer Communications,
vol. 27, no. 1, pp. 111–127, 2004.
 F. De Rango, M. Tropea, A. Santamaria, and S. Marano, "Multicast QoS
corebased tree routing protocol and genetic algorithm over an HAP-
satellite architecture", IEEE Transactions on Vehicular Technology, vol.
58, no. 8, pp. 4447-4461, Oct. 2009.
 A. Younes, "Multicast routing with bandwidth and delay constraints
based on genetic algorithms", Egyptian Informatics Journal, vol. 12, pp.
 Z. Kun, W. Heng, and L. Feng-Yu, "Distributed multicast routing for
delay and delay variation-bounded Steiner tree using simulated
annealing", Computer Communications, vol. 28, pp. 1356–1370, 2005.
 Z/ Kun, Q. Yong, and Z. Hong, "Dynamic multicast routing algorithm
for delay and delay variation-bounded Steiner tree problem",
Knowledge-Based Systems, vol. 19, pp. 554–564, 2006.
 L. Zhang, L. Cai, M. Li, and F. Wang, "A method for least-cost QoS
multicast routing based on genetic simulated annealing algorithm",
Computer Communications, vol. 32, pp. 105–110, 2009.
 N. Ghaboosi and A. T. Haghighat, “Tabu search based algorithms for
bandwidth-delay-constrained least-cost multicast routing“,
Telecommunication Systems, vol. 34, no. 3, pp. 147-166, 2007.
 X. Wang, J. Cao, H. Cheng, and M. Huang, "QoS multicast routing for
multimedia group communications using intelligent computational
methods", Computer Communications, vol. 29, pp. 2217–2229, 2006.
 J. Liu, J. Sun, and W. Xu, “QoS Multicast Routing Based on Particle
Swarm Optimization”, Proceedings of 7th International Conference on
Intelligent Data Engineering and Automated Learning, IDEAL 2006,
Burgos, Spain, September 20-23, LNCS 4224, pp. 936- 943, Springer-
Verlag Berlin Heidelberg, 2006.
 C. Mala and R. Narendran, “Simulated Study of QoS Multicast Routing
Using Particle Swarm Optimization”, World Applied Programming, vol.
1, no 3, pp. 176-182, August 2011.
 M. R. Girgis, T. M. Mahmoud, and G. W. Hanna, "Using GA, PSO and
hybrid GA-PSO based algorithms for solving the least-cost multicast
problem with QoS constraints", International Journal of Computer
Systems, vol. 3, no. 3, pp. 166-172, March, 2016
 M. Dorigo and G. Caro, The ant colony optimization meta-heuristic,
new ideas in optimization, McGraw-Hill, 1999.
 N. Zhao, Z. Wu, Y. Zhao, and T. Quan, “Ant colony optimization
algorithm with mutation mechanism and its applications“, Expert
Systems with Applications, vol. 37, pp. 4805-4810, 2010.
 M. K. Patel, M. R. Kabat, and C. R. Tripathy, “A hybrid ACO/PSO
based algorithm for QoS multicast routing problem”, Ain Shams
Engineering Journal, vol. 5, no. 1, pp. 113–120, March 2014.
 M. Dorigo and T. Stützle, Ant Colony Optimization, MIT Press,
Massachusetts Institute of Technology, 2004.
 M. Dorigo and L. M. Gambardella, "Ant Colony System: A cooperative
learning approach to the traveling salesman problem", IEEE
Transactions on Evolutionary Computation, vol. 1, no. 1, pp. 53–66,
 M. Dorigo, "Ant colony optimization", Scholarpedia, vol. 2, no. 3,