| 基于蚁群系统的双目标最小生成树算法 |
| |
| 引用本文： | 赵玲,张建科.基于蚁群系统的双目标最小生成树算法[J].西安邮电学院学报,2008,13(5):82-84. |
| |
| 作者姓名： | 赵玲 张建科 |
| |
| 作者单位： | 1. 集美大学,理学院,福建,厦门,361021
2. 西安邮电学院,应用数理系,陕西,西安,710121 |
| |
| 基金项目： | 福建省自然科学基金，陕西省教育厅自然科学研究项目 |
| |
| 摘 要： | 带有多个目标的最小生成树问题在实际生活中有着广泛的应用,但用传统方法很难有效地解决,本文提出一种基于多目标决策的蚁群系统求解双目标最小生成树算法,利用两个启发信息来构造新的状态转移规则,并改进了信息素更新规则,指导蚂蚁找到Pareto最优解。试验结果表明,该算法能有效解决双目标生成树问题,与Pareto最优枚举法比较,求解时间减少了。
|
| 关 键 词： | 蚁群系统 双目标 最小生成树 |
Research on bi-criteria minimum spanning tree problem based on ant colony system |
| |
| ZHAO Ling,ZHANG Jian-ke.Research on bi-criteria minimum spanning tree problem based on ant colony system[J].Journal of Xi'an Institute of Posts and Telecommunications,2008,13(5):82-84. |
| |
| Authors: | ZHAO Ling ZHANG Jian-ke |
| |
| Affiliation: | ZHAO Ling, ZHANG Jian-ke (1. School of science, Jimei University, Xiamen 361021 ,China; 2. Department of Applied Mathematics and Physics, Xi＇an University of Post and Telecommunications, Xi＇an 710121,China) |
| |
| Abstract: | It is difficult to solve muti-criteria minimum spanning tree(MCMST),which is widely used in daily life,by the traditional methods.The multiple objective ant colony system is proposed to solve MCMST problem in this paper.A novel pseudorandom proportional rule and the update of pheromone trails are constructed in this algorithm to obtain Pareto optimal solutions.Simulation results show that our algorithm can achieve the better performance than the method of Pareto optimal enumeration. |
| |
| Keywords: | ant colony system bi-criteria minimum spanning tree |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
