摘要
在求解组合优化问题时 ,有一类问题要使用序号编码 GA操作 ,但采用传统的 GA算法操作复杂 ,计算效率不高 .改用整数编码的单亲遗传算法来解这类问题 ,有其优越性 .以组合优化问题中的 N皇后为例 ,说明用此方法使其计算简明、直观。
The single parent genetic algorithm (PGA) is a new kind of derived genetic algrithm, which has advantages to optimization of combination problem. The sequence coding manner is commonly used for code system. However the efficiency of traditional manner (GA) is lower with complex opertion. In this paper an improved coding based on PGA is discussed for optimization of combination with an example of N queen problem. The discussion states that the method is feasible.
出处
《武汉理工大学学报（交通科学与工程版）》
北大核心
2003年第2期241-243,共3页
Journal of Wuhan University of Technology（Transportation Science & Engineering）
关键词
单亲遗传算法
组合优化
N皇后问题
整数编码
求解方法
single parent genetic algorithm
optimization of combination problem
N qreen problem
