首页 | 本学科首页   官方微博 | 高级检索  
     

基于蚁群算法的多目标优化问题研究
引用本文:孔翔宇,欧阳瑞. 基于蚁群算法的多目标优化问题研究[J]. 四川轻化工学院学报, 2010, 0(3): 344-347
作者姓名:孔翔宇  欧阳瑞
作者单位:[1]周口师范学院数学与信息科学系,河南周口466000 [2]西安电子科技大学理学院,西安710071
基金项目:周口师范学院青年基金(ZKNUQN200909)
摘    要:为保持所求得的多目标优化问题Pareto最优解的多样性,文章提出了一种新的蚁群算法。选择策略采用多信息素权重,信息素更新结合了局部信息素更新与全局信息素更新。其中,全局信息素更新采用了两个最好解。此外,通过在外部设置外部集来存储Pareto解,并将改进的算法应用在双目标TSP上。最后进行了仿真实验,结果表明新方法比NSGA-II和SPEA2更有效。

关 键 词:多目标优化  蚁群算法  双目标TSP

Multi-objective Optimization Based on Ant Colony Algorithm
KONG Xiang-yu,OUYANG Rui. Multi-objective Optimization Based on Ant Colony Algorithm[J]. Journal of Sichuan Institute of Light Industry and Chemical Technology, 2010, 0(3): 344-347
Authors:KONG Xiang-yu  OUYANG Rui
Affiliation:1.Department of Mathematics and Information Science,Zhoukou Normal University,Zhoukou 466000,China;2.College of Science,Xidian University,Xi'an 710071,China)
Abstract:In order to preserve the diversity of Pareto optimal solutions in multi-objective optimization problems,A new ant colony algorithm is proposed.In the proposed algorithm,the selection strategy is multi-pheromone-weighted,and pheromone update uses the combination of the local and global pheromone update.Especially,the global pheromone update adopts the best solution and the second-best solution.In addition,an external set is set up outside to store the Pareto solution,and the improved algorithm is used to solve the bi-criterion TSP.The experiment show that the new algorithm is more efficient than SPEA2 and NSGA-II.
Keywords:multiple objective optimization  ant colony optimization  bi-criteria TSP
本文献已被 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号