摘要
对基本蚁群算法框架进行了改进,采用轮盘赌选择代替了基本框架中通过启发式函数和信息素选择路径,同时对信息素的更新方式也做出调整,提出了一种新的蚁群算法,使得其更适合解决连续函数问题。将这种改进的蚁群算法应用于带有约束条件的连续函数问题中,在典型实例中进行仿真测试,实验结果表明,提出的改进蚁群算法可以很好地解决带有约束条件的连续函数问题,并能迅速找到最优解。
The basic framework of ant colony algorithm has been improved, which uses roulette wheel selection instead of the way of choosing the path through heuristic function and pheromone in the basic framework. At the same time, the way of updating the pheromone is redesigned. A new ant colony algorithm is proposed to make it more suitable to solve the problem of continuous function. This improved algorithm is applied to some typical continuous function problems with constraints, and the simulation test results show that the improved ant colony algorithm quickly find the optimal solution.
出处
《计算机工程与设计》
CSCD
北大核心
2010年第5期1027-1030,共4页
Computer Engineering and Design
基金
国家自然科学基金项目(60573066)
国家自然科学基金-广东省联合基金重点项目(U0835002)
关键词
蚁群优化算法
连续函数
约束
非均匀
随机搜索
ant colony optimization
continuous function
constraint
non-uniform
random search
