摘要
分析柔性作业车间调度问题的特点,提出一种求解该问题的改进遗传算法。在以最大完工时间为性能指标情况下,设计一种基于改进算法的柔性车间调度方法,改变种群初始化方式提高搜索效率,结合问题特点设计合理的染色体编码方式、交叉算子和变异算子,提高求解效率。通过实验仿真,验证所提出的初始化方法的可行性和有效性。
This paper analyzes the characteristics of flexible job shop scheduling problem,and proposes an improved genetic algorithm to solve the problem. In the case of the maximum completion time as the performance index,a flexible shop scheduling method based on the improved algorithm is designed to change the population initialization method to improve the search efficiency,and combine the problem characteristics to design a reasonable chromosome coding method,crossover operator and mutation operator to improve Solving efficiency. The feasibility and validity of the proposed initialization method are verified by experimental simulation.
作者
曹睿
侯向盼
金巳婷
CAO Rui;HOU Xiangpan;JIN Siting(Dalian Jiaotong University,Dalian 116028;CRRC Qingdao Sifang Co.,Ltd.,Qingdao 266031;Shenyang Railway Administration Communication Section,Shenyang 110001)
出处
《计算机与数字工程》
2019年第2期285-288,共4页
Computer & Digital Engineering
关键词
遗传算法
柔性车间调度
genetic algorithm
flexible shop scheduling
