1,311 research outputs found
Adaptive particle swarm optimization
An adaptive particle swarm optimization (APSO) that features better search efficiency than classical particle swarm optimization (PSO) is presented. More importantly, it can perform a global search over the entire search space with faster convergence speed. The APSO consists of two main steps. First, by evaluating the population distribution and particle fitness, a real-time evolutionary state estimation procedure is performed to identify one of the following four defined evolutionary states, including exploration, exploitation, convergence, and jumping out in each generation. It enables the automatic control of inertia weight, acceleration coefficients, and other algorithmic parameters at run time to improve the search efficiency and convergence speed. Then, an elitist learning strategy is performed when the evolutionary state is classified as convergence state. The strategy will act on the globally best particle to jump out of the likely local optima. The APSO has comprehensively been evaluated on 12 unimodal and multimodal benchmark functions. The effects of parameter adaptation and elitist learning will be studied. Results show that APSO substantially enhances the performance of the PSO paradigm in terms of convergence speed, global optimality, solution accuracy, and algorithm reliability. As APSO introduces two new parameters to the PSO paradigm only, it does not introduce an additional design or implementation complexity
A metaheuristic particle swarm optimization approach to nonlinear model predictive control
This paper commences with a short review on
optimal control for nonlinear systems, emphasizing the Model
Predictive approach for this purpose. It then describes the Particle Swarm Optimization algorithm and how it could be applied
to nonlinear Model Predictive Control. On the basis of these
principles, two novel control approaches are proposed and anal-
ysed. One is based on optimization of a numerically linearized
perturbation model, whilst the other avoids the linearization step
altogether. The controllers are evaluated by simulation of an
inverted pendulum on a cart system. The results are compared
with a numerical linearization technique exploiting conventional
convex optimization methods instead of Particle Swarm Opti-
mization. In both approaches, the proposed Swarm Optimization
controllers exhibit superior performance. The methodology is
then extended to input constrained nonlinear systems, offering a
promising new paradigm for nonlinear optimal control design.peer-reviewe
Recommended from our members
An Evaluation of Performance Enhancements to Particle Swarm Optimisation on Real-World Data
Swarm Computation is a relatively new optimisation paradigm. The basic premise is to model the collective behaviour of self-organised natural phenomena such as swarms, flocks and shoals, in order to solve optimisation problems. Particle Swarm Optimisation (PSO) is a type of swarm computation inspired by bird flocks or swarms of bees by modelling their collective social influence as they search for optimal solutions.
In many real-world applications of PSO, the algorithm is used as a data pre-processor for a neural network or similar post processing system, and is often extensively modified to suit the application. The thesis introduces techniques that allow unmodified PSO to be applied successfully to a range of problems, specifically three extensions to the basic PSO algorithm: solving optimisation problems by training a hyperspatial matrix, using a hierarchy of swarms to coordinate optimisation on several data sets simultaneously, and dynamic neighbourhood selection in swarms.
Rather than working directly with candidate solutions to an optimisation problem, the PSO algorithm is adapted to train a matrix of weights, to produce a solution to the problem from the inputs. The search space is abstracted from the problem data.
A single PSO swarm optimises a single data set and has difficulties where the data set comprises disjoint parts (such as time series data for different days). To address this problem, we introduce a hierarchy of swarms, where each child swarm optimises one section of the data set whose gbest particle is a member of the swarm above in the hierarchy. The parent swarm(s) coordinate their children and encourage more exploration of the solution space. We show that hierarchical swarms of this type perform better than single swarm PSO optimisers on the disjoint data sets used.
PSO relies on interaction between particles within a neighbourhood to find good solutions. In many PSO variants, possible interactions are arbitrary and fixed on initialisation. Our third contribution is a dynamic neighbourhood selection: particles can modify their neighbourhood, based on the success of the candidate neighbour particle. As PSO is intended to reflect the social interaction of agents, this change significantly increases the ability of the swarm to find optimal solutions. Applied to real-world medical and cosmological data, this modification is and shows improvements over standard PSO approaches with fixed neighbourhoods
Particle Swarm Optimization
Particle swarm optimization (PSO) is a population based stochastic optimization technique influenced by the social behavior of bird flocking or fish schooling.PSO shares many similarities with evolutionary computation techniques such as Genetic Algorithms (GA). The system is initialized with a population of random solutions and searches for optima by updating generations. However, unlike GA, PSO has no evolution operators such as crossover and mutation. In PSO, the potential solutions, called particles, fly through the problem space by following the current optimum particles. This book represents the contributions of the top researchers in this field and will serve as a valuable tool for professionals in this interdisciplinary field
Uncertainty evaluation of reservoir simulation models using particle swarms and hierarchical clustering
History matching production data in finite difference reservoir simulation
models has been and always will be a challenge for the industry. The
principal hurdles that need to be overcome are finding a match in the first
place and more importantly a set of matches that can capture the uncertainty
range of the simulation model and to do this in as short a time as possible
since the bottleneck in this process is the length of time taken to run the
model. This study looks at the implementation of Particle Swarm
Optimisation (PSO) in history matching finite difference simulation models.
Particle Swarms are a class of evolutionary algorithms that have shown
much promise over the last decade. This method draws parallels from the
social interaction of swarms of bees, flocks of birds and shoals of fish.
Essentially a swarm of agents are allowed to search the solution hyperspace
keeping in memory each individual’s historical best position and iteratively
improving the optimisation by the emergent interaction of the swarm. An
intrinsic feature of PSO is its local search capability. A sequential niching
variation of the PSO has been developed viz. Flexi-PSO that enhances the
exploration and exploitation of the hyperspace and is capable of finding
multiple minima. This new variation has been applied to history matching
synthetic reservoir simulation models to find multiple distinct history
3
matches to try to capture the uncertainty range. Hierarchical clustering is
then used to post-process the history match runs to reduce the size of the
ensemble carried forward for prediction.
The success of the uncertainty modelling exercise is then assessed by
checking whether the production profile forecasts generated by the ensemble
covers the truth case
Particle Swarm Optimization: Basic Concepts, Variants and Applications in Power Systems
Many areas in power systems require solving one or more nonlinear optimization problems. While analytical methods might suffer from slow convergence and the curse of dimensionality, heuristics-based swarm intelligence can be an efficient alternative. Particle swarm optimization (PSO), part of the swarm intelligence family, is known to effectively solve large-scale nonlinear optimization problems. This paper presents a detailed overview of the basic concepts of PSO and its variants. Also, it provides a comprehensive survey on the power system applications that have benefited from the powerful nature of PSO as an optimization technique. For each application, technical details that are required for applying PSO, such as its type, particle formulation (solution representation), and the most efficient fitness functions are also discussed
- …