基于改进遗传算法的柔性作业车间调度  

Scheduling for the flexible job-shop problem based on an improved genetic algorithm

作　　者：王进峰[1] 阴国富[2] 雷前召[3] 范顺成[1] 

机构地区：[1]河北工业大学机械工程学院,天津300130 [2]渭南师范学院数学与信息科学学院,渭南714000 [3]渭南师范学院物理与电气工程学院,渭南714000

出　　处：《现代制造工程》2013年第5期50-53,105,共5页Modern Manufacturing Engineering

基　　金：陕西省自然科学基金资助项目(2011JM8020);中央高校基本科研业务费专项资金资助项目(10QG12)

摘　　要：针对柔性作业车间调度问题(FJSP)的特点和发展现状,提出一种基于基本遗传算法的改进算法。构建了一种新的染色体表达方案,将染色体分为工序染色体部分和机床染色体部分。通过加权处理设计了适应度函数,将多目标优化问题转变为线性优化问题。针对改进的染色体表达方案,重新设计了种群初始化算法,采用复制、交叉,以及变异操作策略优化调度方案。通过实例验证了该算法对FJSP的优化过程,试验结果表明了该算法的可行性和有效性。Examines the characteristic and development of the Flexible Job-shop Scheduling Problem （FJSP）. An improved algo- rithm for the FJSP is proposed based on a basic genetic algorithm, a new chromosome representation is represented, and the chro- mosome is divided into two parts：Operation Assignment （OA） and Machine Selection （MS）. The＇ fitness function is built with weight, and the multi-objective optimization problem was transformed to linear optimization problems. According to the chromo- some representation, the algorithm of initializing population is redesigned, different strategies for erossover and mutation operator are adopted. The experimental results have shown that the proposed algorithm is a viable and effective approach for the FJSP.

关 键 词：柔性作业车间调度问题 遗传算法 交叉 变异 

分 类 号：TP391.73[自动化与计算机技术—计算机应用技术] TP391.75[自动化与计算机技术—计算机科学与技术]