基于演化策略算法的作业车间调度优化  

Job-shop Scheduling Optimization Based on Evolutionary Strategy Algorithm

作　　者：刘志雄[1,2,3] 杨光祥[4] 

机构地区：[1]武汉科技大学机械自动化学院,武汉430081 [2]天津港(集团)有限公司博士后科研工作站,天津300461 [3]武汉理工大学水路公路交通安全控制与装备教育部工程研究中心,武汉430063 [4]重庆工商大学计算机科学与信息工程学院,重庆400067

出　　处：《计算机工程》2010年第19期8-10,17,共4页Computer Engineering

基　　金：国家自然科学基金资助项目(70801047);中国博士后科研基金资助项目(20090450769)

摘　　要：提出一种基于工件操作次序的二维实数编码方法,采用演化策略算法求解作业车间调度问题。设计一种基于三点交叉互换的重组算子用于生成子代个体,并采用个体编码基因随机重新生成的方法设计变异算子。实验结果证明,演化策略算法能有效优化作业车间调度问题,与遗传算法和粒子群优化算法相比,其优化性能更好,并且基于三点交叉互换重组算子的演化策略算法的性能好于基于两点交叉和基于四点交叉互换重组算子的演化策略算法。This paper proposes a two-dimension encoding approach based on the job operation sequence and uses Evolutionary Strategy（ES） algorithm to solve the Job-shop Scheduling Problem（JSP）.A kind of recombination operation based on three-point crossover and interchange is used to generate the offspring individuals,and a kind of mutation operation is designed that some gene in the encoding is stochastically generated.Experimental results show that evolutionary strategy algorithm can effectively optimize the JSP and has better performance than genetic algorithm and hybrid particle swarm optimization algorithm.ES algorithm based on three-point crossover and interchange recombination operation has better performance than the recombination operation based on two-point crossover and interchange and the recombination operation based on four-point crossover and interchange.

关 键 词：演化策略算法 作业车间调度问题 三点交叉互换重组算子 

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