Fuzzy Controlled Parallel PSO to Solving Large Practical Economic Dispatch

International audienceThis paper proposes a version of fuzzy controlled parallel particle swarm optimization approach based decomposed network (FCP-PSO) to solve large nonconvex economic dispatch problems. The proposed approach combines practical experience extracted from global database formulated in fuzzy rules to adjust dynamically the three parameters associated to PSO mechanism search. The adaptive PSO executed in parallel based in decomposed network procedure as a local search to explore the search space very effectively. The robustness of the proposed modified PSO tested on 40 generating units with prohibited zones and compared with recent hybrid global optimization methods. The results show that the proposed approach can converge to the near solution and obtain a competitive solution with a reasonable time compared with recent previous approaches

Optimal Tuning of PID Controller using Adaptive Hybrid Particle Swarm Optimization Algorithm

Particle swarm optimization (PSO) has proved its ability as an efficient search tool in many optimization problems. However, PSO is easy to be trapped into local minima due to its mechanism in information sharing. Under this circumstance, all the particles could quickly converge to a position by the attraction of the best particle; all particles could hardly be improved. To overcome premature convergence of the standard PSO algorithm, this paper presents an adaptive hybrid PSO, namely (AHPSO) by employing an adaptive mutation operator for local best particles instead of applying the mutation operator to the global best particle as has been done in previous work. The developed algorithm is a new approach which allows the swarm to be more diverse by making better exploration of the local search space instead of global search space investigated by previous researchers. The proposed algorithm holds on the properties of simple structure, fast convergence, and at the same time enhances the variety of the population, and extends the search space. It is applied to self-tuning of proportional-integral-derivative-(PID) controller in the ball and hoop system which represents a system of complex industrial processes. The results are compared with those obtained by applying standard PSO, and adaptive hybrid PSO based on global best particles. It has been shown that the developed AHPSO local best algorithm is faster in convergence and the obtained results are proved to have higher fitness than the other two algorithms

Adaptive hybrid optimization strategy for calibration and parameter estimation of physical models

A new adaptive hybrid optimization strategy, entitled squads, is proposed for complex inverse analysis of computationally intensive physical models. The new strategy is designed to be computationally efficient and robust in identification of the global optimum (e.g. maximum or minimum value of an objective function). It integrates a global Adaptive Particle Swarm Optimization (APSO) strategy with a local Levenberg-Marquardt (LM) optimization strategy using adaptive rules based on runtime performance. The global strategy optimizes the location of a set of solutions (particles) in the parameter space. The LM strategy is applied only to a subset of the particles at different stages of the optimization based on the adaptive rules. After the LM adjustment of the subset of particle positions, the updated particles are returned to the APSO strategy. The advantages of coupling APSO and LM in the manner implemented in squads is demonstrated by comparisons of squads performance against Levenberg-Marquardt (LM), Particle Swarm Optimization (PSO), Adaptive Particle Swarm Optimization (APSO; the TRIBES strategy), and an existing hybrid optimization strategy (hPSO). All the strategies are tested on 2D, 5D and 10D Rosenbrock and Griewank polynomial test functions and a synthetic hydrogeologic application to identify the source of a contaminant plume in an aquifer. Tests are performed using a series of runs with random initial guesses for the estimated (function/model) parameters. Squads is observed to have the best performance when both robustness and efficiency are taken into consideration than the other strategies for all test functions and the hydrogeologic application

A self-learning particle swarm optimizer for global optimization problems

Copyright @ 2011 IEEE. All Rights Reserved. This article was made available through the Brunel Open Access Publishing Fund.Particle swarm optimization (PSO) has been shown as an effective tool for solving global optimization problems. So far, most PSO algorithms use a single learning pattern for all particles, which means that all particles in a swarm use the same strategy. This monotonic learning pattern may cause the lack of intelligence for a particular particle, which makes it unable to deal with different complex situations. This paper presents a novel algorithm, called self-learning particle swarm optimizer (SLPSO), for global optimization problems. In SLPSO, each particle has a set of four strategies to cope with different situations in the search space. The cooperation of the four strategies is implemented by an adaptive learning framework at the individual level, which can enable a particle to choose the optimal strategy according to its own local fitness landscape. The experimental study on a set of 45 test functions and two real-world problems show that SLPSO has a superior performance in comparison with several other peer algorithms.This work was supported by the Engineering and Physical Sciences Research Council of U.K. under Grants EP/E060722/1 and EP/E060722/2

Hybridization of multi-objective deterministic particle swarm with derivative-free local searches

The paper presents a multi-objective derivative-free and deterministic global/local hybrid algorithm for the efficient and effective solution of simulation-based design optimization (SBDO) problems. The objective is to show how the hybridization of two multi-objective derivative-free global and local algorithms achieves better performance than the separate use of the two algorithms in solving specific SBDO problems for hull-form design. The proposed method belongs to the class of memetic algorithms, where the global exploration capability of multi-objective deterministic particle swarm optimization is enriched by exploiting the local search accuracy of a derivative-free multi-objective line-search method. To the authors best knowledge, studies are still limited on memetic, multi-objective, deterministic, derivative-free, and evolutionary algorithms for an effective and efficient solution of SBDO for hull-form design. The proposed formulation manages global and local searches based on the hypervolume metric. The hybridization scheme uses two parameters to control the local search activation and the number of function calls used by the local algorithm. The most promising values of these parameters were identified using forty analytical tests representative of the SBDO problem of interest. The resulting hybrid algorithm was finally applied to two SBDO problems for hull-form design. For both analytical tests and SBDO problems, the hybrid method achieves better performance than its global and local counterparts