期刊文献+

Service composition based on discrete particle swarm optimization in military organization cloud cooperation 被引量:2

Service composition based on discrete particle swarm optimization in military organization cloud cooperation
下载PDF
导出
摘要 This paper addresses the problem of service composition in military organization cloud cooperation(MOCC). Military service providers(MSP) cooperate together to provide military resources for military service users(MSU). A group of atom services, each of which has its level of quality of service(QoS), can be combined together into a certain structure to form a composite service. Since there are a large number of atom services having the same function, the atom service is selected to participate in the composite service so as to fulfill users' will. In this paper a method based on discrete particle swarm optimization(DPSO) is proposed to tackle this problem. The method aims at selecting atom services from service repositories to constitute the composite service, satisfying the MSU's requirement on QoS. Since the QoS criteria include location-aware criteria and location-independent criteria, this method aims to get the composite service with the highest location-aware criteria and the best-match location-independent criteria. Simulations show that the DPSO has a better performance compared with the standard particle swarm optimization(PSO) and genetic algorithm(GA). This paper addresses the problem of service composition in military organization cloud cooperation(MOCC). Military service providers(MSP) cooperate together to provide military resources for military service users(MSU). A group of atom services, each of which has its level of quality of service(QoS), can be combined together into a certain structure to form a composite service. Since there are a large number of atom services having the same function, the atom service is selected to participate in the composite service so as to fulfill users' will. In this paper a method based on discrete particle swarm optimization(DPSO) is proposed to tackle this problem. The method aims at selecting atom services from service repositories to constitute the composite service, satisfying the MSU's requirement on QoS. Since the QoS criteria include location-aware criteria and location-independent criteria, this method aims to get the composite service with the highest location-aware criteria and the best-match location-independent criteria. Simulations show that the DPSO has a better performance compared with the standard particle swarm optimization(PSO) and genetic algorithm(GA).
出处 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2016年第3期590-601,共12页 系统工程与电子技术(英文版)
基金 supported by the National Natural Science Foundation of China(61573283)
关键词 service composition cloud cooperation discrete particle swarm optimization(DPSO) service composition cloud cooperation discrete particle swarm optimization(DPSO)
  • 相关文献

参考文献3

二级参考文献19

  • 1吴健,吴朝晖,李莹,邓水光.基于本体论和词汇语义相似度的Web服务发现[J].计算机学报,2005,28(4):595-602. 被引量:218
  • 2左斌,胡云安,施建洪.变参数滑模极值搜索算法研究[J].海军航空工程学院学报,2005,20(4):439-442. 被引量:8
  • 3张圣云,张安,王连柱,史志富,张连根.反潜飞机对潜搜索法研究[J].火力与指挥控制,2006,31(1):70-71. 被引量:38
  • 4Ketter T N. Anti-submarine warfare in the 21st century[R]. ADA27660, 2004.
  • 5Dawson H C. Anti-submarine warfare: Still an Essential Warfare Art[R]. ADA26356 ,1993.
  • 6Aliexandridis M G. Mathematical Formulation of the Asw Decision Model [M]. Cognitive Simulation of AntiSubmarine Warfare Commaner's Tactical Decision Process. American. Office of Navy Research, 1984: 21-23.
  • 7Forrest R N. Some notes on search, detection and localization modeling[R]. ADA135938, 1994.
  • 8Tracey P A. Search priorities for a target probability area[R]. ADA085057, 2001.
  • 9R Urick. Principles of Underwater Sound [M]. New York: McGraw Hill, 1983.
  • 10Robert M Corless, G H Gonnet D E G Hare. On the Lambert W Function [J]. Advances in Computational Mathematics (S1019-7168), 1996. 5(5): 329-359.

共引文献26

同被引文献5

引证文献2

二级引证文献9

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部