A neighborhood-aware multi-Markovian switching particle swarm optimization technique for solving complex and expensive problems
- Muhammad Ilyas Khan Khalil,
- Izaz Ur Rahman,
- Muhammad Zakarya(corresponding author),
- Mukhtaj Khan
- Abdul Wali Khan University Mardan,
- Sohar University,
- The University of Haripur
Abstract
Particle swarm optimization approach (PSO) has illustrated promising performance on a variety of optimization problems. The critical issues that must be addressed in PSO research are how to balance conflicts around exploration, exploitation, and reasonably distribute computational resources. In this paper, a neighborhood-aware N states Markovian Switching PSO algorithm (NS-MJPSOloc) is proposed, where we have employed a local search based approach. The neighborhood of PSO algorithm is a single particle itself in the early stages of optimization. The neighborhood will eventually expand to include all particles as the amount of generations increases. The search space is segmented into N potential states according to the size of problem. The value of N is dependent on the dimension of problem space. Every iteration serves a transition probability-based Markovian switching technique to estimate the acceleration coefficients in an adaptable way. The transition probability determines the next state and adequate values for acceleration coefficients. Through adopting a local search strategy while interacting with all other particles in the group, every particle possesses a chance of improving itself. Moreover, new features have been incorporated to accomplish accuracy and stability. The primary contributions of the proposed work are to enhance the topological structure of a recently developed PSO variant by using a local search (loc) mechanism rather than a global (gbest) approach. The purpose of this idea is to develop a more adaptable and less sensitive novel version of PSO that can handle multi-modal and highly challenging problems. The proposed algorithm was then tested using a variety of uni-modal, multi-modal and rotated benchmark functions. The experimental findings show that the proposed NS-MJPSOloc outperformed most of the current versions in terms of accuracy and convergence time, notably for multi-modal problems.
Research Output Information
Output type
Original language
EnglishPages from-to (Number of pages)
Pages 6517-6536 (20 pages)Journal (Volume, Issue Number)
Soft Computing (Volume 28, Issue 9-10)Publication milestones
- Published - 05/2024
Publication status
ISSN
1432-7643Publication IDs
- Scopus: 85180851508
