International Journal on Recent and Innovation Trends in Computing and Communication

Volume: 3 Issue: 4

ISSN: 2321-8169
1816 1820

_____________________________________________________________________________________________

A Review of Particle Swarm Optimization: Feature Selection, Classification and

Hybridizations
Madan Madhaw Shrivas
Research Scholar, Department of CSIT
Guru Ghasidas Vishwavidyalaya
Bilaspur, India
[email protected]

Amit Saxena

Leeladhar Kumar Gavel

Professor, Department of CSIT

Guru Ghasidas Vishwavidyalaya
Bilaspur, India
[email protected]

Research Scholar, Department of CSIT

Guru Ghasidas Vishwavidyalaya
Bilaspur, India
[email protected]

Abstract: Particle swarm optimization (PSO) is a recently grown, popular, evolutionary and conceptually simple but efficient
algorithm which belongs to swarm intelligence category. This paper outlines basic concepts and reviews PSO based techniques
with their applications to classification and feature selection along with some of the hybridized applications of PSO with similar
other techniques.
Keywords: Swarm Intelligence, Classification, Feature selection, Hybridization.

__________________________________________________*****_________________________________________________
I.

INTRODUCTION

The Particle Swarm Optimization (PSO) is a Meta heuristic search technique, biologically inspired from the
natures social behavior, dynamic movements and
communications of insects, birds and fish. It was introduced by
American social psychologist James Kennedy and electrical
Engineer Dr. Russell Eberhart in 1995[1, 2] and is often
considered under the category of Swarm-intelligence (SI) [3].
It is a population based stochastic global optimization
technique evolved to study the social behavior of insects, birds
or fish as why they move in a group searching for food
randomly in some area, knowing only the distance from the
food [4]. A PSO system combines local search methods
(through self experience) with global search methods (through
neighboring experience), attempting to balance exploration and
exploitation [5]. PSO has been successfully applied to various
areas including Prediction analysis [6], Multi-model
Optimization[7], Feature Selection [8], Association rule mining
[9], Text clustering [10], Pattern Recognition [11],
Clustering[12], Classification [13], Data mining[14], Image
Processing [15], Rule extractor[16] etc. Often, to achieve better
performance, a PSO is combined with soft computing
techniques to form a hybridized model discussed later in this
paper.
The rest of the paper is organized as follows. In the Section
II, we present the basic concepts of the PSO and its algorithm.
In section III, Literature Review on development of PSO is
presented. In Section IV, a literature Review on PSO based
Classification and Feature Selection is provided. Section V
presents PSO hybridization and applications followed by the
conclusions in Section VI.
II.

PSO is endowed with a flexible and well-balanced mechanism

to enhance the global and local exploration capabilities [19].
Similar to other population-based evolutionary algorithms,
PSO also initializes with the random population of particles
(like chromosomes in GA). Each particles flies through a
multidimensional search space with a velocity that is
dynamically and iteratively adjusted for the optimal solution by
updating the position of each particle based on its own
experience or that of its neighboring particles. A complete
description of PSO can be found in [1], however the pseudo
code a flowchart and of PSO are provided for ready reference
in Figure 1[20] and Figure 2[21] respectively.
The process for implementing the global version of PSO
algorithm is as follows [22]:
1) Initialize a population (array) of particles with random
positions and velocities on d dimensions in the problem
space.
2) For each particle, evaluate the desired optimization
fitness function in d variables.
3) Compare particles fitness evaluation with particles
pbest. If current value is better then pbest, then set pbest
value equal to the current location in d-dimensional
space.
4) Compare fitness evaluation with the populations overall
previous best. If current value is better then gbest, then
reset gbest to the current particles array index and value.
5) Change the velocity and position of the particle
according to equation (1) and (2) respectively.
vid = vid + c1* rand () * (pid - xid)
+ c2 * Rand () * (pgd - xid)
(1)
xid = xid + vid
(2)

BASIC CONCEPTS AND ALGORITHM

PSO relates to Artificial Life, bird flocks, fish schools and

swarm theory in particular. PSO is also associated with
Evolutionary Computing based techniques namely Genetic
Algorithms (GAs) [17] and Evolutionary Programming [18]

6)

Loop to step 2) until a criterion is met, usually a

sufficiently good fitness or a maximum number of
iterations (generations).
1816

IJRITCC |April 2015, Available @ http://www.ijritcc.org

_____________________________________________________________________________________

