首页 | 官方网站   微博 | 高级检索  
     

基于蚁群算法的面向服务软件的部署优化方法
引用本文:李琳,应时,赵翀,董波.基于蚁群算法的面向服务软件的部署优化方法[J].电子学报,2016,44(1):123-129.
作者姓名:李琳  应时  赵翀  董波
作者单位:1. 武汉大学软件工程国家重点实验室, 湖北武汉 430072; 2. 武汉大学计算机学院, 湖北武汉 430072
基金项目:国家自然科学基金(61373038;61070012),国家863高技术研究发展计划(2012AA011204-01)
摘    要:面向服务软件的部署优化问题是典型的NP难题.本文构建了基于性能改善的软件部署优化模型,设计了一种蚁群优化算法ACO-DO进行近似最优解的快速求解.该算法通过设计基于部署优化问题的启发式、改进部署方案的构建顺序、增加局部搜索过程实现蚁群算法求解效率的提升.通过不同规模的实例实验,验证了ACO-DO算法能够取得比现有的混合整数线性规划算法、蚁群算法和遗传算法更好的性能.

关 键 词:面向服务的软件  部署优化  蚁群算法  性能  
收稿时间:2014-09-25

Deployment Optimization of Service-Oriented Software Based on Ant Colony Algorithm
LI Lin,YING Shi,ZHAO Chong,DONG Bo.Deployment Optimization of Service-Oriented Software Based on Ant Colony Algorithm[J].Acta Electronica Sinica,2016,44(1):123-129.
Authors:LI Lin  YING Shi  ZHAO Chong  DONG Bo
Affiliation:1. State Key Lab of Software Engineering, Wuhan University, Wuhan, Hubei 430072, China; 2. Computer School, Wuhan University, Wuhan, Hubei 430072, China
Abstract:The deployment optimization of service-oriented software is well known to be NP hard.In this paper, a software deployment optimization model is built for improving the performance of service-oriented software, and an Ant Colony Algorithm for Deployment Optimization (ACO-DO) is designed to solve it so that the near-optimal solutions can be obtained quickly.The algorithm improves ant colony algorithm by designing a heuristic based on the considered problem, optimizing the orders of constructing deployment solutions and adding a local search procedure.A series of instances with different sizes are tested and analyzed.The experimental results show that the designed ACO-DO algorithm performs better than the existing Mixed Integer Linear Programming, ant colony and genetic algorithms.
Keywords:service-oriented software  deployment optimization  ant colony algorithm  performance
本文献已被 万方数据 等数据库收录!
点击此处可从《电子学报》浏览原始摘要信息
点击此处可从《电子学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号