单亲遗传算法在Flow-Shop问题中的应用  

Flow-Shop Problem by Partheno-Genetic Algorithm

作　　者：李茂军[1] 童调生[2] 

机构地区：[1]长沙电力学院电力工程系,410077 [2]湖南大学电气工程系,长沙410082

出　　处：《系统工程与电子技术》2000年第6期84-86,共3页Systems Engineering and Electronics

基　　金：教育部博士点基金资助课题 !(980 532 0 5)

摘　　要：单亲遗传算法 (PGA)是一种序号编码遗传算法。它具有遗传操作简单 ,不要求初始群体的广泛多样性 ,不存在“早熟收敛”现象等特点 ,非常适合于求解组合优化问题。Flow -Shop问题是一个典型的组合优化问题。给出了问题的数学模型及用PGA求解Folw -Shop问题的步骤。进行了仿真实验 。Partheno-genetic algorithm (PGA) that is fit for solving combinatorial optimum problem is a genetic algorithm using ordinal strings and has the advantages of traditional genetic algorithms. In PGA, genetic operation is simpler and the initial population need not to be varied and there is not immature convergence. Flow-Shop problem is a traditional combinatorial optimum problem. Mathematical model and calculating steps of flow-shop problem are given out. Finally, experiment results are shown.

关 键 词：单亲遗传算法 组合优化 Flow-Show问题 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程] TP301.6[自动化与计算机技术—控制科学与工程]