International Journal on Recent and Innovation Trends in Computing and Communication

Volume: 3 Issue: 4

ISSN: 2321-8169
1816 1820

_____________________________________________________________________________________________
Pseudo code for PSO:
For each particle
Initialize particle
END
Do
For each particle
Calculate fitness value
If the fitness value is better than the best fitness
value (Pbest) in history
Set current value as the new Pbest
End
Choose the particle with the best fitness value of all the
Particles as the gbest
For each particle
Calculate particle velocity according equation (1)
Update particle position according equation (2)
End
while maximum iterations or minimum error criteria are
not attained.
Figure 1. Pseudo code of PSO algorithm[20].

START

Initialize particles
ppiclesparticles

NO
Is current fitness
value
better than pbest?

Assign current
fitness as new pbest

Keep previous
pbest

Assign best particles pbest

value to gbest

LITERATURE REVIEW FOR PSO

A reasonably good amount of work has been reported in the

area of PSO. Kennedy and Eberhart, introduced the concept of
PSO based optimization methodology for continuous nonlinear
functions [1]. The duo introduced an enhancement of the
algorithm to operate on discrete binary variables [23]. Shi and
Eberhart introduced inertia weight as a new parameter into the
original particle swarm optimizer [24]. Angeline [25] described
an evolutionary optimization algorithm based on hybrid model.
Shi and Eberhart [26] studied the performance of the PSO with
linearly decreasing inertia weight. Eberhart and hu [27]
proposed a new technique based on PSO and ANN to classified
human tremor (Parkinsons) disease. Lvbjerg et al. [28]
introduced two hybrids PSO based on evolutionary algorithms
(GA and PSO) to combine the traditional velocity and position
update rules with the ideas of breeding and subpopulations.
Parsopoulos et. al [29] proposed a Stretching technique by
combining. Stretching with the PSO, this was capable of
escaping from local minima and effectively locates the global
ones. Fourie and Groenwold [30] introduced two new operators
in the PSO, namely the elite velocity and the elite particle,
which is used for the shape and size optimization problems in
structural design. Abido [31] presented the PSO algorithm to
solve the optimal power flow (OPF) problem. Salman et al.
[32] proposed the PSO algorithm for the task assignment
problem for homogeneous distributed computing systems.
Saxena and Vora[33] discussed the small world theory of PSO.
IV.

Calculate fitness values

for each particle

Yes

III.

FEATURE SELECTION AND CLASSIFICATION

USING PSO

Elimination of irrelevant, harmful, redundant and noisy

features from the datasets to increase the classification accuracy
is termed as feature selection. Classification is the process of
organizing data into suitable categories on the basis of some
criteria. When the set of possible categories is known in
advance, classification under this situation is called supervised
classification while the situation when possible classes are not
known in advance is called unsupervised classification.
Looking to their extensive applications in various data
processing techniques, Feature selection and Classification
have been studied widely. A numerous successful
implementations of feature selection and classification to
various applications are summarized in Table I.
TABLE I.

Calculate velocity for each

particle

FEATURE SELECTION AND CLASSIFICATION USING PSO

Purpose*: C-Classification, F-Feature Selection

S.
N./year

Use each particles velocity

value to update its data values

NO

Authors

Purpose*

1/2004

Tiago
Sousa et.
al [13]

2./2007

De Falco
et al.
[34 ]

Yes
Target or maximum
epochs reached?
End

Figure 2. Flow diagram illustrating the PSO algorithm [21].

Tools

Description

GA
and
Tree
Induction
Algorithm
and J48a
Java
implementa
tion of C4.5
ANN

Proposed
particle
Swarm Optimizer as a
new tool for Data
Mining algorithm for
classification tasks or
rule discovery.

Proposed
Particle
Swarm Optimization
to face the problem of
classification
of
instances in databases.

1817
IJRITCC |April 2015, Available @ http://www.ijritcc.org

_____________________________________________________________________________________

International Journal on Recent and Innovation Trends in Computing and Communication

Volume: 3 Issue: 4

ISSN: 2321-8169
1816 1820

_____________________________________________________________________________________________
3/2007

Qi Shen
et al.
[ 35]

Support
Vector
machine
(SVM)

Proposed
discrete
particle
swarm
optimization
(PSO)
with support vector
machines (SVM) for
tumor classification.

4/2008

Qi Shen
et al.
[36 ]

Pure Tabu
search (TS)
and hybrid
PSO

