A comprehensive survey on particle swarm optimization algorithm and its applications
Particle swarm optimization (PSO) is a heuristic global optimization method, proposed
originally by Kennedy and Eberhart in 1995. It is now one of the most commonly used …
originally by Kennedy and Eberhart in 1995. It is now one of the most commonly used …
MPSO: Modified particle swarm optimization and its applications
D Tian, Z Shi - Swarm and evolutionary computation, 2018 - Elsevier
Particle swarm optimization (PSO) is a population based meta-heuristic search algorithm
that has been widely applied to a variety of problems since its advent. In PSO, the inertial …
that has been widely applied to a variety of problems since its advent. In PSO, the inertial …
Comparison of particle swarm optimization variants with fuzzy dynamic parameter adaptation for modular granular neural networks for human recognition
In this paper dynamic parameter adjustment in particle swarm optimization (PSO) for
modular neural network (MNN) design using granular computing and fuzzy logic (FL) is …
modular neural network (MNN) design using granular computing and fuzzy logic (FL) is …
A novel improved particle swarm optimization algorithm based on individual difference evolution
J Gou, YX Lei, WP Guo, C Wang, YQ Cai, W Luo - Applied Soft Computing, 2017 - Elsevier
As a well-known stochastic optimization algorithm, the particle swarm optimization (PSO)
algorithm has attracted the attention of many researchers all over the world, which has …
algorithm has attracted the attention of many researchers all over the world, which has …
An adaptive switchover hybrid particle swarm optimization algorithm with local search strategy for constrained optimization problems
Z Liu, Z Qin, P Zhu, H Li - Engineering Applications of Artificial Intelligence, 2020 - Elsevier
Practical engineering optimization problems are almost constrained optimization problems
and difficult to be solved effectively, therefore, how to handle these problems has attracted …
and difficult to be solved effectively, therefore, how to handle these problems has attracted …
[HTML][HTML] Reservoir flood control operation based on chaotic particle swarm optimization algorithm
Y He, Q Xu, S Yang, L Liao - Applied Mathematical Modelling, 2014 - Elsevier
Reservoir flood control operation is a complex engineering optimization problem with a
large number of constraints. In order to solve this problem, a chaotic particle swarm …
large number of constraints. In order to solve this problem, a chaotic particle swarm …
A new methodology to support group decision-making for IoT-based emergency response systems
An emergency response system (ERS) can assist a municipality or government in improving
its capabilities to respond urgent and severe events. The responsiveness and effectiveness …
its capabilities to respond urgent and severe events. The responsiveness and effectiveness …
Tribomechanical investigation and parametric optimisation of the cutting performance of Ni-based hardfaced turning tool insert
V Kumar, SC Mondal - International Journal on Interactive Design and …, 2024 - Springer
The prime objective of the current study is to illustrate not only the tribomechanical
properties of hardfaced deposit but also the parametric study, modelling and optimisation of …
properties of hardfaced deposit but also the parametric study, modelling and optimisation of …
Hybrid particle swarm optimization algorithm based on the theory of reinforcement learning in psychology
W Huang, Y Liu, X Zhang - Systems, 2023 - mdpi.com
To more effectively solve the complex optimization problems that exist in nonlinear, high-
dimensional, large-sample and complex systems, many intelligent optimization methods …
dimensional, large-sample and complex systems, many intelligent optimization methods …
[PDF][PDF] Particle swarm optimization algorithm for multi-salesman problem with time and capacity constraints
S Pang, T Li, F Dai, M Yu - Applied Mathematics & …, 2013 - naturalspublishing.com
Classic multiple traveling salesman problem (MTSP) requires to find the k closed circular
paths which minimize the sum of the path lengths, and each vertex is visited only once by a …
paths which minimize the sum of the path lengths, and each vertex is visited only once by a …