用蚁群算法求解带平衡约束的圆形布局问题

Ant colony algorithm for layout optimization with equilibrium constraints

采用启发式方法结合演化算法的思路求解带平衡约束的圆形布局问题.首先对传统优化模型进行调整,并探讨了调整的合理性;然后设计一种分步定位的布局方法,在此基础上利用蚁群算法寻优;最后利用局部搜索技术,在传统模型意义下对布局进行了改进.数值实验表明,算法的性能比目前已有的结果有较大的提高.

The idea of combining the heuristics with meta-heuristics is applied to solve the problem of layout optimization with equilibrium constraints. The existing model of the problem is adjusted and the rationality is discussed. Then a step-by-step positioning technique is provided, based on which an ant colony optimization （ACO） algorithm is designed. Finally, the results of the ACO are improved by using the technique of local search. The numerical experiments show that the proposed method has much better performance.