Steady state particle swarm

The following grant information was disclosed by the authors: Fundação para a Ciência e Tecnologia (FCT), Research Fellowship: SFRH/BPD/66876/2009. FCT PROJECT: UID/EEA/50009/2013. EPHEMECH: TIN2014-56494-C4-3-P, Spanish Ministry of Economy and Competitivity. PROY-PP2015-06: Plan Propio 2015 UGR. CEI2015-MP-V17 of the Microprojects program 2015 from CEI BioTIC Granada.This paper investigates the performance and scalability of a new update strategy for the particle swarm optimization (PSO) algorithm. The strategy is inspired by the Bak–Sneppen model of co-evolution between interacting species, which is basically a network of fitness values (representing species) that change over time according to a simple rule: the least fit species and its neighbors are iteratively replaced with random values. Following these guidelines, a steady state and dynamic update strategy for PSO algorithms is proposed: only the least fit particle and its neighbors are updated and evaluated in each time-step; the remaining particles maintain the same position and fitness, unless they meet the update criterion. The steady state PSO was tested on a set of unimodal, multimodal, noisy and rotated benchmark functions, significantly improving the quality of results and convergence speed of the standard PSOs and more sophisticated PSOs with dynamic parameters and neighborhood. A sensitivity analysis of the parameters confirms the performance enhancement with different parameter settings and scalability tests show that the algorithm behavior is consistent throughout a substantial range of solution vector dimensions.This work was supported by Fundação para a Ciência e Tecnologia (FCT) Research Fellowship SFRH/BPD/66876/2009 and FCT Project (UID/EEA/50009/2013), EPHEMECH (TIN2014-56494-C4-3-P, Spanish Ministry of Economy and Competitivity), PROY-PP2015-06 (Plan Propio 2015 UGR), project CEI2015-MP-V17 of the Microprojects program 2015 from CEI BioTIC Granada

Electromagnetic scattering of metallic cylinders of arbitrary shape by using asynchronous particle swarm optimization and non-uniform steady state genetic algorithm

[[abstract]]Two techniques for the shape reconstruction of multiple metallic cylinders from scattered fields are investigated in this paper, in which two-dimensional configurations are involved. After an integral formulation, the method of moment (MoM) is applied to solve it numerically. Two separate perfect-conducting cylinders of unknown shapes are buried in one half-space and illuminated by the transverse magnetic (TM) plane wave from the other half space. Based on the boundary condition and the measured scattered field, a set of nonlinear integral equation is derived and the imaging problem is reformulated into optimization problem. The non-uniform steady state genetic algorithm (NU-SSGA) and asynchronous particle swarm optimization (APSO) are employed to find out the global extreme solution of the object function. Numerical results demonstrate even when the initial guesses are far away from the exact shapes, and the multiple scattered fields between two conductors are serious, good reconstruction can be obtained. In addition, the effect of Gaussian noise on the reconstruction results is investigated and the numerical simulation shows that the reconstruction results are good and acceptable, as long as the SNR is greater than 20 dB.[[incitationindex]]SCI[[booktype]]電子版[[booktype]]紙

Simulation-based coyote optimization algorithm to determine gains of PI controller for enhancing the performance of solar PV water-pumping system

In this study, a simulation-based coyote optimization algorithm (COA) to identify the gains of PI to ameliorate the water-pumping system performance fed from the photovoltaic system is presented. The aim is to develop a stand-alone water-pumping system powered by solar energy, i.e., without the need of electric power from the utility grid. The voltage of the DC bus was adopted as a good candidate to guarantee the extraction of the maximum power under partial shading conditions. In such a system, two proportional-integral (PI) controllers, at least, are necessary. The adjustment of (Proportional-Integral) controllers are always carried out by classical and tiresome trials and errors techniques which becomes a hard task and time-consuming. In order to overcome this problem, an optimization problem was reformulated and modeled under functional time-domain constraints, aiming at tuning these decision variables. For achieving the desired operational characteristics of the PV water-pumping system for both rotor speed and DC-link voltage, simultaneously, the proposed COA algorithm is adopted. It is carried out through resolving a multiobjective optimization problem employing the weighted-sum technique. Inspired on theCanis latransspecies, the COA algorithm is successfully investigated to resolve such a problem by taking into account some constraints in terms of time-domain performance as well as producing the maximum power from the photovoltaic generation system. To assess the efficiency of the suggested COA method, the classical Ziegler-Nichols and trial-error tuning methods for the DC-link voltage and rotor speed dynamics, were compared. The main outcomes ensured the effectiveness and superiority of the COA algorithm. Compared to the other reported techniques, it is superior in terms of convergence rapidity and solution qualities

