求解不等圆布局问题的一类遗传算法

A Genetic Algorithm for Solving Unequal Circles Packing Problem

  • 摘要: 在已有求解不等圆布局问题算法的基础上,根据问题特点提出了一类遗传算法,通过将拟物方法与标准遗传算法结合使用,较好地解决了对布局优化函数进行全局最优求解的问题最后通过实例计算验证了本算法的有效性.

     

    Abstract: The authors bring forward agenetic algorithm for solving unequal circles packing problem based on the existing algorithms and the characteristics of the problem.The algorithm can find the global optimal value of the packing-optimization function by combining the quasi-physical algorithm and standard genetic algorithm.Finally,it is proved by several typical instances that the algorithm is effective.

     

/

返回文章
返回