改进遗传算法求解流水车间调度问题  

An Improved Genetic Algorithm for Flow-shop Scheduling Problem

作　　者：黄可坤[1] 

机构地区：[1]嘉应学院数学学院,广东梅州514015

出　　处：《嘉应学院学报》2012年第5期8-12,共5页Journal of Jiaying University

摘　　要：提出了一个求解流水车间调度问题的改进的遗传算法.该方法把一个染色体编码成若干个可以重复的自然数,表示相应工件的排序权值;通过简单交换两个父代的若干相同位置的基因,产生能够继承父代优良特性的子代;并且采用均匀变异,更好地保持种群中基因的多样性.实验表明,比起传统的遗传算法,该方法的性能有显著改善.In this paper, an improved genetic algorithm for Flow -shop scheduling problem is proposed. A chromo- some is coded into several natural numbers that can be repeated, corresponding to the sorting weights of jobs. Through the simple exchange of several genes of two parents, the children that can inherit parents＇ exceUent char- acteristics are created. Using the uniform mutation, the diversity of genes of the population is better maintained. The experimental results show that the performance of the proposed method has significantly improved compared with the traditional genetic algorithm.

关 键 词：遗传算法 流水车间调度问题 自然数编码 均匀变异 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]