Dynamic Optimization Algorithms for Baseload Power Plant Cycling under Variable Renewable Energy

The growing deployment of variable renewable energy (VRE) sources, such as wind and solar, is mainly due to the decline in the cost of renewable technologies and the increase of societal and cultural pressures. Solar and wind power generation are also known to have zero marginal costs and fuel emissions during dispatch. Thereby, the VRE from these sources should be prioritized when available. However, the rapid deployment of VRE has heightened concerns regarding the challenges in the integration between fossil-fueled and renewable energy systems. The high variability introduced by the VRE as well as the limited alignment between demand and wind/solar power generation led to the increased need of dispatchable energy sources such as baseload natural gas- and coal-fired power plants to cycle their power outputs more often to reliably supply the net load. The increasing power plant cycling can introduce unexpected inefficiencies into the system that potentially incur higher costs, emissions, and wear-and-tear, as the power plants are no longer operating at their optimal design points. In this dissertation, dynamic optimization algorithms are developed and implemented for baseload power plant cycling under VRE penetration. Specifically, two different dynamic optimization strategies are developed for the minute and hourly time scales of grid operation. The minute-level strategy is based on a mixed-integer linear programming (MILP) formulation for dynamic dispatch of energy systems, such as natural gas- and coal-fired power plants and sodium sulfur batteries, under VRE while considering power plant equipment health-related constraints. The hourly-level strategy is based on a Nonlinear Multi-objective dynamic real-time Predictive Optimization (NMPO) implemented in a supercritical pulverized coal-fired (SCPC) power plant with a postcombustion carbon capture system (CCS), considering economic and environmental objectives. Different strategies are employed and explored to improve computational tractability, such as mathematical reformulations, automatic differentiation (AD), and parallelization of a metaheuristic particle swarm optimization (PSO) component. The MILP-based dynamic dispatch framework is used to simulate case studies considering different loads and renewable penetration levels for a suite of energy systems. The results show that grid flexibility is mostly provided by the natural gas power plant, while the batteries are used sparingly. Additionally, considering the post-optimization equivalent carbon analysis, the environmental performance is intrinsically connected to grid flexibility and the level of VRE penetration. The stress results reinforce the necessity of further considering and including equipment health-related constraints during dispatch. The results of the NMPO successfully implemented for a large-scale SCPC-CCS show that the optimal compromise is automatically chosen from the Pareto front according to a set of weights for the objectives with minimal interaction between the framework and the decision maker. They also indicate that to setup the optimization thresholds and constraints, knowledge of the power system operations is essential. Finally, the market and carbon policies have an impact on the optimal compromise between the economic and environmental objectives

Novel optimisation methods for numerical inverse problems

Inverse problems involve the determination of one or more unknown quantities usually appearing in the mathematical formulation of a physical problem. These unknown quantities may be boundary heat flux, various source terms, thermal and material properties, boundary shape and size. Solving inverse problems requires additional information through in-situ data measurements of the field variables of the physical problems. These problems are also ill-posed because the solution itself is sensitive to random errors in the measured input data. Regularisation techniques are usually used in order to deal with the instability of the solution. In the past decades, many methods based on the nonlinear least squares model, both deterministic (CGM) and stochastic (GA, PSO), have been investigated for numerical inverse problems. The goal of this thesis is to examine and explore new techniques for numerical inverse problems. The background theory of population-based heuristic algorithm known as quantum-behaved particle swarm optimisation (QPSO) is re-visited and examined. To enhance the global search ability of QPSO for complex multi-modal problems, several modifications to QPSO are proposed. These include perturbation operation, Gaussian mutation and ring topology model. Several parameter selection methods for these algorithms are proposed. Benchmark functions were used to test the performance of the modified algorithms. To address the high computational cost of complex engineering optimisation problems, two parallel models of the QPSO (master-slave, static subpopulation) were developed for different distributed systems. A hybrid method, which makes use of deterministic (CGM) and stochastic (QPSO) methods, is proposed to improve the estimated solution and the performance of the algorithms for solving the inverse problems. Finally, the proposed methods are used to solve typical problems as appeared in many research papers. The numerical results demonstrate the feasibility and efficiency of QPSO and the global search ability and stability of the modified versions of QPSO. Two novel methods of providing initial guess to CGM with approximated data from QPSO are also proposed for use in the hybrid method and were applied to estimate heat fluxes and boundary shapes. The simultaneous estimation of temperature dependent thermal conductivity and heat capacity was addressed by using QPSO with Gaussian mutation. This combination provides a stable algorithm even with noisy measurements. Comparison of the performance between different methods for solving inverse problems is also presented in this thesis

