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

求解作业车间调度问题的多种群改进遗传算法
引用本文:苏子林.求解作业车间调度问题的多种群改进遗传算法[J].鲁东大学学报,2007,23(2):133-135.
作者姓名:苏子林
作者单位:鲁东大学交通学院 山东烟台264025
摘    要:在求解作业车间调度问题上,针对遗传算法的早熟收敛、对初始种群敏感等不足,提出了多种群改进遗传算法.该算法在进化过程中通过引入具有优良性能的修正种群替换进化种群的较差个体,实现了多种群杂交,以保持种群的多样性,提高了搜索效率.应用实例分析和算法对比证明了改进算法的效果和优越性.

关 键 词:作业车间调度问题  遗传算法  修正种群  早熟收敛
文章编号:1673-8020(2007)02-0133-03
修稿时间:2006年9月29日

An improved Multi-population Genetic Algorithm for Job-shop Scheduling Problem
SU Zi-lin.An improved Multi-population Genetic Algorithm for Job-shop Scheduling Problem[J].Ludong University Journal (Natural Science Edition),2007,23(2):133-135.
Authors:SU Zi-lin
Abstract:In order to avoid premature convergence problem,lower algorithm's sensitivity to original population,and improve convergent speed,an improved multi-population genetic algorithm is put forward.Correction population which has eminent performance is continually imported during inheritance and evolution,and current population's baddish individuals are replaced;thus multipopulation crossover is realized to keep population's diversification.The improvement method's effect and the algorithm's superiority are made sure by analysis of example and comparison with genetic algorithms.
Keywords:job-shop scheduling problem  genetic algorithm  correction population  premature convergence
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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