An efficient resource allocation scheme using particle swarm optimization

Yue Jiao Gong, Jun Zhang, Henry Shu Hung Chung, Wei Neng Chen, Zhi Hui Zhan, Yun Li, Yu Hui Shi

Research output: Contribution to journalArticle

64 Citations (Scopus)

Abstract

Developing techniques for optimal allocation of limited resources to a set of activities has received increasing attention in recent years. In this paper, an efficient resource allocation scheme based on particle swarm optimization (PSO) is developed. Different from many existing evolutionary algorithms for solving resource allocation problems (RAPs), this PSO algorithm incorporates a novel representation of each particle in the population and a comprehensive learning strategy for the PSO search process. The novelty of this representation lies in that the position of each particle is represented by a pair of points, one on each side of the constraint hyper-plane in the problem space. The line joining these two points intersects the constraint hyper-plane and their intersection point indicates a feasible solution. With the evaluation value of the feasible solution used as the fitness value of the particle, such a representation provides an effective way to ensure the equality resource constraints in RAPs are met. Without the distraction of infeasible solutions, the particle thus searches the space smoothly. In addition, particles search for optimal solutions by learning from themselves and their neighborhood using the comprehensive learning strategy, helping prevent premature convergence and improve the solution quality for multimodal problems. This new algorithm is shown to be applicable to both single-objective and multiobjective RAPs, with performance validated by a number of benchmarks and by a real-world bed capacity planning problem. Experimental results verify the effectiveness and efficiency of the proposed algorithm.

LanguageEnglish
Article number6148273
Pages801-816
Number of pages16
JournalIEEE Transactions on Evolutionary Computation
Volume16
Issue number6
Early online date7 Feb 2012
DOIs
Publication statusPublished - 10 Dec 2012

Fingerprint

Resource Allocation
Particle swarm optimization (PSO)
Resource allocation
Particle Swarm Optimization
Learning Strategies
Joining
Evolutionary algorithms
Capacity Planning
Premature Convergence
Resource Constraints
Equality Constraints
Optimal Allocation
Particle Swarm Optimization Algorithm
Intersect
Planning
Fitness
Evolutionary Algorithms
Optimal Solution
Intersection
Benchmark

Keywords

  • bed capacity planning
  • multiobjective resource allocation problem (MORAP)
  • particle swarm optimization (PSO)
  • resource allocation problem (RAP)

Cite this

Gong, Y. J., Zhang, J., Chung, H. S. H., Chen, W. N., Zhan, Z. H., Li, Y., & Shi, Y. H. (2012). An efficient resource allocation scheme using particle swarm optimization. IEEE Transactions on Evolutionary Computation, 16(6), 801-816. [6148273]. https://doi.org/10.1109/TEVC.2012.2185052
Gong, Yue Jiao ; Zhang, Jun ; Chung, Henry Shu Hung ; Chen, Wei Neng ; Zhan, Zhi Hui ; Li, Yun ; Shi, Yu Hui. / An efficient resource allocation scheme using particle swarm optimization. In: IEEE Transactions on Evolutionary Computation. 2012 ; Vol. 16, No. 6. pp. 801-816.
@article{b9364a8627754841bcc825833efeaf8a,
title = "An efficient resource allocation scheme using particle swarm optimization",
abstract = "Developing techniques for optimal allocation of limited resources to a set of activities has received increasing attention in recent years. In this paper, an efficient resource allocation scheme based on particle swarm optimization (PSO) is developed. Different from many existing evolutionary algorithms for solving resource allocation problems (RAPs), this PSO algorithm incorporates a novel representation of each particle in the population and a comprehensive learning strategy for the PSO search process. The novelty of this representation lies in that the position of each particle is represented by a pair of points, one on each side of the constraint hyper-plane in the problem space. The line joining these two points intersects the constraint hyper-plane and their intersection point indicates a feasible solution. With the evaluation value of the feasible solution used as the fitness value of the particle, such a representation provides an effective way to ensure the equality resource constraints in RAPs are met. Without the distraction of infeasible solutions, the particle thus searches the space smoothly. In addition, particles search for optimal solutions by learning from themselves and their neighborhood using the comprehensive learning strategy, helping prevent premature convergence and improve the solution quality for multimodal problems. This new algorithm is shown to be applicable to both single-objective and multiobjective RAPs, with performance validated by a number of benchmarks and by a real-world bed capacity planning problem. Experimental results verify the effectiveness and efficiency of the proposed algorithm.",
keywords = "bed capacity planning, multiobjective resource allocation problem (MORAP), particle swarm optimization (PSO), resource allocation problem (RAP)",
author = "Gong, {Yue Jiao} and Jun Zhang and Chung, {Henry Shu Hung} and Chen, {Wei Neng} and Zhan, {Zhi Hui} and Yun Li and Shi, {Yu Hui}",
year = "2012",
month = "12",
day = "10",
doi = "10.1109/TEVC.2012.2185052",
language = "English",
volume = "16",
pages = "801--816",
journal = "IEEE Transactions on Evolutionary Computation",
issn = "1089-778X",
number = "6",

}