Comparative Study of Some Population-based Optimization Algorithms on Inverse Scattering of a Two-Dimensional Perfectly Conducting Cylinder in Slab Medium

[[abstract]]The application of four techniques for the shape reconstruction of a 2-D metallic cylinder buried in dielectric slab medium by measured the cattered fields outside is studied in the paper. The finite-difference time-domain (FDTD) technique is employed for electromagnetic analyses for both the forward and inverse scattering problems, while the shape reconstruction problem is transformed into optimization one during the course of inverse scattering. Then, four techniques including asynchronous particle swarm optimization (APSO), PSO, dynamic differential evolution (DDE) and self-adaptive DDE (SADDE) are applied to reconstruct the location and shape of the 2-Dmetallic cylinder for comparative purposes. The statistical performances of these algorithms are compared. The results show that SADDE outperforms PSO, APSO and DDE in terms of the ability of exploring the optima. However, these results are considered to be indicative and do not generally apply to all optimization problems in electromagnetics.[[incitationindex]]SCI[[incitationindex]]EI[[booktype]]紙本[[booktype]]電子

Treasure hunt : a framework for cooperative, distributed parallel optimization

Orientador: Prof. Dr. Daniel WeingaertnerCoorientadora: Profa. Dra. Myriam Regattieri DelgadoTese (doutorado) - Universidade Federal do Paraná, Setor de Ciências Exatas, Programa de Pós-Graduação em Informática. Defesa : Curitiba, 27/05/2019Inclui referências: p. 18-20Área de concentração: Ciência da ComputaçãoResumo: Este trabalho propõe um framework multinível chamado Treasure Hunt, que é capaz de distribuir algoritmos de busca independentes para um grande número de nós de processamento. Com o objetivo de obter uma convergência conjunta entre os nós, este framework propõe um mecanismo de direcionamento que controla suavemente a cooperação entre múltiplas instâncias independentes do Treasure Hunt. A topologia em árvore proposta pelo Treasure Hunt garante a rápida propagação da informação pelos nós, ao mesmo tempo em que provê simutaneamente explorações (pelos nós-pai) e intensificações (pelos nós-filho), em vários níveis de granularidade, independentemente do número de nós na árvore. O Treasure Hunt tem boa tolerância à falhas e está parcialmente preparado para uma total tolerância à falhas. Como parte dos métodos desenvolvidos durante este trabalho, um método automatizado de Particionamento Iterativo foi proposto para controlar o balanceamento entre explorações e intensificações ao longo da busca. Uma Modelagem de Estabilização de Convergência para operar em modo Online também foi proposto, com o objetivo de encontrar pontos de parada com bom custo/benefício para os algoritmos de otimização que executam dentro das instâncias do Treasure Hunt. Experimentos em benchmarks clássicos, aleatórios e de competição, de vários tamanhos e complexidades, usando os algoritmos de busca PSO, DE e CCPSO2, mostram que o Treasure Hunt melhora as características inerentes destes algoritmos de busca. O Treasure Hunt faz com que os algoritmos de baixa performance se tornem comparáveis aos de boa performance, e os algoritmos de boa performance possam estender seus limites até problemas maiores. Experimentos distribuindo instâncias do Treasure Hunt, em uma rede cooperativa de até 160 processos, demonstram a escalabilidade robusta do framework, apresentando melhoras nos resultados mesmo quando o tempo de processamento é fixado (wall-clock) para todas as instâncias distribuídas do Treasure Hunt. Resultados demonstram que o mecanismo de amostragem fornecido pelo Treasure Hunt, aliado à maior cooperação entre as múltiplas populações em evolução, reduzem a necessidade de grandes populações e de algoritmos de busca complexos. Isto é especialmente importante em problemas de mundo real que possuem funções de fitness muito custosas. Palavras-chave: Inteligência artificial. Métodos de otimização. Algoritmos distribuídos. Modelagem de convergência. Alta dimensionalidade.Abstract: This work proposes a multilevel framework called Treasure Hunt, which is capable of distributing independent search algorithms to a large number of processing nodes. Aiming to obtain joint convergences between working nodes, Treasure Hunt proposes a driving mechanism that smoothly controls the cooperation between the multiple independent Treasure Hunt instances. The tree topology proposed by Treasure Hunt ensures quick propagation of information, while providing simultaneous explorations (by parents) and exploitations (by children), on several levels of granularity, regardless the number of nodes in the tree. Treasure Hunt has good fault tolerance and is partially prepared to full fault tolerance. As part of the methods developed during this work, an automated Iterative Partitioning method is proposed to control the balance between exploration and exploitation as the search progress. A Convergence Stabilization Modeling to operate in Online mode is also proposed, aiming to find good cost/benefit stopping points for the optimization algorithms running within the Treasure Hunt instances. Experiments on classic, random and competition benchmarks of various sizes and complexities, using the search algorithms PSO, DE and CCPSO2, show that Treasure Hunt boosts the inherent characteristics of these search algorithms. Treasure Hunt makes algorithms with poor performances to become comparable to good ones, and algorithms with good performances to be capable of extending their limits to larger problems. Experiments distributing Treasure Hunt instances in a cooperative network up to 160 processes show the robust scaling of the framework, presenting improved results even when fixing a wall-clock time for the instances. Results show that the sampling mechanism provided by Treasure Hunt, allied to the increased cooperation between multiple evolving populations, reduce the need for large population sizes and complex search algorithms. This is specially important on real-world problems with time-consuming fitness functions. Keywords: Artificial intelligence. Optimization methods. Distributed algorithms. Convergence modeling. High dimensionality