Proposed a hybrid
PSO
and
TS
(HPSOTS) approach
for gene selection for
tumor classification.

5/2008

Li-Yeh
Chuang
et al.
[37]

Binary
PSO,
KNN, BPNN
and PNN

Proposed
binary
particle
swarm
optimization with KNN method for gene
expression
data
classification
problems.

6 /2010

Alper
Unler
,Alper
Murat
[38]

logistic
regression

Proposed
modified
discrete particle swarm
optimization
(PSO)
algorithm
for
investigates the feature
subset
selection
problem for the binary
classification problem
using
logistic
regression model.

7/2011

Alper
Unler
et.al.[39]

SVM

Proposed a hybrid
filter wrapper feature
subset
selection
algorithm based on
PSO and SVM.

8/2012

PeiChann
Chang et
al [40]

C, F

Case base
reasoning(
CBR)

Proposed integrating a
case-based reasoning
and particle swarm
optimization
based
hybrid
model
for
medical
data
classification.

9/2013

Abdulha
mit
Subasi
[41]

SVM, PSO
,K-NN

10/2014

Bing
Xue, et.
al
[42 ]

F,C

LDA,
KNN, PSO

11/2014

H.
Hannah
Inbarani
et al.
[43 ]
Subhajit
Kar et al.
[ 44]

Nave
Bayes,
Rough set
and PSO

Proposed A novel
PSO-SVM model that
has been hybridized
the PSO and SVM to
improve the EMG
signal
classification
accuracy.
Proposed a PSO based
feature
selection
approach to selecting a
smaller number of
features for better
classification
performance.
Introduced hybridized
approach
for
the
diseases diagnosis.

PSO, KNN
,SVM

12/2015

13/2015

Yong
Zhang

PSO, 1 NN

Proposed a PSO
adaptive
K-nearest
neighborhood (KNN)
based gene selection
method for proper
classification
of
microarray data.
Proposed binary BPSO
method to find optimal

Dunwei
Gong
et.al.[45]

V.

feature subset.

PSO BASED HYBRIDIZATION AND

APPLICATIONS

PSO has been combined with several other standard and

popular techniques to form a hybrid. The benefit of forming a
hybrid is that when a single algorithm (say PSO) finds some
limitation on a particular point, then some other technique (say
X) can overcome that limitation and both techniques can
complement each others weaknesses and jointly produce better
results. Some of the hybridizations of PSO are presented in
following section. Later we outline some of the applications of
PSO although there have been many but it is not possible to
cover all at one place.
A. PSO based Hybridization
Hybridization is a process of combining various established
or efficient techniques such that the overall performance of the
combination of the algorithm is improved. PSO can be
hybridized with other techniques to enhance the overall
performance and hence results. Some of the hybridizations of
PSO with other techniques are as follows:
Hybridization of PSO with Genetic Algorithm (GA): GA [17] is
a very powerful optimization technique. PSO can work together
with GA to outperform results as obtained by individually by
either PSO or GA.
Hybridization of PSO with Ant Colony Optimization (ACO):
The structure of ACO [46] is naturally suited for solving
discrete problems. In ACO, the movement of ants is studied
similar to birds in PSO. PSO and ACO combination is favored
for solving discrete optimization problems like scheduling.
Hybrid version PSO and ACO applied for the application of
engineering design [47] etc.
Hybridization of PSO with Differential Evolution (DE): DE[48]
uses the same evolutionary operators (selection, crossover and
mutation) as that of GA but its working are distinct from GA.
PSO and DE is used for the application of Medical image
processing[49] etc.
Hybridization of PSO with other Algorithms: PSO can be
hybridized with other well established techniques including:
Fuzzy Logic [50], Rough Set [51], Neural Network [52] etc.
B. Other applications Of PSO
In PSO, each particle can be treated as a multidimensional
vector and the particle moves alone in the swarm as a
prospective solution to the fitness function. PSO algorithm has
been successfully applied in several fields, listing a few are
optimal capacitor placement in Distribution systems [53], Peerto-peer networks [54], nonlinear resource allocation problem
[55] and others.
VI.

CONCLUSION

This paper presents an overview of PSO and PSO based

algorithms. PSO has been applied to extensive areas of research
and industrial applications. Like evolutionary computing based
1818

IJRITCC |April 2015, Available @ http://www.ijritcc.org

_____________________________________________________________________________________

International Journal on Recent and Innovation Trends in Computing and Communication

