基于改进粒子群算法的网格资源分配优化

Zhi-Yun Zheng, Tian-xu Zhao, Yong Zhang, Li-ping Lu
{"title":"基于改进粒子群算法的网格资源分配优化","authors":"Zhi-Yun Zheng, Tian-xu Zhao, Yong Zhang, Li-ping Lu","doi":"10.1109/IFITA.2010.330","DOIUrl":null,"url":null,"abstract":"To solve the problem of grid resource allocation for tasks, an allocation algorithm based on improved particle swarm optimization was proposed. This algorithm leaded the cross operation, variation operation and select operation of the GA to the Particle Swarm Optimization Algorithm, it effectively overcame the inherent flaw of getting local optimal value by particle swarm algorithm and find the global optimum value in the search space again. The method is simple, needs less parameters, easy to programme, and ensures that particles in the update process control in integer space, avoiding unnecessary rounding of real numbers, and into local optimum problem, speeds up the convergence rate. After searching of particle in each sub-swarm, an optimal scenario for grid resource allocation was produced. Simulation experiments demonstrated effectivness and feasibility of the algorithm and achieves a better result in the aspect of grid resource allocation.","PeriodicalId":393802,"journal":{"name":"2010 International Forum on Information Technology and Applications","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Optimization of Grid Resource Allocation Using Improved Particle Swarm Optimization Algorithm\",\"authors\":\"Zhi-Yun Zheng, Tian-xu Zhao, Yong Zhang, Li-ping Lu\",\"doi\":\"10.1109/IFITA.2010.330\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"To solve the problem of grid resource allocation for tasks, an allocation algorithm based on improved particle swarm optimization was proposed. This algorithm leaded the cross operation, variation operation and select operation of the GA to the Particle Swarm Optimization Algorithm, it effectively overcame the inherent flaw of getting local optimal value by particle swarm algorithm and find the global optimum value in the search space again. The method is simple, needs less parameters, easy to programme, and ensures that particles in the update process control in integer space, avoiding unnecessary rounding of real numbers, and into local optimum problem, speeds up the convergence rate. After searching of particle in each sub-swarm, an optimal scenario for grid resource allocation was produced. Simulation experiments demonstrated effectivness and feasibility of the algorithm and achieves a better result in the aspect of grid resource allocation.\",\"PeriodicalId\":393802,\"journal\":{\"name\":\"2010 International Forum on Information Technology and Applications\",\"volume\":\"27 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-07-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 International Forum on Information Technology and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IFITA.2010.330\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 International Forum on Information Technology and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IFITA.2010.330","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

为解决网格任务资源分配问题,提出了一种基于改进粒子群算法的网格任务资源分配算法。该算法将遗传算法的交叉操作、变异操作和选择操作引入粒子群优化算法,有效地克服了粒子群算法获得局部最优值的固有缺陷,重新在搜索空间中找到全局最优值。该方法简单,所需参数少,易于编程,且保证了粒子在更新过程中控制在整数空间,避免了实数不必要的舍入,并转化为局部最优问题,加快了收敛速度。通过对每个子群中的粒子进行搜索,得到网格资源分配的最优方案。仿真实验证明了该算法的有效性和可行性,在网格资源分配方面取得了较好的效果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Optimization of Grid Resource Allocation Using Improved Particle Swarm Optimization Algorithm
To solve the problem of grid resource allocation for tasks, an allocation algorithm based on improved particle swarm optimization was proposed. This algorithm leaded the cross operation, variation operation and select operation of the GA to the Particle Swarm Optimization Algorithm, it effectively overcame the inherent flaw of getting local optimal value by particle swarm algorithm and find the global optimum value in the search space again. The method is simple, needs less parameters, easy to programme, and ensures that particles in the update process control in integer space, avoiding unnecessary rounding of real numbers, and into local optimum problem, speeds up the convergence rate. After searching of particle in each sub-swarm, an optimal scenario for grid resource allocation was produced. Simulation experiments demonstrated effectivness and feasibility of the algorithm and achieves a better result in the aspect of grid resource allocation.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信