Comparison of Particle Swarm Optimization and Asynchronous Particle Swarm Optimization for Inverse Scattering of a Two- Dimensional Perfectly Conducting Cylinder

[[abstract]]This paper reports a two dimensional time domain inverse scattering algorithm based upon the finite-difference time domain method for determining the shape of perfectly conducting cylinder. Finite difference time domain method (FDTD) is used to solve the scattering electromagnetic wave of a perfectly conducting cylinder. The inverse problem is resolved by an optimization approach and the global searching scheme asynchronous particle swarm optimization (APSO) is then employed to search the parameter space. By properly processing the scattered field, some EM properties can be reconstructed. One is the location of the conducting cylinder, the others is the shape of the perfectly conducting cylinder. This method is tested by several numerical examples; numerical results indicate that the APSO outperforms the PSO in terms of reconstruction accuracy and convergence speed. Both techniques have been tested in the case of simulated measurements contaminated by additive white Gaussian noise.[[incitationindex]]SCI[[incitationindex]]EI[[booktype]]紙

Parallel ant colony optimization for the training of cell signaling networks

[Abstract]: Acquiring a functional comprehension of the deregulation of cell signaling networks in disease allows progress in the development of new therapies and drugs. Computational models are becoming increasingly popular as a systematic tool to analyze the functioning of complex biochemical networks, such as those involved in cell signaling. CellNOpt is a framework to build predictive logic-based models of signaling pathways by training a prior knowledge network to biochemical data obtained from perturbation experiments. This training can be formulated as an optimization problem that can be solved using metaheuristics. However, the genetic algorithm used so far in CellNOpt presents limitations in terms of execution time and quality of solutions when applied to large instances. Thus, in order to overcome those issues, in this paper we propose the use of a method based on ant colony optimization, adapted to the problem at hand and parallelized using a hybrid approach. The performance of this novel method is illustrated with several challenging benchmark problems in the study of new therapies for liver cancer