检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:曹坤煜 陈永当[1,2] 宋辛辛 强冰冰 CAO Kun-yu;CHEN Yong-dang;SONG Xin-xin;QIANG Bing-bing(School of Mechanical and Electrical Engineering,Xi’an Polytechnic University,Xi’an 710600,China;Xi’an Key Laboratory of Modern Intelligent Textile Equipment,Xi’an 710600,China;School of Mechanical and Electrical Engineering,Kunming University of Science and Technology,Kunming 650500,China)
机构地区:[1]西安工程大学机电工程学院,陕西西安710600 [2]西安市现代智能纺织装备重点实验室,陕西西安710600 [3]昆明理工大学机电工程学院,云南昆明650500
出 处:《计算机技术与发展》2020年第11期174-179,共6页Computer Technology and Development
基 金:中国纺织工业联合会科技项目(2016091,2019064);陕西省科技重点产业链项目(2018TSCXL-GY-03-02);西安市科技计划项目(201805030YD8CG14-16);西安市重点实验室建设项目(2019220614SYS021CG043)。
摘 要:针对单目标柔性作业车间调度问题,以最小化最大完工时间为目标建立了生产调度模型,并在此模型的基础上设计了一种收敛速度和求解稳定性均较优的免疫遗传算法。该算法采用三种方式相结合混合策略的种群初始化方式产生初始解,改善了初始种群的形成机制,提高了种群的初始质量和多样性。在基于提高算法搜索能力的基础上提出了抗体浓度调节方式及根据抗体浓度正交自适应调节的交叉算子、变异算子的构造方法。针对免疫遗传算法早熟收敛问题,利用种群分割的思想增加了其多样性,进一步提高了算法的收敛能力。最后,使用MATLAB求解基准算例对算法的性能进行仿真测试,并给出了算例仿真的最优甘特图与收敛图,通过与其他算法的求解结果相比较,验证了该算法有效性和可行性。Aiming at the single-objective flexible job-shop scheduling problem,the production scheduling model is established with the target of minimum completion time,on which an improved immune genetic algorithm with higher convergence and steadier equation solving ability is devised.This algorithm adopts population initialization with mixed strategy that integrated three methods generated the initial results,optimizing the forming mechanism of the initial population and improving its quality and diversity.The way of adjusting antibody concentration and the construction method of crossover operator and mutation operator that is adjusted by the adaptive orthogonality strategy of antibody concentration are put forward on the basis of improving the algorithm global search ability.For the problem of premature convergence of immune genetic algorithm,its diversity is increased by adopting the idea of population decomposition,so as to further improve the convergence ability of the algorithm.Finally,the performance of the algorithm is simulated by using MATLAB to solve the benchmark example,and the optimal Gantt chart and convergence chart of the simulation are given.Compared with other algorithms,it is verified that the proposed algorithm is effective and feasible.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.143.7.73