检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:刘桂森 贾兆红[1,2] LIU Guisen;JIA Zhaohong(School of Computer Science and Technology,Anhui University,Hefei 230601,China;Key Lab of Intelligent Computing and Signal Processing,Ministry of Education,Anhui University,Hefei 230601,China)
机构地区:[1]安徽大学计算机科学与技术学院,安徽合肥230601 [2]安徽大学计算智能与信号处理教育部重点实验室,安徽合肥230601
出 处:《计算机集成制造系统》2024年第2期684-694,共11页Computer Integrated Manufacturing Systems
基 金:国家自然科学基金资助项目(71971002,71601001)。
摘 要:云制造服务组合问题往往存在多个优化目标且各目标权重难以事先确定,为了显著提高进化算法在求解过程中的种群多样性,并有效平衡进化算法的全局与局部搜索能力,提出一种基于自适应选择和反向学习策略的进化算法,同时优化时间、成本、可靠性、可用性和信誉度。首先为了缩短求解组合方案的时间,采用K-means方法基于服务质量对候选服务进行聚类,去除质量较差的服务;然后采用反向学习策略提高全局搜索性能,再通过选择策略和概率更新策略有效平衡算法的全局与局部搜索能力;最后与4种先进算法进行实验对比表明,所提算法具有更好的综合性能。To solve the difficult problem of weighing the weights of multiple targets in the cloud manufacturing service composition,as well as significantly improve the population diversity of the evolutionary algorithm in the solution process and effectively balances the global and local search capabilities of the evolutionary algorithm,an evolutionary algorithm based on adaptive selection and reverse learning strategy was proposed,while optimizing the time,cost,reliability,availability and credibility.To shorten the time to solve the combined solution,the K-means method was used to cluster the candidate services based on the quality of service,and the poorer services were eliminated.Then,the reverse learning strategy was used to improve the global search performance,and the global and local search capabilities of the algorithm were effectively balanced through selection and probability update strategies.The results of comparative experiments with four advanced algorithms showed that the proposed algorithm had better comprehensive performance.
分 类 号:TP391[自动化与计算机技术—计算机应用技术] TH16[自动化与计算机技术—计算机科学与技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.118