期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
一类带约束动态多目标优化问题的进化算法 被引量:3
1
作者 杨亚强 刘淳安 《计算机工程与应用》 CSCD 2012年第21期45-48,74,共5页
动态多目标约束优化问题是一类NP-Hard问题,定义了动态环境下进化种群中个体的序值和个体的约束度,结合这两个定义给出了一种选择算子。在一种环境变化判断算子下给出了求解环境变量取值于正整数集+的一类带约束动态多目标优化问题的... 动态多目标约束优化问题是一类NP-Hard问题,定义了动态环境下进化种群中个体的序值和个体的约束度,结合这两个定义给出了一种选择算子。在一种环境变化判断算子下给出了求解环境变量取值于正整数集+的一类带约束动态多目标优化问题的进化算法。通过几个典型的Benchmark函数对算法的性能进行了测试,其结果表明新算法能够较好地求出带约束动态多目标优化问题在不同环境下质量较好、分布较均匀的Pareto最优解集。 展开更多
关键词 约束动态多目标优化 进化算法 环境变化 PARETO最优解
在线阅读 下载PDF
Dynamic services selection algorithm in Web services composition supporting cross-enterprises collaboration 被引量:7
2
作者 胡春华 陈晓红 梁昔明 《Journal of Central South University》 SCIE EI CAS 2009年第2期269-274,共6页
Based on the deficiency of time convergence and variability of Web services selection for services composition supporting cross-enterprises collaboration,an algorithm QCDSS(QoS constraints of dynamic Web services sele... Based on the deficiency of time convergence and variability of Web services selection for services composition supporting cross-enterprises collaboration,an algorithm QCDSS(QoS constraints of dynamic Web services selection)to resolve dynamic Web services selection with QoS global optimal path,was proposed.The essence of the algorithm was that the problem of dynamic Web services selection with QoS global optimal path was transformed into a multi-objective services composition optimization problem with QoS constraints.The operations of the cross and mutation in genetic algorithm were brought into PSOA(particle swarm optimization algorithm),forming an improved algorithm(IPSOA)to solve the QoS global optimal problem.Theoretical analysis and experimental results indicate that the algorithm can better satisfy the time convergence requirement for Web services composition supporting cross-enterprises collaboration than the traditional algorithms. 展开更多
关键词 Web services composition optimal service selection improved particle swarm optimization algorithm (IPSOA) cross-enterprises collaboration
在线阅读 下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部