一种求解作业车间调度问题的异步元胞遗传算法  

An Asynchronous Cellular Genetic Algorithm for Job-shop Scheduling Problem

作　　者：陆曈曈[1] 胡方军[2] 张屹[2] 

机构地区：[1]三峡大学经济与管理学院,湖北宜昌443002 [2]三峡大学水电机械设备设计与维护湖北省重点实验室,湖北宜昌443002

出　　处：《组合机床与自动化加工技术》2014年第8期147-151,共5页Modular Machine Tool & Automatic Manufacturing Technique

基　　金：国家自然科学基金资助项目(51275274);三峡大学培优基金项目(2013PY023)

摘　　要：以最快完工时间最少为目标建立了作业车间调度数学模型。将一种异步更新策略引入元胞遗传算法,提出了一种异步元胞遗传算法(acGA)。采用acGA和传统遗传算法求解作业车间调度实例,结果对比表明在求解作业车间调度问题时,acGA与sGA相比搜索能力更强,收敛速度更快,算法的稳定性也更好,表明acGA是一种求解JSP问题的有效算法。The paper presented the mathematical model of Job-shop Scheduling Problem（ JSP） and took the minimum makespan as its optimization goal. We proposed a new kind of asynchronous cellular genetic algorithm（ acGA） by introducing an asynchronous update strategy in the cellular genetic algorithm. Then we applied the proposed acGA and the simple genetic algorithm to the JSP examples and compared the results.The contrastive results showed that acGA had better search capability,faster convergence speed,and preferable stability than the simple genetic algorithm when solving the JSP examples. It proved that the proposed acGA is a feasible and effective algorithm for JSP.

关 键 词：元胞遗传算法 异步更新策略 邻居结构 作业车间调度 

分 类 号：TH166[机械工程—机械制造及自动化] TG65[金属学及工艺—金属切削加工及机床]