Volume: 3 Issue: 4

ISSN: 2321-8169
1816 1820

_____________________________________________________________________________________________
algorithms GAs, it starts with particles (like chromosomes in
GA) flying with an initial random velocities in various
directions (locations). Both locations and velocities are updated
with iterations until a satisfactory solution is reached. The
applications of PSO to feature selection and classification have
been widely published and briefly presented in this paper. PSO
with GA and other techniques when hybridized together can
produce better results compared to technique applied alone.
Such hybridizations on few areas have been provided in this
paper. It can be concluded that slowly but constantly PSO is
also going to become an essential tool for optimization
problems and that will be a challenging task for researchers.
REFERENCES
[1]

[2]

[3]
[4]

[5]

[6]

[7]

[8]

[9]

[10]

[11]

[12]

[13]
[14]

[15]

[16]

[17]

J. Kennedy and R. C. Eberhart, Particle swarm optimization, Proc. of

IEEE International Conference on Neural Networks (ICNN), Vol. IV,
pp.1942-1948, Perth, Australia, 1995.
R. C. Eberhart and J. Kennedy , A new optimizer using particle swarm
theory, Proceedings of the Sixth International Symposium on Micro
Machine and Human Science, Nagoya, Japan, pp.39-43. Piscataway, NJ:
IEEE Service Center, 1995.
J. Kennedy, R.C. Eberhart, Y. Shi, Swarm Intelligence, Morgan
Kaufmann Publishers Inc., San Francisco,CA, 2001.
Gintautas Garva, Paulius Danenas, Particle swarm optimization for
linear support vector machines based classifier selection, Nonlinear
Analysis: Modelling and Control, Vol. 19, No. 1, 2642, 2014,
Qing Zhu , Limin Qian , Yingchun Li ,Shanjun Zhu, An Improved
Particle Swarm Optimization Algorithm for Vehicle Routing Problem
with Time Windows, in: Proceeding IEEE Congress on Evolutionary
Computation( CEC 2006), pp. 1386 1390, 2006.
H.-L. Chen, B.Yang, G.Wang, J. Liu, X. Xu, S.- J. Wang, D.-Y.Liu, A
novel bankruptcy prediction model based on an adaptive fuzzy k-nearest
neighbor method, Knowl.-Based Syst. 24(8) (2011) 1348-1359, 2011.
James Kennedy, William M. Spears, Matching Algorithms to Problems:
An Experimental Test of the Particle Swarm and Some Genetic
Algorithms on the Multimodal Problem Generator, In Proceedings of the
IEEE International Conference on Evolutionary Computation, PP. 78-83
1998.
X. Wang, J. Yang, X.Teng, W. Xia, R.Jensen, Feature selection based on
rough sets and particle swarm optimization, Pattern Recognit. Lett. 28
(4) (2007) 459471, 2007
R.Pears, Y.S.Koh, Weighted association rule mining using particle
swarm optimization, in: New Frontiers in Applied DataMining, Springer,
pp. 327338, 2012.
X. Cui, T.E. potok. P. palathingal, Document clustering using particle
swarm optimization, In: proceedings of the 2005 IEEE swarm
intelligence symposium , pp.185-191, 2005
S. Kalyani, K.s.swarup, Classifier design for static security assessment
using particle swarm optimization, Applied soft computing 11 , 658-666,
2011.
D.W. Van der merwe , A.P. Engelbrecht, Data Clustering using Particle
swarm optimization, : In the proceedings of IEEE congress on
Evolutionary Computation, CEC03 (Volume: 1) IEEE, PP.215-220, 2003.
T.Sousa, A.Silva, A.Neves, Particle swarm based data mining algorithms
for classification tasks, Parallel Comput. 30(5) , 767783, 2004.
M. Ghannad-Rezaie, H. Soltananian-Zadehand, M.-R.Sia dat, and
K.V.Elisevich, Medical data mining using swarm optimization for
temporal lobe epilepsy, In IEEE Congress on Evolutionary Computation,
CEC 2006, pages 761-768, 2006.
M. Omran, A. salman and A.P. Engelbrecht, Image classificaion using
particle Swarm Optimization, In: proceedings of the Fourth Asia-Pacific
Conference on Simulated Evolution and Learning (SEAL,2002),
Singapore, pp. 370-374, 2002.
Yi-Zeng Hsieh , Mu-Chun Su , Pa-Chun Wang, A PSO-based rule
extractor for medical diagnosis, Journal of Biomedical Informatics, 49
(2014) 5360, 2014.
D.E.Goldberg, Genetic algorithms in search, optimization and machine
Learning, Addison- Wesley, reading, mA, 1989.

