4,824 research outputs found

    Cuckoo Search Inspired Hybridization of the Nelder-Mead Simplex Algorithm Applied to Optimization of Photovoltaic Cells

    Full text link
    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

    Coarse Graining of Nonbonded Inter-particle Potentials Using Automatic Simplex Optimization to Fit Structural Properties

    Full text link
    We implemented a coarse-graining procedure to construct mesoscopic models of complex molecules. The final aim is to obtain better results on properties depending on slow modes of the molecules. Therefore the number of particles considered in molecular dynamics simulations is reduced while conserving as many properties of the original substance as possible. We address the problem of finding nonbonded interaction parameters which reproduce structural properties from experiment or atomistic simulations. The approach consists of optimizing automatically nonbonded parameters using the simplex algorithm to fit structural properties like the radial distribution function as target functions. Moreover, any mix of structural and thermodynamic properties can be included in the target function. Different spherically symmetric inter-particle potentials are discussed. Besides demonstrating the method for Lennard--Jones liquids, it is applied to several more complex molecular liquids such as diphenyl carbonate, tetrahydrofurane, and monomers of poly(isoprene).Comment: 24 pages, 3 tables, 14 figures submitted to the Journal of Chemical Physics (JCP

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

    Get PDF
    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

    Review of Metaheuristics and Generalized Evolutionary Walk Algorithm

    Full text link
    Metaheuristic algorithms are often nature-inspired, and they are becoming very powerful in solving global optimization problems. More than a dozen of major metaheuristic algorithms have been developed over the last three decades, and there exist even more variants and hybrid of metaheuristics. This paper intends to provide an overview of nature-inspired metaheuristic algorithms, from a brief history to their applications. We try to analyze the main components of these algorithms and how and why they works. Then, we intend to provide a unified view of metaheuristics by proposing a generalized evolutionary walk algorithm (GEWA). Finally, we discuss some of the important open questions.Comment: 14 page
    • …
    corecore