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}
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.