多目标优化的多种群混合行为二元蚁群算法  

Multi-population binary ant colony algorithm with concrete behaviors for multi-objective optimization problem

作　　者：叶青[1] 熊伟清[1] 李纲[1] 

机构地区：[1]宁波大学电子商务与物流研究所,浙江宁波315211

出　　处：《计算机工程与应用》2011年第17期37-41,共5页Computer Engineering and Applications

基　　金：国家自然科学基金No.60472099;浙江省自然科学基金(No.Y1080363);宁波市自然科学基金(No.2007A610051)~~

摘　　要：针对二元蚁群算法在求解多目标问题时难以同时得到多个解和难以得到Pareto曲面的缺陷,使用多种群策略,改善算法的全局搜索能力,引入环境评价/奖励因子和蚁群混合行为搜索机制,提出了多种群混合行为二元蚁群算法。通过对几个不同带约束多目标函数的测试,实验结果表明该算法在保证全局搜索能力的基础上,拥有很好的多目标求解能力。Aiming at solving the drawbacks of the original binary ant colony algorithm on multi-objective optimization problems：easy to fall into the local optimization and difficult to get the Pareto optimal solutions,Multi-Population Binary Ant colony algorithm with Concrete Behaviors（MPBACB） is proposed.This algorithm introduces multi-population method to ensure the global optimization ability, and uses environmental evaluation/reward model to improve the searching efficiency.Furthermore, concrete ant behaviors are defined to stabilize the performance of the algorithm.Experimental results on several constrained multi-objective functions prove that the algorithm ensures the good global search ability,and has better effect on the multi-objective problems.

关 键 词：二元蚁群 多种群 环境评价 混合行为 多目标 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]