检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:郭伟飞 宋豫川[1] 周璠 雷琦[1] 吕向飞[1] GUO Weifei;SONG Yuchuan;ZHOU Fan;LEI Qi;LYU Xiangfei(State Key Laboratory of Mechanical Transmission,Chongqing University,Chongqing 400030,China;Chongqing Jiangjin Shipbuilding Industry Co.,Ltd.,Chongqing 402263,China)
机构地区:[1]重庆大学机械传动国家重点实验室,重庆400030 [2]重庆江增船舶重工有限公司,重庆402263
出 处:《计算机集成制造系统》2020年第12期3313-3328,共16页Computer Integrated Manufacturing Systems
基 金:工信部基金资助项目(CCLS-JB-002);国家自然科学基金资助项目(51205429);高技术船舶高端伺服液压系统数字化车间新模式应用基金资助项目(YYJD-003)。
摘 要:针对存在紧密衔接约束关系的复杂产品综合调度问题,提出一种基于逆序虚拟零部件的紧密衔接综合调度算法。该算法采用基于逆序虚拟零部件的遗传算法对问题进行求解。为了降低问题的求解难度,采用了一种基于逆序虚拟零部件双亲孩子表示法的编码方法;设计了能满足复杂产品逆序虚拟零部件顺序约束的交叉算子和变异算子。为保证生成问题的可行解,提出两种各具特色的解码方法。仿真实验结果表明,所提算法具有良好的求解速度和质量。For the integrated scheduling problem of complex product with no-wait constraint,a no-wait integrated scheduling algorithm based on reversed virtual component was proposed.Based on reversed virtual component,an improved genetic algorithm was used to solve the problem.To reduce the difficulty of solving the problem,an encoding method based on parents children representation of reversed virtual component was adopted,and the feasible crossover and mutation operators satisfying the sequence constraints of reverse virtual component were designed.In addition,two decoding methods with different characteristics were also presented,which could guarantee that chromosomes are decoded into feasible schedules.The simulation results indicated that the proposed no-wait integrated scheduling algorithm has good solution speed and quality.
关 键 词:紧密衔接 逆序虚拟零部件 遗传算法 综合调度 复杂产品
分 类 号:TP301.6[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.229