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

面向服务组合的密码服务调度智能优化研究
引用本文:李建军,郁滨,陈武平.面向服务组合的密码服务调度智能优化研究[J].通信学报,2013,34(Z1):28-222.
作者姓名:李建军  郁滨  陈武平
作者单位:1. 信息工程大学 密码工程学院,河南 郑州 450004;2. 信息保障技术重点实验室,北京 100072
基金项目:国家重点基础研究发展计划(“973”计划)基金资助项目(2012CB315900);信息保障技术重点实验室开放基金资助项目(KJ-11-07)
摘    要:为了提高密码服务的质量,提出了一种面向服务组合的密码服务体系结构,并针对其中的密码服务调度问题提出了一种改进的混合离散蛙跳算法。该算法利用传统混合蛙跳算法的基本框架,重新设计了编码和解码方式以及个体矢量更新方法。同时为了提高搜索的精度,利用6种邻域结构,结合变邻域搜索算法,对组内最优青蛙进行优化。最后分别进行了标准算例对比实验与模拟仿真实验,结果验证了算法高效的寻优能力以及合理地实现了服务组合的优化, 满足了用户的需求, 符合现实情况。

关 键 词:密码服务调度  混合离散蛙跳算法  体系结构  邻域结构  局部搜索

Research on intelligent optimization of cryptogram service scheduling for service composition
Jian-jun LI,Bin YU,Wu-ping CHEN.Research on intelligent optimization of cryptogram service scheduling for service composition[J].Journal on Communications,2013,34(Z1):28-222.
Authors:Jian-jun LI  Bin YU  Wu-ping CHEN
Affiliation:1. Institute of Cryptographic Engineering, Information Engineering University, Zhengzhou 450004, China;2. Science and Technology on Information Assurance Laboratory, Beijing 100072, China
Abstract:To improve the quality of cryptogram service, the cryptogram service architecture for service composition was proposed. And a hybrid discrete shuffled frog-leaping algorithm was proposed to solve cryptogram service scheduling problem. It uses the basic framework of the traditional frog-leaping algorithm and designs the encoding and decoding according. The corresponding individual vector updating method was re-designed. To improve search accuracy, the proposed algorithm was improved with six neighborhoods to optimize the best frog of the group and combined with variable neighborhood search algorithm. The proposed algorithm was tested on a set of standard instances and simulation experiments. The results show the effectiveness of the algorithms, and an optimal path to fulfill the users' request have been formed. It is suitable for the real life environment.
Keywords:cryptogram service scheduling problem  hybrid discrete shuffled frog-leaping algorithm  architecture  neighborhood  local search
点击此处可从《通信学报》浏览原始摘要信息
点击此处可从《通信学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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

京公网安备 11010802026262号