Index
a d
Absorbing Markov process, 261
Agent-based models, 2830
Almost sure convergence, 231
Ant colony optimization, 1516
Attractive and repulsive PSO
(ARPSO),133
b Dynamic multi-swarm particle swarm
Bare bone PSO family, 105107
Basic random search (BRS) algorithm,
253, 254
Blind random search, 4, 5
Borel algebra, 230
Bound state, 165, 167
c Evolutionary programming (EP), 1011
Canonical PSO, 38, 94
Collective behavior, 2830
Combinatorial optimization, 1
Comprehensive learning PSO (CLPSO),
133, 134
Contractionexpansion (CE)
coefficient,144145, 179
Contraction mapping, 270, 271
Convergence
in distribution, 231
in mean of order r, 232
in probability, 231
rate, 279282
Cooperative PSO, 134, 135
Cooperative QPSO, 217219
Delaunay triangulation, 101
Deterministic methods, 3
Differential evolution, 1214
Direct search methods, 4
Discrete binary PSOs, 124128
Discrete Markov process, 260
Dissipative PSO, 135, 136
Diversity measure, 50
optimiser (DMS-PSO), 98
Dynamic topologies, 97104
e
Economic dispatch problems, 335339
Enumeration methods, 3
Euler constant, 145, 235
Evolutionary algorithms (EA), 711
Evolution strategy (ES), 910
Exponential PSO, 111113
f
Fitnessdistance ratiobased PSO (FDR-
PSO), 98
Fixed-point theorem, 271
Fully informed particle swarm (FIPS), 96
Fuzzy C means (FCM), 376, 377
g
GA/PSO algorithm, 131, 132
Gaussian-dynamic particle swarm
(GDPS), 108
395
396 index
Gaussian PSO, 109, 110, 113
Genetic algorithm (GA), 78
Genetic programming (GP), 9
Global best model, 75, 76
Global convergence, 254, 255
Gradient methods, 3
h
Hidden Markov model (HMM), 349, 350
Hybrid PSO with breeding and sub-
population, 132, 133
i
Image segmentation, 367, 376
Independent identically distributed (i.i.d.)
random variables, 230
Infinite impulse response (IIR) filters,
322, 323
Integer programming, 2
Inverse heat conduction problem (IHCP),
304313
Inverse problems, 303322
K
Khintchines weak law of large
numbers,233
Kolmogorovs strong law of large
numbers, 232
l
Lvy PSO, 114, 115
Linear programming, 2
Local best model, 76, 94104
Localised random search, 5
m
Markov transfer kernel function, 259
Measurable space, 230
Menger PM space, 269
Metaheuristic methods, 614
Minmax optimisation, 2
Monte Carlo inverse transformation, 171
Multi-objective optimisation, 2
Multipeak optimisation problems, 193202
Multiple sequence alignment (MSA),
347350
n
Neighbourhood topologies, 95
Non-linear dynamical systems, 313322
Non-linear programming, 2
O
Optimisation
methods, 14
problems, 12
Original PSO, 3537
OTSU measure, 368, 369
p
Particle swarm optimisation (PSO), 14, 17,
2327, 3045
extended with self-organised criticality
(SOC PSO), 135
with constriction factor (PSO-Co), 37,
9394
with differential evolution, 129
with inertia weights (PSO-In), 37,
7793
with linkage learning, 129131
with mutation operators, 115124
with neighbourhood operator, 95, 96
with selection operator, 128
with spatial particle extension, 136
Probabilistic boundedness, 233, 234,
243246
Probabilistic metric (PM) spaces, 268
Probabilistic models, 249
Probability
measure, 173
space, 230
PSO, see Particle swarm
optimisation(PSO)
q
QPSO, see Quantum-behaved particle
swarm optimisation (QPSO)

Quantum-behaved particle swarm
optimisation (QPSO), 17,
178184
Type 1, 179
Type 2, 179
with diversity control strategy, 208211
with hybrid distribution, 215217
with mutation operators, 214, 215
with selection operators, 211213
Quantum harmonic oscillator (QHO)
field, 176
Quantum potential well, 168
r
Random search methods, 46
Random variable, 230
s
Sample space, 230
Schrdinger equation, 166, 167
Self-organisation, 28
index 397
Simulated annealing, 67
Small world network, 102, 103
Species-based PSO (SPSO), 104
Species-based QPSO (SQPSO),
194196
Stochastic programming, 2
Swarm intelligence (SI), 1517
t
Tabu search, 1112
Time complexity, 277, 278
Trimmed-uniform particle swarm
(TUPS), 108
v
Von Neumann topology, 96, 97
Voronoi neighbourhood, 99
w
Wave function, 166