[1]李滢,童维勤,亢朝峰,等.基于QoS多目标优化的组合服务执行路径的选择[J].南京师大学报(自然科学版),2012,35(03):125-133.
 Li Ying,Tong Weiqing,Kang Chaofeng,et al.The QoS-Based Multi-Objective Optimization Algorithm of the Composite Service Execution Path[J].Journal of Nanjing Normal University(Natural Science Edition),2012,35(03):125-133.
点击复制

基于QoS多目标优化的组合服务执行路径的选择()
分享到:

《南京师大学报(自然科学版)》[ISSN:1001-4616/CN:32-1239/N]

卷:
第35卷
期数:
2012年03期
页码:
125-133
栏目:
计算机科学
出版日期:
2012-09-20

文章信息/Info

Title:
The QoS-Based Multi-Objective Optimization Algorithm of the Composite Service Execution Path
作者:
李滢12童维勤1亢朝峰3支小莉1
( 1. 上海大学计算机科学与技术学院,上海200072) ( 2. 南京晓庄学院数学与信息技术学院,江苏南京211171) ( 3. 中兴通讯,江苏南京200012)
Author(s):
Li Ying12Tong Weiqing1Kang Chaofeng3Zhi Xiaoli1
1.School of Computer Engineering and Science,Shanghai University,Shanghai 200072,China
关键词:
QoS多目标优化Pareto 解集蚁群系统虚拟抽象服务
Keywords:
QoSmulti-objective optimizationPareto setAnt Colony Systemvirtual abstract service
分类号:
TP393.09
摘要:
针对目前启发式算法求解组合服务执行路径中存在的不足,将组合服务执行路径上节点服务的QoS多目标优化问题转化为蚂蚁从巢穴到食物之间的最短路径选择问题,提出基于改进的蚁群算法———蚁群系统作为优化工具,并提出了用于屏蔽执行路径结构的虚拟抽象服务的概念,设计了算法中的局部与全局更新规则,将多目标优化的QoS约束参数融入dij参数的定义中,最后通过仿真实验验证了算法的可行性与优越性.
Abstract:
In this paper,after discussing the limitations of heuristic algorithm using for composite service execution path optimization,an optimization algorithm of Ant Colony System based on Ant Colony Algorithm is proposed. The algorithm regards the optimization problem as the shortest path solving problem of ant foraging from nest to food. In order to overcome the lack of Ant Colony System only using to solved sequential organization path,a concept of virtual abstract service was put forward innovatively to shield the different path structures,then local and global updating rules had been redesigned and the constrained QoS parameters were also into the definition of parameter. Finally,through simulation and comparing with basic Ant Colony Algorithm experimental verified the usability and superiority of the algorithm.

参考文献/References:

[1] Li Y,Hu Y,Tong W Q, et al. The service template composition method based on separation of concerns[C]/ / Proc of the 2010 IEEE International Conference on Progress in Informatics and Computing. Shanghai,2010: 1 057-1 059.
[2] Zitzler E,Laumanns M,Thiele L. SPEA2: Improving the strength Pareto evolutionary algorithm[C]/ / Giannakoglou K, Tsahalis D T,Périaux J,et al. Evolutionary Methods for Design,Optimization and Control with Applications to Industrial Problems. Berlin: Springer-Verlag,2002: 95-100.
[3] Coello C A,Pulido G T,Lechuga M S. Handing multiple objectives with particle swarm optimization[J]. IEEE Transaction on Evolutionary Computations,2004,8 ( 3) : 256-279.
[4] Wang Y,Dai G P,Hou Y R. Dynamic methods of Trust-Aware composite service selection [J]. Chinese Journal of Computers, 2009, 32( 8) : 1 668-1 675.[5] Peng X M,He Y X,Zhu B J. Application of Ant Colony Algorithm in Web services composition[J]. Computing Engineering, 2009,35( 10) : 182-188.
[6] Li S Y. Ant Colony Algorithms With Applications[M]. Harbin: Harbin Institute of Technology Press,2004.
[7] Nahrstedt K,Wichadakul D,Xu D. Distributed QoS compilation and runtime instantiation[C]/ / Proceedings of the 8th IEEE/IFIP International Workshop on Quality of Service. Pittsburgh,2000: 198-207.
[8] Martin M,Chopard B,Albuquerque P. Formation of an ant cemetery: Swarm intelligence of statistical accident[J]. Future Generation Computer Systems,2002,18: 893-901.
[9] Duan H B. Ant Colony Algorithms: Theory and Applications[M]. Beijing: Science Press,2005.
[10] Zeng L Z,Benatallah B. QoS-aware middleware for Web services composition[J]. IEEE Transactions on Software Engineering, 2004,30( 5) : 311-327.[11] Liu S L,Liu Y X,Zhang F,et al. A dynamic Web services selection algorithm with QoS global optimal in Web services composition[J]. Journal of Software,2007,18( 3) : 646-656.
[12] 刘波,杨路明,雷刚跃. 融合粒子群与蚁群算法优化XML 群体智能搜索[J]. 计算机研究与发展, 2008,45( 8) : 1 371- 1 378.
[13] Dai Y,Yang L,Zhang B,et al. QoS for composite Web services and optimizing[J]. Chinese Journal of Computers, 2006, 29( 7) : 1 167-1 178.

相似文献/References:

[1]陈丽洁,张迎周,符 炜.基于QoS和声誉的Web服务信任度评估方法[J].南京师大学报(自然科学版),2014,37(01):22.
 Chen Lijie,Zhang Yingzhou,Fu Wei.A Method of Web Service Reliability Assessment Based on QoS and Reputation[J].Journal of Nanjing Normal University(Natural Science Edition),2014,37(03):22.
[2]许 金,谷 琼,蔡之华,等.基于自适应ε占优的多目标差分演化算法[J].南京师大学报(自然科学版),2015,38(01):119.
 Xu Jin,Gu Qiong,Cai Zhihua,et al.Differential Evolution Algorithm for Multi-Objective OptimizationBased on Adaptive ε-Dominance[J].Journal of Nanjing Normal University(Natural Science Edition),2015,38(03):119.
[3]梁星星,马 扬,冯旸赫,等.面向多旅行商问题的多目标模拟退火算法研究[J].南京师大学报(自然科学版),2017,40(03):80.[doi:10.3969/j.issn.1001-4616.2017.03.012]
 Liang Xingxing,Ma Yang,Feng Yanghe,et al.Research on Multi-objective Simulated Annealing Algorithmfor Multi-traveling Salesman Problem[J].Journal of Nanjing Normal University(Natural Science Edition),2017,40(03):80.[doi:10.3969/j.issn.1001-4616.2017.03.012]
[4]李二超,马玉泉.基于快速二层解修补策略的区间离散遗传算法[J].南京师大学报(自然科学版),2019,42(03):73.[doi:10.3969/j.issn.1001-4616.2019.03.010]
 Li Erchao,Ma Yuquan.Interval Discrete Genetic Algorithms Based on FastTwo-Level Solution Repair Strategy[J].Journal of Nanjing Normal University(Natural Science Edition),2019,42(03):73.[doi:10.3969/j.issn.1001-4616.2019.03.010]

备注/Memo

备注/Memo:
基金项目: 国家自然科学基金( 60573109) 、上海市科技创新行动计划项目( 11511500200) .通讯联系人: 李滢,博士研究生,研究方向: 面向服务的计算. E-mail bxyzly@163. com
更新日期/Last Update: 2013-03-11