基于遗传-蚁群算法的不同形状物体的布局

Different Shape Object Layout Problem Solving Based on GA-ACO Algorithm

针对不同形状物体布局的特点,依据遗传-蚁群算法的基本思想,分析了不同形状物体基因的编码、适应度函数的表示、信息素的更新机制以及在其约束条件下的相应操作,提出了不同形状物体的布局求解方案。仿真结果表明,该算法收敛速度快,可在较短时间内获得较佳的布局方案。

Layout of the different shape objects characteristics is analyzed, based on the basic method of GA_ACO. Preferable coding method and right fitness function are choosen to solve the layout of the poly-form objects. The experimental results show that this algorithm has strong overall searching ability while overcoming the precocious phenomenon of GA-AC0. It can obtain a good configuration in short time