首页 | 本学科首页   官方微博 | 高级检索  
     

基于网格的混合微粒群算法解决任务调度问题
引用本文:叶春晓,罗娟.基于网格的混合微粒群算法解决任务调度问题[J].计算机工程与应用,2012,48(12):34-37.
作者姓名:叶春晓  罗娟
作者单位:重庆大学 计算机学院,重庆 400030
基金项目:国家自然科学基金(No.60803027).
摘    要:网格任务分配是一个NP难问题,结合微粒群优化(Particle Swarm Optimization,PSO)算法,和网格自身的特性,提出了基于网格的混合微粒群算法。算法对问题的解空间进行变换、重定义,使之更加符合PSO算法的求解环境,实现了网格资源的优化分配。与离散微粒群(DPSO)算法和遗传算法进行了仿真比较,结果表明,新的PSO算法具有较好的性能。

关 键 词:网格任务分配  微粒群优化算法  解空间变换  

Grid-based Hybrid Particle Swarm Optimization algorithm for task allocation problem.
YE Chunxiao , LUO Juan.Grid-based Hybrid Particle Swarm Optimization algorithm for task allocation problem.[J].Computer Engineering and Applications,2012,48(12):34-37.
Authors:YE Chunxiao  LUO Juan
Affiliation:College of Computer Science, Chongqing University, Chongqing 400030, China
Abstract:Grid task allocation is a typical NP complete problem. According to the essence of grid and based on Particle Swarm Optimization algorithm, this paper proposes a new algorithm called Grid-based Hybrid Particle Swarm Optimization(GHPSO). This algorithm transforms and redefines the problem' s resolution space to make it more suitable to the problem-solving enviromrtent of PSO algorithm, achieves the optimal allocation of grid resources. The simulation results compared with the Discrete Particle Swarm Optimization algorithm and Genetic Algorithm show that this algorithm has better performance.
Keywords:grid task scheduling  Grid-based Hybrid Particle Swarm Optimization (GHPSO)  problem' s resolutionspace transformation
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机工程与应用》浏览原始摘要信息
点击此处可从《计算机工程与应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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