融合Powell搜索法的遗传算法求解柔性车间调度问题  

Solving the problem of flexible job-shop scheduling with genetic algorithm based on Powell searching

作　　者：杨振泰 黎向锋[1] 左敦稳[1] 李堃 毕高杰 Yang Zhentai;Li Xiangfeng;Zuo Dunwen;Li Kun;Bi Gaojie(Electromechanical College,Nanjing University of Aeronautics and Astronautics,Nanjing 210001,China)

机构地区：[1]南京航空航天大学机电学院

出　　处：《现代制造工程》2019年第9期41-47,共7页Modern Manufacturing Engineering

基　　金：江苏省产学研合作-前瞻性联合研究项目(BY2016003-12)

摘　　要：针对柔性车间调度问题,提出一种融合Powell搜索法的(改进)遗传算法(GA-Powell)。该算法分别以最大完工时间、机器总载荷和最大机器载荷为优化目标。考虑到柔性车间调度遗传算法中染色体编码方案的特殊性,对传统的Powell搜索法进行改进,以免在进化过程中产生不可行解。利用文献中的测试实例和Brandimarte测试实例测试GAPowell,验证了GA-Powell的可行性和有效性。Aiming at the problem of flexible job-shop scheduling, an improved Genetic Algorithm based on Powell searching ( GAPowell) is proposed. The optimization targets of the algorithm are the maximum completion time, the total machine load and the maximum machine load respectively. Considering the particularity of the chromosome coding scheme of genetic algorithm aiming at the flexible shop scheduling, the traditional Powell searching algorithm is improved to avoid the generation of infeasible solutions in the evolutionary process. The GA-Powell was tested with the testing cases of the literature and the testing cases of Brandimarte, which proved the feasibility and effectiveness of the GA-Powell .

关 键 词：柔性作业车间调度 遗传算法 POWELL搜索法 

分 类 号：TH186[机械工程—机械制造及自动化]