摘要
通过分析现有柔性车间调度问题特点和对相关算法进行研究,提出了基于改进非支配排序遗传算法(Non-Dominated Sorted Genetic Algorithm-II,NSGA2)的调度方法求解该问题。针对非支配排序遗传算法中存在种群多样性低、运算速度慢等缺点,提出了基于拥挤度的自适应交叉算子,并借鉴竞标机制思想,将竞争选择方法引入非支配排序遗传算法中,以提高求解质量。通过实验仿真以验证所提算法的有效性与可行性。
By analyzing the characteristics and algorithm research of the existing flexible job shop scheduling problem,a scheduling method based on the improved Non-dominated Sorted Genetic Algorithm-II(NSGA2)to solve the problem was proposed.Aiming at the shortcomings of low population diversity and slow operation speed in the NSGA2,an adaptive crossover operator based on congestion was proposed.Based on the idea of bidding mechanism,the competitive selection method was introduced into the non-dominated sorted genetic algorithm to improve the quality of the solution.The validity and feasibility of the algorithm was verified by experimental simulation.
作者
张守京
王彦亭
Zhang Shoujing;Wang Yanting(School of Mechanical and Electrical Engineering,Xi’an Polytechnic University,Xi’an 710048,China)
出处
《现代制造工程》
CSCD
北大核心
2020年第9期23-31,共9页
Modern Manufacturing Engineering
基金
西安市现代智能纺织装备重点实验室项目(2019220614SYS021CG043)
陕西省教育厅科研计划项目(17JK0321)
中国纺织联合会项目(2017100)。