[18] L. J.Fogel, A. J. Marsh, M. J. Walsh, Artificial Intelligence through

Simulated evolution, wiley & sons, New York, 1966
[19] M.A. Abido, Optimal design of power-system stabilizers using particle
swarm optimization, IEEE transaction on Energy Conversion, 17(3) ,
406-413, 2002.
[20] PSO Tutorial, http://www.swarmintelligence.org/tutorials.php.
[21] http://www.mnemstudio.org/particle-swarm-introduction.htm.
[22] R.C. Eberhart, Y. Shi, Particle Swarm Optimization: Developments,
Applications and Resources, in: Proceedings of the IEEE International
Conference on Evolutionary Computation, vol.1, pp. 81 -86, 2001.
[23] J. Kennedy, and R.C. Eberhart ,A discerete binary version of the Particle
swarm algorithm, Proceedings of Conf. on Systems,
Man,
and Cybernetics, pp.4104-4109.IEEE Service Center, Piscataway, NJ,
1997.
[24] Y. Shi and R.C. Eberhart A modified particle swarm optimizer,
Proceedings of Congress on Evolutionary Computation, pp.69-73, 1998.
[25] P. J. Angeline, Using Selection to Improve Particle Swarm
Optimization, In Proceedings of IEEE international Conf. on
Evolutionary Computation, IJCNN99, pp. 8489, Washington, USA,
July 1998.
[26] Y. Shi and R.C. Eberhart, Empirical study of particle swarm
optimization, Proceedings of the 1999 Congress on Evolutionary
Computation, 1945-1950, 1999.
[27] Russell C. Eberhart, Xiaohui hu, Human tremor analys using Particle
Swarm Optimization, Proceedings of the IEEE congress on Evolutionary
Computation,vol. 3 , pp.1927-1930, 1999.
[28] M. Lvbjerg, T.K Rasmussen, T. Krink, Hybrid particle swarm optimiser
with breeding and subpopulations, in: Proceedings of the Genetic and
Evolutionary Computation Conference, 2001.
[29] K.E. Parsopoulos, V.P. Plagianakos, G.D. Magoulas, M.N. Vrahatis,
Improving particle swarm optimizer by function stretching, Advances
in Convex Analysis and Global Optimization, Volume 54 pp. 445457,
2001.
[30] P.C. Fourie and A.A. Groenwold, The particle swarm optimization
algorithm in size and shape Optimization, Struct. Multidisc. Optim.
Volume 23, Issue 4, pp. 259267, Springer-Verlag 2002.
[31] M.A. Abido,Optimal power flow using Particle swarm optimization,
Electrical Power and Energy System, 24, 563-571, 2002.
[32] Ayed Salman, Imtiaz Ahmad, Sabah Al-Madani, Particle swarm
optimization for task assignment problem, Microprocessors and
Microsystems, vol. 26 ,no 8, 363371, 2002.
[33] A.K. Saxena, M. Vora, Novel Approach for the use of Small World
Theory in Particle Swarm Optimization, IEEE International Conference
on Advanced Computing and Communications (ADCOM 2008), pp. 363
366, Publication Year, 2008 .
[34] I. De Falco, A. Della Cioppa, E. Tarantino, Facing classification
problems with Particle Swarm Optimization,
Applied Soft
Computing, 7 , 652658, 2007.
[35] Qi Shen, Wei-Min Shi, Wei Kong, Bao-Xian Ye, A combination of
modified particle swarm optimization algorithm and support vector
machine for gene selection and tumor classification, Talanta ,71 , 1679
1683, 2007.
[36] Qi Shen, Wei-Min Shi , Wei Kong , Hybrid particle swarm optimization
and tabu search approach for selecting genes for tumor classification
using gene expression data, Computational Biology and Chemistry, 32 ,
5360 , 2008.
[37] Li-Yeh Chuang, Hsueh-Wei Chang, Chung-Jui Tu , Cheng-Hong Yang,
Improved binary PSO for feature selection using gene expression data,
Computational Biology and Chemistry, 32 , 2938, 2008.
[38] Alper Unler, Alper Murat, A discrete particle swarm optimization
method for feature selection in binary Classification problems, European
Journal of Operational Research, 206 , 528539, 2010.
[39] Alper Unler , Alper Murat , Ratna Babu Chinnam , mr2PSO: A
maximum relevance minimum redundancy feature selection method based
on swarm intelligence for support vector machine classification,
Information Sciences, 181 , 46254641, 2011.
[40] Pei-Chann Chang, Jyun-Jie Lin, Chen-Hao Liu, An attribute weight
assignment and particle swarm
Optimization algorithm
for medical database classifications, computer methods and programs in
biomedicine, 107, 382-392, 2012.

