111 research outputs found
Cuckoo Search Inspired Hybridization of the Nelder-Mead Simplex Algorithm Applied to Optimization of Photovoltaic Cells
A new hybridization of the Cuckoo Search (CS) is developed and applied to
optimize multi-cell solar systems; namely multi-junction and split spectrum
cells. The new approach consists of combining the CS with the Nelder-Mead
method. More precisely, instead of using single solutions as nests for the CS,
we use the concept of a simplex which is used in the Nelder-Mead algorithm.
This makes it possible to use the flip operation introduces in the Nelder-Mead
algorithm instead of the Levy flight which is a standard part of the CS. In
this way, the hybridized algorithm becomes more robust and less sensitive to
parameter tuning which exists in CS. The goal of our work was to optimize the
performance of multi-cell solar systems. Although the underlying problem
consists of the minimization of a function of a relatively small number of
parameters, the difficulty comes from the fact that the evaluation of the
function is complex and only a small number of evaluations is possible. In our
test, we show that the new method has a better performance when compared to
similar but more compex hybridizations of Nelder-Mead algorithm using genetic
algorithms or particle swarm optimization on standard benchmark functions.
Finally, we show that the new method outperforms some standard meta-heuristics
for the problem of interest
Recommended from our members
A solution to the crucial problem of population degeneration in high-dimensional evolutionary optimization
Three popular evolutionary optimization algorithms are tested on high-dimensional benchmark functions. An important phenomenon responsible for many failures - population degeneration - is discovered. That is, through evolution, the population of searching particles degenerates into a subspace of the search space, and the global optimum is exclusive from the subspace. Subsequently, the search will tend to be confined to this subspace and eventually miss the global optimum. Principal components analysis (PCA) is introduced to discover population degeneration and to remedy its adverse effects. The experiment results reveal that an algorithm's efficacy and efficiency are closely related to the population degeneration phenomenon. Guidelines for improving evolutionary algorithms for high-dimensional global optimization are addressed. An application to highly nonlinear hydrological models demonstrates the efficacy of improved evolutionary algorithms in solving complex practical problems. © 2011 IEEE
Recommended from our members
A new evolutionary search strategy for global optimization of high-dimensional problems
Global optimization of high-dimensional problems in practical applications remains a major challenge to the research community of evolutionary computation. The weakness of randomization-based evolutionary algorithms in searching high-dimensional spaces is demonstrated in this paper. A new strategy, SP-UCI is developed to treat complexity caused by high dimensionalities. This strategy features a slope-based searching kernel and a scheme of maintaining the particle population's capability of searching over the full search space. Examinations of this strategy on a suite of sophisticated composition benchmark functions demonstrate that SP-UCI surpasses two popular algorithms, particle swarm optimizer (PSO) and differential evolution (DE), on high-dimensional problems. Experimental results also corroborate the argument that, in high-dimensional optimization, only problems with well-formative fitness landscapes are solvable, and slope-based schemes are preferable to randomization-based ones. © 2011 Elsevier Inc. All rights reserved
Hybrid particle swarm-based algorithms and their application to linear array synthesis
A heuristic particle swarm optimization (PSO) based algorithm is presented in this work and the novel hybrid approach is applied to linear array synthesis considering complex weights and directive element patterns so as to analyze its usefulness and limitations. Basically, classical PSO schemes are modified by introducing a tournament selection strategy and the downhill simplex local search method, so that the hybrid algorithms proposed combine the strengths of the PSO to initially explore the search space, the pressure exerted by the genetic selection operator to manage and speed up the search, and finally, the ability of the local optimization technique to quickly descend to the optimum solution. Four classical real-valued PSO schemes are taken as reference and synthesis results for a 60-element linear array comparing those classical schemes and the hybridized ones are reported and discussed in order to show the improvements achieved by the hybrid approaches.This work was supported by the Spanish Ministry of Science and Innovation (project number TEC2008-02730/TEC)
Memetic Artificial Bee Colony Algorithm for Large-Scale Global Optimization
Memetic computation (MC) has emerged recently as a new paradigm of efficient
algorithms for solving the hardest optimization problems. On the other hand,
artificial bees colony (ABC) algorithms demonstrate good performances when
solving continuous and combinatorial optimization problems. This study tries to
use these technologies under the same roof. As a result, a memetic ABC (MABC)
algorithm has been developed that is hybridized with two local search
heuristics: the Nelder-Mead algorithm (NMA) and the random walk with direction
exploitation (RWDE). The former is attended more towards exploration, while the
latter more towards exploitation of the search space. The stochastic adaptation
rule was employed in order to control the balancing between exploration and
exploitation. This MABC algorithm was applied to a Special suite on Large Scale
Continuous Global Optimization at the 2012 IEEE Congress on Evolutionary
Computation. The obtained results the MABC are comparable with the results of
DECC-G, DECC-G*, and MLCC.Comment: CONFERENCE: IEEE Congress on Evolutionary Computation, Brisbane,
Australia, 201
Minimum Population Search, an Application to Molecular Docking
Computer modeling of protein-ligand interactions is one of the most important phases in a drug design process. Part of the process involves the optimization of highly multi-modal objective (scoring) functions. This research presents the Minimum Population Search heuristic as an alternative for solving these global unconstrained optimization problems. To determine the effectiveness of Minimum Population Search, a comparison with seven state-of-the-art search heuristics is performed. Being specifically designed for the optimization of large scale multi-modal problems, Minimum Population Search achieves excellent results on all of the tested complexes, especially when the amount of available function evaluations is strongly reduced. A first step is also made toward the design of hybrid algorithms based on the exploratory power of Minimum Population Search. Computational results show that hybridization leads to a further improvement in performance
A shifted hyperbolic augmented Lagrangian-based artificial fish two swarm algorithm with guaranteed convergence for constrained global optimization
This article presents a shifted hyperbolic penalty function and proposes an augmented Lagrangian-based
algorithm for non-convex constrained global optimization problems. Convergence to an ε-global minimizer
is proved. At each iteration k, the algorithm requires the ε(k)-global minimization of a bound
constrained optimization subproblem, where ε(k) → ε. The subproblems are solved by a stochastic
population-based metaheuristic that relies on the artificial fish swarm paradigm and a two-swarm strategy.
To enhance the speed of convergence, the algorithm invokes the Nelder–Mead local search with a dynamically
defined probability. Numerical experiments with benchmark functions and engineering design
problems are presented. The results show that the proposed shifted hyperbolic augmented Lagrangian
compares favorably with other deterministic and stochastic penalty-based methods.This work was supported by COMPETE [POCI-01-0145-FEDER-007043]; FCT-Fundacao para a Ciencia e Tecnologia within the Project Scope [UID/CEC/00319/2013]; and partially supported by CMAT-Centre of Mathematics of the University of Minho
- …