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

个体变异蚁群算法在TSP问题中的应用研究
引用本文:梁云川,李德玉. 个体变异蚁群算法在TSP问题中的应用研究[J]. 西南大学学报, 2009, 31(3)
作者姓名:梁云川  李德玉
作者单位:梁云川,LIANG Yun-chuan(忻州师范学院,计算机科学与技术系,山西忻州034000);李德玉,LI De-yu(山西大学,计算机与信息技术学院,山西太原030006)
摘    要:在蚁群算法中引入个体变异机制,使蚁群中蚂蚁个体的参数产生差异,从而调整概率函数中信息素因子的强度以及距离因子在概率中的作用,使蚂蚁在选路时具有多样性.与传统蚁群算法的对比实验表明该算法加快了收敛速度,改善了求解性能,有效避免了早熟收敛.
Abstract:
Ant colony algorithm has many disadvantages, such as long searching time, easy to fall into the local optimal solution and so on. This paper bring a individual mutation strategy in ACA, which makes the parameters of individual in the ant colony cause to change, enables the strategy of ants route selection to possess variety by coordinating the intensity of the pheromone gent and the effect of the distance gene in the probability function. The experimental results show that the improved algorithm has great effectiveness and efficiency than the Ant Colony algorithm and avoid stagnation efficiently.

关 键 词:蚁群算法  个体变异  早熟

Research of the Application of TSP Problems Based on Individual Mutation Ant Colony Optimization Algorithm
LIANG Yun-chuan,LI De-yu. Research of the Application of TSP Problems Based on Individual Mutation Ant Colony Optimization Algorithm[J]. Journal of Southwest Agricultural University, 2009, 31(3)
Authors:LIANG Yun-chuan  LI De-yu
Abstract:
Keywords:
本文献已被 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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