Gong, YJ, Zhang, J, Chung, HSH, Chen, WN, Zhan, ZH, Li, Y & Shi, YH 2012, 'An efficient resource allocation scheme using particle swarm optimization' IEEE Transactions on Evolutionary Computation, vol. 16, no. 6, 6148273, pp. 801-816. https://doi.org/10.1109/TEVC.2012.2185052

An efficient resource allocation scheme using particle swarm optimization. / Gong, Yue Jiao; Zhang, Jun; Chung, Henry Shu Hung; Chen, Wei Neng; Zhan, Zhi Hui; Li, Yun; Shi, Yu Hui.

In: IEEE Transactions on Evolutionary Computation, Vol. 16, No. 6, 6148273, 10.12.2012, p. 801-816.

Research output: Contribution to journalArticle

TY - JOUR

T1 - An efficient resource allocation scheme using particle swarm optimization

AU - Gong, Yue Jiao

AU - Zhang, Jun

AU - Chung, Henry Shu Hung

AU - Chen, Wei Neng

AU - Zhan, Zhi Hui

AU - Li, Yun

AU - Shi, Yu Hui

PY - 2012/12/10

Y1 - 2012/12/10

N2 - Developing techniques for optimal allocation of limited resources to a set of activities has received increasing attention in recent years. In this paper, an efficient resource allocation scheme based on particle swarm optimization (PSO) is developed. Different from many existing evolutionary algorithms for solving resource allocation problems (RAPs), this PSO algorithm incorporates a novel representation of each particle in the population and a comprehensive learning strategy for the PSO search process. The novelty of this representation lies in that the position of each particle is represented by a pair of points, one on each side of the constraint hyper-plane in the problem space. The line joining these two points intersects the constraint hyper-plane and their intersection point indicates a feasible solution. With the evaluation value of the feasible solution used as the fitness value of the particle, such a representation provides an effective way to ensure the equality resource constraints in RAPs are met. Without the distraction of infeasible solutions, the particle thus searches the space smoothly. In addition, particles search for optimal solutions by learning from themselves and their neighborhood using the comprehensive learning strategy, helping prevent premature convergence and improve the solution quality for multimodal problems. This new algorithm is shown to be applicable to both single-objective and multiobjective RAPs, with performance validated by a number of benchmarks and by a real-world bed capacity planning problem. Experimental results verify the effectiveness and efficiency of the proposed algorithm.

AB - Developing techniques for optimal allocation of limited resources to a set of activities has received increasing attention in recent years. In this paper, an efficient resource allocation scheme based on particle swarm optimization (PSO) is developed. Different from many existing evolutionary algorithms for solving resource allocation problems (RAPs), this PSO algorithm incorporates a novel representation of each particle in the population and a comprehensive learning strategy for the PSO search process. The novelty of this representation lies in that the position of each particle is represented by a pair of points, one on each side of the constraint hyper-plane in the problem space. The line joining these two points intersects the constraint hyper-plane and their intersection point indicates a feasible solution. With the evaluation value of the feasible solution used as the fitness value of the particle, such a representation provides an effective way to ensure the equality resource constraints in RAPs are met. Without the distraction of infeasible solutions, the particle thus searches the space smoothly. In addition, particles search for optimal solutions by learning from themselves and their neighborhood using the comprehensive learning strategy, helping prevent premature convergence and improve the solution quality for multimodal problems. This new algorithm is shown to be applicable to both single-objective and multiobjective RAPs, with performance validated by a number of benchmarks and by a real-world bed capacity planning problem. Experimental results verify the effectiveness and efficiency of the proposed algorithm.

KW - bed capacity planning

KW - multiobjective resource allocation problem (MORAP)

KW - particle swarm optimization (PSO)

KW - resource allocation problem (RAP)

UR - http://www.scopus.com/inward/record.url?scp=84870558007&partnerID=8YFLogxK

U2 - 10.1109/TEVC.2012.2185052

DO - 10.1109/TEVC.2012.2185052

M3 - Article

VL - 16

SP - 801

EP - 816

JO - IEEE Transactions on Evolutionary Computation

T2 - IEEE Transactions on Evolutionary Computation

JF - IEEE Transactions on Evolutionary Computation

SN - 1089-778X

IS - 6

M1 - 6148273

ER -