Accelerating particle swarm optimization using crisscross search

Anbo Meng, Zhuan Li, Hao Yin, Sizhe Chen, Zhuangzhi Guo
Information Sciences

Volume 329, 1 February 2016, Pages 5272

Special issue on Discovery Science

This paper introduces a novel crisscross search particle swarm optimizer called

CSPSO.
The CSPSO algorithm has significant superiority over most of the other PSO
variants in terms of solution accuracy and convergence rate.
The swarm in CSPSO is directly represented by a population of pbests, which
are renewed by the modified PSO search as well as the crisscross search in
sequence at each generation.
The CSO as an catalytic agent can accelerate the particles to converge to the
global optima.
The horizontal crossover uses a cross-border search mechanism to enhance the
global search ability greatly.
The vertical crossover can facilitate the stagnant dimensions to escape out of
the local minima.

Although the particle swarm optimization (PSO) algorithm has been

widely used to solve many real world problems, it is likely to suffer
entrapment in local optima when addressing multimodal optimization
problems. In this paper, we report a novel hybrid optimization
algorithm called crisscross search particle swarm optimization
(CSPSO), which is different from PSO and its variants in that each
particle is directly represented by pbest. The population of particles in
CSPSO is updated by modified PSO as well as crisscross search
optimization (CSO) in sequence within each iteration. CSO is
incorporated as an evolutionary catalytic agent that has powerful
capability of searching for pbests of high quality, therefore
accelerating the global convergence of PSO. CSO enhances PSO by
two search operators, namely horizontal crossover and vertical
crossover. The horizontal crossover further enhances PSO's global
convergence ability while the vertical crossover can enhance swarm

diversity. Several benchmark functions are used to test the feasibility

and efficiency of the proposed algorithm. The experimental results
show that CSPSO outperforms other state-of-the-art PSO variants
significantly in terms of global search ability and convergence speed
on almost all of the benchmark functions tested.
Multi-objective reliability redundancy allocation in an interval
environment using particle swarm optimization
Reliability Engineering & System Safety
Volume 145, January 2016, Pages 8392
Enze Zhang, ,
Qingwei Chen

We model the reliability redundancy allocation problem in an interval

environment.

We apply the particle swarm optimization directly on the interval values.

A dominance relation for interval-valued multi-objective functions is defined.

The crowding distance metric is extended to handle imprecise objective

functions.

Most of the existing works addressing reliability redundancy

allocation problems are based on the assumption of fixed reliabilities
of components. In real-life situations, however, the reliabilities of
individual components may be imprecise, most often given as
intervals, under different operating or environmental conditions. This
paper deals with reliability redundancy allocation problems modeled
in an interval environment. An interval multi-objective optimization
problem is formulated from the original crisp one, where system
reliability and cost are simultaneously considered. To render the
multi-objective particle swarm optimization (MOPSO) algorithm
capable of dealing with interval multi-objective optimization
problems, a dominance relation for interval-valued functions is
defined with the help of our newly proposed order relations of

interval-valued numbers. Then, the crowding distance is extended to

the multi-objective interval-valued case. Finally, the effectiveness of
the proposed approach has been demonstrated through two numerical
examples and a case study of supervisory control and data acquisition
(SCADA) system in water resource management.
Discrete particle swarm optimization for high-order graph matching
Information Sciences
Volume 328, 20 January 2016, Pages 158171
Maoguo Gong, a, ,
Yue Wua,
Qing Caia,
Wenping Maa,
A.K. Qinb,
Zhenkun Wanga,
Licheng Jiaoa
High-order graph matching aims at establishing correspondences between two sets of
feature points using high-order constraints. It is usually formulated as an NP-hard problem
of maximizing an objective function. This paper introduces a discrete particle swarm
optimization algorithm for resolving high-order graph matching problems, which
incorporates several re-defined operations, a problem-specific initialization method based
on heuristic information, and a problem-specific local search procedure. The proposed
algorithm is evaluated on both synthetic and real-world datasets. Its outstanding
performance is validated in comparison with three state-of-the-art approaches.

Dynamic mentoring and self-regulation based particle swarm

optimization algorithm for solving complex real-world optimization
problems
M.R. Tanweera, ,
S. Suresh, a, , ,
N. Sundararajanb,
Information Sciences

Volume 326, 1 January 2016, Pages 124

In this paper, a dynamic mentoring scheme along with a selfregulation scheme have been incorporated in the standard Particle
Swarm Optimization (PSO) algorithm to empower the searching
particles with human-like characteristics. The algorithm is referred to
as a Dynamic Mentoring and Self-Regulation based Particle Swarm
Optimization (DMeSR-PSO) algorithm. Based on their experiences,
the particles are divided into three groups, viz., the mentor group, the
mentee group and the independent learner group where the number of
particles in each group is dynamically changing in every iteration. In
human learning psychology, mentoring is regarded as a powerful and
effective learning process and independent learners are the ones who
do not need mentoring and are capable of performing self-regulation
of their own knowledge. Therefore, the particles in each of the above
three groups have different learning strategies for their velocity
updates where the mentors are equipped with a strong self-belief
based search, the mentees are taking guidance from the mentors and
the independent learners employ self-perception strategy. The
DMeSR-PSO algorithm has been extensively evaluated using the
simple unimodal and multimodal benchmark functions from
CEC2005, more complex shifted and rotated benchmark functions
from CEC2013 and also based on eight real-world problems from
CEC2011. The results have been compared with six state-of-the-art
PSO variants and five meta-heuristic algorithms for the CEC2005
problems. Further, a comparative analysis on CEC2013 benchmark
functions with different PSO variants has also been presented. Finally,
DMeSR-PSOs performance on the real-world problems is compared
with the top two algorithms from the CEC2011 competition. The
results indicate that the proposed learning strategies help DMeSRPSO to achieve faster convergence and provide better solutions in
most of the problems with a 95% confidence level, yielding an
effective optimization algorithm for real-world applications.
A novel stability-based adaptive inertia weight for particle swarm
optimization
Mojtaba Taherkhani ,
Reza Safabakhsh,

Applied Soft Computing

Volume 38, January 2016, Pages 281295

Particle swarm optimization (PSO) is a stochastic population-based algorithm

motivated by intelligent collective behavior of birds. The performance of the PSO
algorithm highly depends on choosing appropriate parameters. Inertia weight is
a parameter of this algorithm which was first proposed by Shi and Eberhart to
bring about a balance between the exploration and exploitation characteristics of
PSO. This paper presents an adaptive approach which determines the inertia
weight in different dimensions for each particle, based on its performance and
distance from its best position. Each particle will then have different roles in
different dimensions of the search environment. By considering the stability
condition and an adaptive inertia weight, the acceleration parameters of PSO are
adaptively determined. The corresponding approach is called stability-based
adaptive inertia weight (SAIW). The proposed method and some other models for
adjusting the inertia weight are evaluated and compared. The efficiency of SAIW
is validated on 22 static test problems, moving peaks benchmarks (MPB) and a
real-world problem for a radar system design. Experimental results indicate that
the proposed model greatly improves the PSO performance in terms of the
solution quality as well as convergence speed in static and dynamic
environments.