检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:李林瑛[1] 卢睿 LI Lin-ying;LU Rui(Research Center for Language Intelligence of Dalian University of Foreign,Dalian 116044,China;Police Information Department,Liaoning Police College,Dalian 116036,China)
机构地区:[1]大连外国语大学语言智能研究中心,辽宁大连116044 [2]辽宁警察学院公安信息系,辽宁大连116036
出 处:《数学的实践与认识》2020年第22期167-178,共12页Mathematics in Practice and Theory
基 金:国家社会科学基金一般项目(15BYY028);2017年大连外国语大学科研基金(2017XTZD04);辽宁省自然科学基金(20180550284);大连外国语大学研究创新团队项目“计算语言学与人工智能创新团队”(2016CXTD06)。
摘 要:针对带滞留时间约束的混流集束型晶圆制造装备调度问题,为了优化晶圆加工排序和机械手搬运作业排序,提出了改进差分进化算法.通过定义机械手搬运作业,将双排序问题转换为单排序问题,并将其应有到染色体编码中;设计基于禁止区间法的启发式构造算法以生成初始种群,避免了不可行染色体的产生;给出可行解必须满足的条件,将其应用到差分变异和差分交叉算子设计中,避免冗余迭代和陷入局部最优等现象.与差分进化算法、遗传禁忌混合算法、粒子群算法的仿真实验比较,验证了提出算法的有效性和鲁棒性.Aiming at the scheduling problem of mixed-wafer clustered wafer manufacturing equipment with residence time constraints,an improved differential evolution algorithm is proposed to optimize both wafer input sequence and robotic move sequence.By defining the robot task operation,the problem is changed from a double sorting problem was to a single one,which is applied to chromosome coding later.Design a heuristic construction algorithm based on the forbidden interval method to generate the initial population and avoid the generation of infeasible chromosomes.Aiming to avoid redundant iterations and local optimization,the conditions that a feasible solution must meet are given and applied to design differential mutation and differential crossover operators.At last,the effectiveness and robustness of the proposed algorithm are verified by comparing with the simulation experiments of differential evolution algorithms,genetic tabu hybrid algorithms,and particle swarm optimization algorithms.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.222.24.251