摘要
空间布置问题是工业生产中的瓶颈问题,因为存在太多的可能组合,容易陷入局部最小解。本文提出一种在空间布置问题中基于遗传算法把空间位置进行编码并通过遗传操作算子进行重定位和改变有限旋转方向策略的全局搜索方法。种群中每一个个体是一种有效的空间分配方案,在遗传算法进化过程中为减少计算时间,提高空间利用率,采用了多种启发式信息如原点策略、边策略、避免重复定位点策略和无悬挂策略等来加速收敛到全局最优解。最后,仿真例子说明了所提方法是工业应用中一种可选方案。
Layout problems are found in various kinds of industrial design applications. Because the process of layout includes many kinds of combinational conditions, it is difficult and computationally time-consuming to find the optimal solution by using the traditional mathematical programming methods. In this paper we proposed an algorithm for optimal layout problems based on genetic algorithm. The genetic algorithm with a new encoding scheme and a new genetic operator is used for handling the combinations of layout problems with the two-dimensional polygons, and every individual in population is a layout scheme. Many kinds of heuristic location strategies are proposed to help for determining the exact layout so as to minimize the fitness value in the genetic algorithm and decrease the amount of computation. We presented a simulation experiment for demonstrating the effectiveness by this method.
出处
《系统仿真学报》
CAS
CSCD
2004年第8期1845-1848,共4页
Journal of System Simulation
关键词
遗传算法
空间布置
启发式定位策略
定位编码
genetic algorithm
spatial layout
heuristic location strategy
location encoding
