人工蜂群算法在带约束圆形布局问题中的应用  

Artificial bee colony algorithm for layout optimization with equilibrium constraints

作　　者：黄帅[1] 王鹏[1] 朱舟全 

机构地区：[1]西北工业大学航海学院,西安710072

出　　处：《计算机工程与应用》2014年第4期29-32,共4页Computer Engineering and Applications

基　　金：国家高技术研究发展计划(863)(No.2011AA09A104)

摘　　要：人工蜂群算法是一种基于蜜蜂采蜜机制的新型演化算法。给出了带平衡约束的圆形布局问题的数学模型,介绍了人工蜂群算法的基本过程以及计算流程,将人工蜂群算法应用于带平衡约束的圆形布局优化中。通过两个实例进行仿真计算,并将计算结果与文献结果比较,验证了人工蜂群算法是解决此类问题的一种有效且实用的群智能算法。Artificial bee colony algorithm（ABC）is a new evolutionary algorithm based on the mechanisms of honey bee. Firstly, the mathematic model of the layout optimization problem with equilibrium constraints is put forward. Then the basic process and calculation flow of ABC is presented. In the numerical example, artificial bee colony algorithm is applied to solve the problem of layout optimization with equilibrium constraints. From the results of experimental comparison, it can be seen that the artificial bee colony algorithm is an effective and practical method for this problem.

关 键 词：约束圆形布局问题 人工蜂群算法 packing圆形 布局优化 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]