摘要： 基于单亲遗传算法提出一种对于一维原材料位置组合进行编码，并通过变异操作算子进行全局搜索的方法。首先为了减少运算量，加快算法的收敛速度，提出一种用来减少染色体长度且又保持能找到最优全局解的染色体精简编码方案；其次在评价函数的选择上，采用了材料剩余量最小的全局最优评价函数来保证进化收敛到最优解；而采用的变异保持策略和选择精华策略可以使得进化过程更快地趋向最优解。最后，实际应用例子说明了所提方法是工业应用中一种可行的方案。

关键词: 单亲遗传算法；一维材料分割问题；精简编码；变异保持策略

Abstract: This paper proposes a new algorithm for optimal layout problems based on partheno-genetic algorithm. First, a new encoding schema called the simplified encoding method is used to cut down the length of the chromosome for reducing the computation. Second it constructs an efficient evaluation function based on the stock-lost to get the global solution. The elitist strategy and the mutation-holding strategy are applied in the genetic operations to improve the convergent speed. Finally, a practical experiment from the real factory is performed to demonstrate the method

Key words: Partheno-genetic heuristic method; One dimension CSP; Simplified encoding; Mutation-holding strategy