检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:肖秀梅 王欣蕊 Xiao Xiumei;Wang Xinrui(School of Mathematics,Yunnan Normal University,Kunming 650500,China)
出 处:《现代计算机》2023年第8期46-50,56,共6页Modern Computer
摘 要:针对带序列依赖的流水车间组调度问题(FSDGSP),提出了一种协同多目标优化算法。首先,分析了FSDGSP的问题特点。其次,设计了适合问题求解的三维向量编码策略,以区分三种不同的优化子问题。再次,构建了一种协同搜索的多目标优化算法。最后,经过大量实验对比分析,并与其他算法相比较得出,该算法明显优于现有的经典多目标优化算法。This paper develops a collaborative multiobjective optimization algorithm(CMOEA)to solve the flow shop group scheduling problem with setup time constraints.First,the features of the considered problem are analyzed and described.Then,a threedimensional vector is designed to represent each solution to list the three subproblems.Next,a collaborative searching multiobjective algorithm is designed to solve the problem.Finally,after extensive experimental results and comparison with other algorithms,this algorithm significantly outperforms existing classical multiobjective optimization algorithms.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222