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

求解作业车间调度问题的一种自适应遗传算法
引用本文:苏子林,韩晓玲. 求解作业车间调度问题的一种自适应遗传算法[J]. 鲁东大学学报, 2007, 23(1): 34-38
作者姓名:苏子林  韩晓玲
作者单位:鲁东大学交通学院 山东烟台264025(苏子林),鲁东大学地理与资源管理学院 山东烟台264025(韩晓玲)
摘    要:针对作业车间调度问题,提出了最小化空闲时间的处理过程及其变异算子,设计了一种自适应遗传算法.该算法根据个体的特征确定交叉和变异次数,并根据种群特征不断修正种群.经典的调度基准问题测试表明:自适应措施能够有效保持种群的多样性,可以采用非常小的种群规模;最小化空闲时间的变异算子缩小了算法的搜索空间,大大提高了搜索效率.

关 键 词:作业车间调度问题  自适应遗传算法  最小化空闲时间
文章编号:1673-8020(2007)01-0034-05
修稿时间:2006-09-29

A Self-adaptive Genetic Algorithm for Job-shop Scheduling
SU Zi-lin,HAN Xiao-ling. A Self-adaptive Genetic Algorithm for Job-shop Scheduling[J]. Ludong University Journal (Natural Science Edition), 2007, 23(1): 34-38
Authors:SU Zi-lin  HAN Xiao-ling
Abstract:For job-shop scheduling problem,a minimizing idle time process procedure and its mutation operator were put forward,and a self-adaptive genetic algorithm was designed.This algorithm get crossover and mutation times according to individuals' characters,and gradually correct the population according to current population's property.Classic scheduling benchmark problem test shows:the self-adaptive measure can efficiently keep current population's diversity,can use very small population size;shortest idle time mutation operator reduces search space,greatly improves search efficiency.
Keywords:job-shop scheduling problem  self-adaptive genetic algorithm  shortest idle time
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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