1819
IJRITCC |April 2015, Available @ http://www.ijritcc.org

_____________________________________________________________________________________

International Journal on Recent and Innovation Trends in Computing and Communication

Volume: 3 Issue: 4

ISSN: 2321-8169
1816 1820

_____________________________________________________________________________________________
[41] Abdulhamit Subasi, Classification of EMG signals using PSO optimized
SVM for diagnosis of neuromuscular disorders, Computers in Biology
and Medicine, 43 , 576586, 2013.
[42] Bing Xue, Mengjie Zhang, Will N. Browne, Particle swarm
optimisation for feature selection in classification:Novel initialisation and
updating mechanisms, Applied Soft Computing, 18 , 261276, 2014.
[43] H. Hannah Inbarani , Ahmad Taher Azar, G. Jothi , Supervised hybrid
feature selection based on PSO and rough sets for medical diagnosis,
computer methods and programs in biomedicine, 113 , 175185, 2014.
[44] Subhajit Kar , Kaushik Das Sharma, Madhubanti Maitra, Gene selection
from microarray gene expression data for classification of cancer
subgroups employing PSO and adaptive K-nearest neighborhood
technique, Expert Systems with Applications, 42 , 612627, 2015.
[45] Yong Zhang, Dunwei Gong, Ying Hu,Wanquiu Zhang, Feature selection
algorithm based on bare bones particle swarm optimization,
Neurocomputing, 146 , 150-157, 2015.
[46] Marco Dorigo and Thomas Stutzle, Ant colony optimization, A
Bradford Book, 2004.
[47] S. Kavehand, Talatahari, Particle swarm optimizer, ant colony strategy
and harmony search scheme hybridized for optimization of truss
structures, Computer Structure, 87, 267-283,2009.
[48] K. V. Price, R. M. Storn, and J. A. Lampinen, Differential Evolution:A
Practical Approach to Global Optimization, Springer,
Berlin,
Germany, 2005.
[49] H. Talbi, M. Batouche, Hybrid particle swarm with differential evolution
for multimodal image registration, Proceedings of the IEEE International
Conference on Industrial Technology 3 , 15671573, 2004.
[50] Hajizadeh, A, Norum, L.,Golkar, M.A., A fuzzy-PSO based controller
for hybrid fuel cell power systems during voltage sag, IEEE
International Conference on Clean Electrical Power , pp. 147 153, 2009.
[51] S. Das, A. Abraham, S.K. Sarkar, A Hybrid Rough Set--Particle Swarm
Algorithm for Image Pixel Classification, IEEE Sixth International
Conference on, Hybrid Intelligent Systems 2, HIS '06, pp. 26 DOI:
10.1109/HIS.2006.264909, 2006.
[52] M. Hajihassani, D. Jahed Armaghani, H. Sohaei, E. Tonnizam Mohamad,
A. Marto, Prediction of airblast-overpressure induced by blasting using a
hybrid artificial neural network and particle swarm optimization,
Applied Acoustics, 80 , 5767, 2014.
[53] Yu XM, Xiong XY, Wu YW. A PSO - based approach to optimal
capacitor placement with harmonic distortion consideration, Electr
Power Sys Res 2004, 71(1):2733, 2004.
[54] Shichang Sun, Ajith Abraham, Guiyong Zhang, Hongbo Liu, A Particle
Swarm Optimization Algorithm for Neighbor Selection in Peer-to-Peer
Networks, IEEE, 6th International Conference on Computer Information
Systems and Industrial Management Applications (CISIM'07), 0-76952894-5/07 $20.00 2007, IEEE., 2007.
[55] Peng-Yeng Yin, Jing-Yu Wang, A particle swarm optimization
approach to the nonlinear resource allocation problem, Applied
Mathematics and Computation, 183 , 232242, 2006.

1820
IJRITCC |April 2015, Available @ http://www.ijritcc.org

_____________________________________________________________________________________