[1]KONG Sun,CHEN Zeng-qiang.A new chaotic ant colony optimization algorithm and its application in a QoS multicast routing problem[J].CAAI Transactions on Intelligent Systems,2010,5(6):498-504.
Copy

A new chaotic ant colony optimization algorithm and  its application in a QoS multicast routing problem

CAAI Transactions on Intelligent Systems[ISSN 1673-4785/CN 23-1538/TP] Volume: 5 Number of periods: 2010 6 Page number: 498-504 Column: 学术论文—智能系统 Public date: 2010-12-25
Title:
A new chaotic ant colony optimization algorithm and  its application in a QoS multicast routing problem
Author(s):
KONG Sun;  CHEN Zeng-qiang
College of Information Technical Science，Nankai University, Tianjin 300071, China
Keywords:
QoS;  multicast routing;  chaos optimization algorithm;  ant colony optimization algorithm;  parameter optimization
CLC:
TP183；TN949.291
DOI:
-
Abstract:
QoSbased multicast routing can take advantage of network resources to support an application with QoS requirements by searching for the optimal multicast tree with some performance constraints. This problem, which is an indispensable part of QoScentered network architecture, has become an important issue in network domain research. A new chaotic ant colony optimization algorithm was proposed for a multiconstrained QoS multicast routing problem. To overcome the deficiencies of traditional ant colony algorithms, this algorithm uses a chaotic optimization algorithm to dynamically select parameters of the ant colony algorithm and improves global searching and convergence abilities. Simulation results show that this chaotic ant colony optimization algorithm performs better than the genetic algorithm and ant colony optimization mentioned here for solving a QoS multicast routing problem with multiple constraints.
References:
［1］WANG Z, CROWCROFT J. Quality of service for supporting multimedia applications［J］. IEEE Journal on Selected Areas in Communications, 1996, 14(7): 12281234.
［2］FEI X, LUO J Z, WU J Y, GU Q Q. QoS Routing based on genetic algorithm［J］. Computer Communications, 1999, 22(9): 13941399.
［3］王征应, 石冰心. 基于启发式遗传算法的QoS组播路由问题求解［J］. 计算机学报, 2001, 24(1)： 5561.
WANG Zhengying, SHI Bingxin. Solving QoS multicast routing problem based on heuristic genetic algorithm［J］. Chinese Journal of Computers, 2001, 24(1): 5561
［4］孙文生, 刘泽民. 组播路由调度的神经网络方法［J］. 通信学报, 1998, 19(11): 16.
SUN Wensheng, LIU Zemin. Multicast routing based neural networks［J］. Journal on Communications,1998,19(11): 16.
［5］ZHANG Li, CAI Lianbo, LI Meng, WANG Fahui. A method for leastcost QoS multicast routing based on genetic simulated annealing algorithm［J］. Computer Communications, 2009, 32: 105110.
［6］李生红, 潘理, 诸鸿文, 刘泽民. 基于蚂蚁算法的组播路由调度方法［J］. 计算机工程, 2001, 27(4): 6365.
 LI Shenghong, PAN Li, ZHU Hongwen, LIU Zemin. Antalgorithm based multicast routing［J］. Computer Engineering, 2001, 27(4): 6365.
［7］孙力娟, 王汝传. 基于蚁群算法和遗传算法融合的QoS组播路由求解［J］. 电子学报, 2006, 34(8): 13911395.
SUN Lijuan, WANG Ruchuan. Solving QoS multicast routing problem based on the combination of ant colony algorithm and genetic algorithm［J］. Acta Electronica Sinica, 2006, 34(8): 13911395.
［8］WANG Y, XIE J. Ant colony optimization for multicast routing［C］//The 2000 IEEE AsiaPacific Conference on Circuits and Systems. ［S.l.］， 2000： 5457.
 ［9］陈杰, 张洪伟. 基于自适应蚁群算法的QoS 组播路由算法［J］.计算机工程, 2008, 34(13): 200203.
CHEN Jie, ZHANG Hongwei. QoS multicast routing algorithm based on adaptive ant colony algorithm［J］. Computer Engineering, 2008, 34(13): 200203.
［10］陈烨. 变尺度混沌蚁群优化算法［J］. 计算机工程与应用, 2007, 43(3): 6870.
CHEN Ye. Scaleable chaotic ant colony optimization［J］. Computer Engineering and Applications, 2007, 43(3):6870.
［11］高尚. 解旅行商问题的混沌蚁群算法［J］. 系统工程理论与实践, 2005, 25( 9): 100104.
 GAO Shang. Solving traveling salesman problem by chaos ant colony optimization algorithm［J］. System EngineeringTheory & Practice, 2005, 25( 9): 100104.
［12］DORIGO M, MANIEZZO V, COLORNI A. Ant system: optimization by a colony of cooperating Agent［J］. IEEE Transactions on Systems, Man and Cybernetics, 1996, 26(1): 2941.
［13］DORIGO M, GAMBARDELLA L M. Ant colony system:a cooperative learning approach to the traveling salesman problem［J］.IEEE Transactions on Evolutionary Computation, 1997, 41(1): 5366.
［14］叶志伟, 郑肇葆. 蚁群算法中参数 设置的研究［J］.武汉大学学报：信息科学版, 2004, 29(7)： 597601.
YE Zhiwei, ZHENG Zhaobao. The research on the parameter in ant colony algorithm［J］. Geomatics and Information Science of Wuhan University, 2004, 29(7): 597601.
［15］吴春明, 陈治, 姜明. 蚁群算法中系统初始化及系统参数的研究［J］. 电子学报, 2006, 34(8): 15301532.
 WU Chunming, CHEN Zhi, JIANG Ming. The research on initialization of ants system and configuration of parameters for different TSP problems in ant algorithm［J］. Acta Electronica Sinica, 2006, 34(8): 15301532.
［16］朱庆保. 蚁群优化算法的收敛性分析［J］. 控制与决策,2006, 21(7): 763770. ZHU Qingbao. Analysis of convergence of ant colony optimization algorithms［J］. Control and Decision, 2006, 21(7): 763770.
［17］李兵, 蒋慰孙. 混沌优化方法及其应用［J］. 控制理论及应用, 1997, 14(4)： 613615.
LI Bing, JIANG Weisun. Chaos optimization method and its application［J］. Control Theory & Applications, 1997, 14(4)： 613615. ［18］WAXMAN B M. Routing of multipoint connections［J］. IEEE Journal on Selected Areas in Communications, 1988, 6(9): 16171622.
Similar References:

Memo

-

Last Update: 2011-03-03

Copyright © CAAI Transactions on Intelligent Systems