摘要
在单亲遗传算法的基础上提出了一种最优布局问题的求解方法,它不要求初始群体的多样性,同时避免了早熟收敛。以常见的矩形件排样优化问题为例,说明了该方法的可行性和高效性。
This paper presents a method for an optimization layout problem based on partheno-genetic algorithm, which doesnt ask for the diversity of the original colony and can avoid the phenomena of premature convergence. Taking the familiar optimization of rectangular layout for example, the improved solution can show feasibility and high efficiency.
出处
《计算机与现代化》
2007年第11期40-42,共3页
Computer and Modernization
关键词
单亲遗传算法
布局问题
矩形件排样
组合优化
parthenogenesis algorithm
packing problem
rectangular layout
combinatorial optimization
