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 optimization techniques. This survey presented a comprehensive investigation of PSO. On one hand, we provided advances with PSO, including its modifications (including quantum-behaved PSO, bare-bones PSO, chaotic PSO, and fuzzy PSO), population topology (as fully connected, von Neumann, ring, star, random, etc.), hybridization (with genetic algorithm, simulated annealing, Tabu search, artificial immune system, ant colony algorithm, artificial bee colony, differential evolution, harmonic search, and biogeography-based optimization), extensions (to multiobjective, constrained, discrete, and binary optimization), theoretical analysis (parameter selection and tuning, and convergence analysis), and parallel implementation (in multicore, multiprocessor, GPU, and cloud computing forms). On the other hand, we offered a survey on applications of PSO to the following eight fields: electrical and electronic engineering, automation control systems, communication theory, operations research, mechanical engineering, fuel and energy, medicine, chemistry, and biology. It is hoped that this survey would be beneficial for the researchers studying PSO algorithms

A Brief Review of Cuckoo Search Algorithm (CSA) Research Progression from 2010 to 2013

Cuckoo Search Algorithm is a new swarm intelligence algorithm which based on breeding behavior of the Cuckoo bird. This paper gives a brief insight of the advancement of the Cuckoo Search Algorithm from 2010 to 2013. The first half of this paper presents the publication trend of Cuckoo Search Algorithm. The remaining of this paper briefly explains the contribution of the individual publication related to Cuckoo Search Algorithm. It is believed that this paper will greatly benefit the reader who needs a bird-eyes view of the Cuckoo Search Algorithm’s publications trend

Shuffled Complex-Self Adaptive Hybrid EvoLution (SC-SAHEL) optimization framework

Simplicity and flexibility of meta-heuristic optimization algorithms have attracted lots of attention in the field of optimization. Different optimization methods, however, hold algorithm-specific strengths and limitations, and selecting the best-performing algorithm for a specific problem is a tedious task. We introduce a new hybrid optimization framework, entitled Shuffled Complex-Self Adaptive Hybrid EvoLution (SC-SAHEL), which combines the strengths of different evolutionary algorithms (EAs) in a parallel computing scheme. SC-SAHEL explores performance of different EAs, such as the capability to escape local attractions, speed, convergence, etc., during population evolution as each individual EA suits differently to various response surfaces. The SC-SAHEL algorithm is benchmarked over 29 conceptual test functions, and a real-world hydropower reservoir model case study. Results show that the hybrid SC-SAHEL algorithm is rigorous and effective in finding global optimum for a majority of test cases, and that it is computationally efficient in comparison to algorithms with individual EA

A novel switching delayed PSO algorithm for estimating unknown parameters of lateral flow immunoassay

In this paper, the parameter identification problem of the lateral flow immunoassay (LFIA) devices is investigated via a new switching delayed particle swarm optimization (SDPSO) algorithm. By evaluating an evolutionary factor in each generation, the velocity of the particle can adaptively adjust the model according to a Markov chain in the proposed SDPSO method. During the iteration process, the SDPSO can adaptively select the inertia weight, acceleration coefficients, locally best particle pbest and globally best particle gbest in the swarm. It is worth highlighting that the pbest and the gbest can be randomly selected from the corresponding values in the previous iteration. That is, the delayed information of the pbest and the gbest can be exploited to update the particle’s velocity in current iteration according to the evolutionary states. The strategy can not only improve the global search but also enhance the possibility of eventually reaching the gbest. The superiority of the proposed SDPSO is evaluated on a series of unimodal and multimodal benchmark functions. Results demonstrate that the novel SDPSO algorithm outperforms some well-known PSO algorithms in aspects of global search and efficiency of convergence. Finally, the novel SDPSO is successfully exploited to estimate the unknown time-delay parameters of a class of nonlinear state-space LFIA model.This work was supported in part by the Royal Society of the U.K., the Alexander von Humboldt Foundation of Germany, the Natural Science Foundation of China under Grant 61403319, the Fujian Natural Science Foundation under Grant 2015J05131, and the Fujian Provincial Key Laboratory of Eco-Industrial Green Technology

Identification study of solar cell/module using recent optimization techniques

This paper proposes the application of a novel metaphor-free population optimization based on the mathematics of the Runge Kutta method (RUN) for parameter extraction of a double-diode model of the unknown solar cell and photovoltaic (PV) module parameters. The RUN optimizer is employed to determine the seven unknown parameters of the two-diode model. Fitting the experimental data is the main objective of the extracted unknown parameters to develop a generic PV model. Consequently, the root means squared error (RMSE) between the measured and estimated data is considered as the primary objective function. The suggested objective function achieves the closeness degree between the estimated and experimental data. For getting the generic model, applications of the proposed RUN are carried out on two different commercial PV cells. To assess the proposed algorithm, a comprehensive comparison study is employed and compared with several well-matured optimization algorithms reported in the literature. Numerical simulations prove the high precision and fast response of the proposed RUN algorithm for solving multiple PV models. Added to that, the RUN can be considered as a good alternative optimization method for solving power systems optimization problems