基于混合单亲遗传算法的Job-Shop问题研究  

Research on job-shop scheduling problem based on the hybrid partheno-genetic algorithm

作　　者：张庆[1] 姚锡凡[1] 

机构地区：[1]华南理工大学机械与汽车工程学院,广州510640

出　　处：《机械设计与制造》2009年第7期92-94,共3页Machinery Design & Manufacture

基　　金：国家高技术研究发展计划(863计划)资助项目(2007AA04Z111)

摘　　要：在单亲遗传算法的基础上,研究了模拟退火算法、保优算子和单亲遗传算法的结合方式以及具体算法,提出了一种新的混合单亲遗传算法。该算法继承了单亲遗传算法的优点,克服了一般遗传算法搜索能力差和计算速度慢等缺点;同时降低了对初始种群的要求,运算速度有了很大提高。运用所提出的算法对典型车间作业(Job-Shop)调度问题进行了求解,并与GA、PGA算法对比,结果证明了该算法的有效性。Based on the Partheno-Genetic Algorithm（PGA）,anovel hybrid method and concrete algorithm combining simulated annealing algorithm,optimal maintaining operator with PGA are presented. The algorithm has inherited the merit of PGA and overcames ordinary genetic algorithm（ GA ）shortcomings such as insufficient search ability and slow computation speed;at the same time lows the requirement of initial population and enhances the speed of computation. Typical job-shop scheduling problems are solved with the proposed algorithm.Experimental results show the validity of the proposed algorithm compared with GA and PGA.

关 键 词：单亲遗传算法 保优算子 模拟退火 作业调度 

分 类 号：TH12[机械工程—机械设计及理论] TB491[一般工业技术]