首页 | 本学科首页   官方微博 | 高级检索  
     检索      

改进遗传算法求解流水车间调度问题
引用本文:黄可坤.改进遗传算法求解流水车间调度问题[J].嘉应学院学报,2012,30(5):8-12.
作者姓名:黄可坤
作者单位:嘉应学院数学学院,广东梅州,514015
摘    要:提出了一个求解流水车间调度问题的改进的遗传算法.该方法把一个染色体编码成若干个可以重复的自然数,表示相应工件的排序权值;通过简单交换两个父代的若干相同位置的基因,产生能够继承父代优良特性的子代;并且采用均匀变异,更好地保持种群中基因的多样性.实验表明,比起传统的遗传算法,该方法的性能有显著改善.

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

An Improved Genetic Algorithm for Flow- shop Scheduling Problem
HUANG Ke-kun.An Improved Genetic Algorithm for Flow- shop Scheduling Problem[J].Journal of Jiaying University,2012,30(5):8-12.
Authors:HUANG Ke-kun
Institution:HUANG Ke-kun(School of Mathematics,Jiaying University,Meizhou 514015,China)
Abstract:In this paper,an improved genetic algorithm for Flow-shop scheduling problem is proposed.A chromosome 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’ excellent characteristics 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.
Keywords:genetic algorithm  flow -shop scheduling problem  natural number coding  uniform mutation
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号