The Research of Genetic Ant Colony Algorithm and Its Application

被引:11
作者
Zhang Wei-guo [1 ]
Lu Tian-yu [1 ]
机构
[1] Xian Univ Sci & Technol, Fac Sci, Xian 710065, Shaanxi Provinc, Peoples R China
来源
SECOND SREE CONFERENCE ON ENGINEERING MODELLING AND SIMULATION (CEMS 2012) | 2012年 / 37卷
关键词
genetic algorithm (GA); ant colony optimization (ACO); optimization problem; 0-1 knapsack Problems; QoS;
D O I
10.1016/j.proeng.2012.04.210
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
This paper proposes genetic ant algorithm through the research of the traditional genetic algorithm and ant colony optimization. This algorithm use the results of the genetic algorithm to initialize the pheromone distribution, use its strong adaptability and rapid global convergence and then get the optimal solution through the colony algorithm that has parallelism, positive feedback system and good solution efficiency. The simulation results of 0-1 knapsack and QoS demonstrate that this algorithm has higher converging speed, stability and global optimization ability. (C) 2010 Published by Elsevier Ltd. Selection and/or peer-review under responsibility of Society for Resources, Environment and Engineering
引用
收藏
页码:101 / 106
页数:6
相关论文
共 7 条
[1]  
[Anonymous], 2005, IEEE COMMUN MAG
[2]  
[Anonymous], J CHINESE JOURNAL OF
[3]   An overview of quality of service routing for next-generation high-speed networks: Problems and solutions [J].
Chen, SG ;
Nahrstedt, K .
IEEE NETWORK, 1998, 12 (06) :64-79
[4]  
Ferguson P., 1998, QUALITY OF SERVICE D
[5]   Quantum-inspired evolutionary algorithm for a class of combinatorial optimization [J].
Han, KH ;
Kim, JH .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (06) :580-593
[6]  
SUN Baolin, 2005, J COMPUTER ENGINEERI, V31, P142
[7]  
YU Anbo, 2002, J COMPUTING TECHNOLO, V21