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

一类混合模拟退火与蚁群优化算法及其收敛性分析
引用本文:罗中良,刘强,刘小勇.一类混合模拟退火与蚁群优化算法及其收敛性分析[J].工业仪表与自动化装置,2008(4):3-6.
作者姓名:罗中良  刘强  刘小勇
作者单位:1. 佛山科学技术学院,自动化系,广东,佛山,528000
2. 广东轻工业学院,电子通信工程系,广东,广州,510275
3. 西安交通大学,自动控制系,陕西,西安,710049
基金项目:国家自然科学基金,建设部科研项目
摘    要:针对蚁群算法易陷入局部最优和模拟退火算法搜索效率低的缺点,利用蚁群算法搜索高效和模拟退火算法的概率突跳性,提出运用两者优点的混合算法,借鉴模拟退火算法来改善全局优化能力,并分析了算法收敛性。通过中国旅行商问题的求解表明算法的优越性。

关 键 词:蚁群优化算法  模拟退火算法  Metropolis准则  旅行商问题

A kind of hybrid SA and ACO algorithm and its convergence
LUO Zhong-Liang,LIU Qiang,LIU Xiao-Yong.A kind of hybrid SA and ACO algorithm and its convergence[J].Industrial Instrumentation & Automation,2008(4):3-6.
Authors:LUO Zhong-Liang  LIU Qiang  LIU Xiao-Yong
Affiliation:LUO Zhong-Liang , LIU Qiang, LIU Xiao-Yong (1. Automation Dept of Foshan University, Guangdong Foshan 528000, China; 2. Electronic Communication Engineering Dept of Guangdong Industry Techinical College, Guangdong Guangzhou 510275 ,China; 3. Autocontrol Dept of Xi' an Jiaotong University ,Shaanxi Xi' an 710049, China)
Abstract:This paper presents a kind of hybrid optimization algorithm by combining the parallel searching structure of simulated annealing (SA) with the probabilistic jumping property and ant colony optimization(ACO). In this algorithm, the ant colony can provide effective initial solutions for the SA, which brings about new solutions based on the Metropolis criterion at a certain temperature. Then the ACO updates pheromone and proceeds through the reuse of the solutions from the SA. The optimization simula- tion solutions for the traveling salesman problem(TSP) show that the hybrid algorithm can compensate the deficiency of the ACO that is easy to run into local optimum, thus improving the global search ability.
Keywords:ant colony algorithm optimization  simulated annealing algorithm  Metropolis criterion  TSP
本文献已被 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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