Metaheuristic optimization of power and energy systems: underlying principles and main issues of the 'rush to heuristics'

In the power and energy systems area, a progressive increase of literature contributions containing applications of metaheuristic algorithms is occurring. In many cases, these applications are merely aimed at proposing the testing of an existing metaheuristic algorithm on a specific problem, claiming that the proposed method is better than other methods based on weak comparisons. This 'rush to heuristics' does not happen in the evolutionary computation domain, where the rules for setting up rigorous comparisons are stricter, but are typical of the domains of application of the metaheuristics. This paper considers the applications to power and energy systems, and aims at providing a comprehensive view of the main issues concerning the use of metaheuristics for global optimization problems. A set of underlying principles that characterize the metaheuristic algorithms is presented. The customization of metaheuristic algorithms to fit the constraints of specific problems is discussed. Some weaknesses and pitfalls found in literature contributions are identified, and specific guidelines are provided on how to prepare sound contributions on the application of metaheuristic algorithms to specific problems

Metaheuristic design of feedforward neural networks: a review of two decades of research

Over the past two decades, the feedforward neural network (FNN) optimization has been a key interest among the researchers and practitioners of multiple disciplines. The FNN optimization is often viewed from the various perspectives: the optimization of weights, network architecture, activation nodes, learning parameters, learning environment, etc. Researchers adopted such different viewpoints mainly to improve the FNN's generalization ability. The gradient-descent algorithm such as backpropagation has been widely applied to optimize the FNNs. Its success is evident from the FNN's application to numerous real-world problems. However, due to the limitations of the gradient-based optimization methods, the metaheuristic algorithms including the evolutionary algorithms, swarm intelligence, etc., are still being widely explored by the researchers aiming to obtain generalized FNN for a given problem. This article attempts to summarize a broad spectrum of FNN optimization methodologies including conventional and metaheuristic approaches. This article also tries to connect various research directions emerged out of the FNN optimization practices, such as evolving neural network (NN), cooperative coevolution NN, complex-valued NN, deep learning, extreme learning machine, quantum NN, etc. Additionally, it provides interesting research challenges for future research to cope-up with the present information processing era

Metaheuristic Optimization of Power and Energy Systems: Underlying Principles and Main Issues of the `Rush to Heuristics'

In the power and energy systems area, a progressive increase of literature contributions that contain applications of metaheuristic algorithms is occurring. In many cases, these applications are merely aimed at proposing the testing of an existing metaheuristic algorithm on a specific problem, claiming that the proposed method is better than other methods that are based on weak comparisons. This ‘rush to heuristics’ does not happen in the evolutionary computation domain, where the rules for setting up rigorous comparisons are stricter but are typical of the domains of application of the metaheuristics. This paper considers the applications to power and energy systems and aims at providing a comprehensive view of the main issues that concern the use of metaheuristics for global optimization problems. A set of underlying principles that characterize the metaheuristic algorithms is presented. The customization of metaheuristic algorithms to fit the constraints of specific problems is discussed. Some weaknesses and pitfalls that are found in literature contributions are identified, and specific guidelines are provided regarding how to prepare sound contributions on the application of metaheuristic algorithms to specific problems

Global convergence analysis of the flower pollination algorithm: a Discrete-Time Markov Chain Approach

Flower pollination algorithm is a recent metaheuristic algorithm for solving nonlinear global optimization problems. The algorithm has also been extended to solve multiobjective optimization with promising results. In this work, we analyze this algorithm mathematically and prove its convergence properties by using Markov chain theory. By constructing the appropriate transition probability for a population of flower pollen and using the homogeneity property, it can be shown that the constructed stochastic sequences can converge to the optimal set. Under the two proper conditions for convergence, it is proved that the simplified flower pollination algorithm can indeed satisfy these convergence conditions and thus the global convergence of this algorithm can be guaranteed. Numerical experiments are used to demonstrate that the flower pollination algorithm can converge quickly in practice and can thus achieve global optimality efficiently

Efficiency Analysis of Swarm Intelligence and Randomization Techniques

Swarm intelligence has becoming a powerful technique in solving design and scheduling tasks. Metaheuristic algorithms are an integrated part of this paradigm, and particle swarm optimization is often viewed as an important landmark. The outstanding performance and efficiency of swarm-based algorithms inspired many new developments, though mathematical understanding of metaheuristics remains partly a mystery. In contrast to the classic deterministic algorithms, metaheuristics such as PSO always use some form of randomness, and such randomization now employs various techniques. This paper intends to review and analyze some of the convergence and efficiency associated with metaheuristics such as firefly algorithm, random walks, and L\'evy flights. We will discuss how these techniques are used and their implications for further research.Comment: 10 pages. arXiv admin note: substantial text overlap with arXiv:1212.0220, arXiv:1208.0527, arXiv:1003.146

Global convergence analysis of the flower pollination algorithm: a Discrete-Time Markov Chain Approach

Flower pollination algorithm is a recent metaheuristic algorithm for solving nonlinear global optimization problems. The algorithm has also been extended to solve multiobjective optimization with promising results. In this work, we analyze this algorithm mathematically and prove its convergence properties by using Markov chain theory. By constructing the appropriate transition probability for a population of flower pollen and using the homogeneity property, it can be shown that the constructed stochastic sequences can converge to the optimal set. Under the two proper conditions for convergence, it is proved that the simplified flower pollination algorithm can indeed satisfy these convergence conditions and thus the global convergence of this algorithm can be guaranteed. Numerical experiments are used to demonstrate that the flower pollination algorithm can converge quickly in practice and can thus achieve global optimality efficiently

Generalized Lorenz-Mie theory : application to scattering and resonances of photonic complexes

Les structures photoniques complexes permettent de façonner la propagation lumineuse à l’échelle de la longueur d’onde au moyen de processus de diffusion et d’interférence. Cette fonctionnalité à l’échelle nanoscopique ouvre la voie à de multiples applications, allant des communications optiques aux biosenseurs. Cette thèse porte principalement sur la modélisation numérique de structures photoniques complexes constituées d’arrangements bidimensionnels de cylindres diélectriques. Deux applications sont privilégiées, soit la conception de dispositifs basés sur des cristaux photoniques pour la manipulation de faisceaux, de même que la réalisation de sources lasers compactes basées sur des molécules photoniques. Ces structures optiques peuvent être analysées au moyen de la théorie de Lorenz-Mie généralisée, une méthode numérique permettant d’exploiter la symétrie cylindrique des diffuseurs sous-jacents. Cette dissertation débute par une description de la théorie de Lorenz-Mie généralisée, obtenue des équations de Maxwell de l’électromagnétisme. D’autres outils théoriques utiles sont également présentés, soit une nouvelle formulation des équations de Maxwell-Bloch pour la modélisation de milieux actifs appelée SALT (steady state ab initio laser theory). Une description sommaire des algorithmes d’optimisation dits métaheuristiques conclut le matériel introductif de la thèse. Nous présentons ensuite la conception et l’optimisation de dispositifs intégrés permettant la génération de faisceaux d’amplitude, de phase et de degré de polarisation contrôlés. Le problème d’optimisation combinatoire associé est solutionné numériquement au moyen de deux métaheuristiques, l’algorithme génétique et la recherche tabou. Une étude théorique des propriétés de micro-lasers basés sur des molécules photoniques – constituées d’un arrangement simple de cylindres actifs – est finalement présentée. En combinant la théorie de Lorenz-Mie et SALT, nous démontrons que les propriétés physiques de ces lasers, plus spécifiquement leur seuil, leur spectre et leur profil d’émission, peuvent être affectés de façon nontriviale par les paramètres du milieu actif sous-jacent. Cette conclusion est hors d’atteinte de l’approche établie qui consiste à calculer les étatsméta-stables de l’équation de Helmholtz et leur facteur de qualité. Une perspective sur la modélisation de milieux photoniques désordonnés conclut cette dissertation.Complex photonic media mold the flow of light at the wavelength scale using multiple scattering and interference effects. This functionality at the nano-scale level paves the way for various applications, ranging from optical communications to biosensing. This thesis is mainly concerned with the numerical modeling of photonic complexes based on twodimensional arrays of cylindrical scatterers. Two applications are considered, namely the use of photonic-crystal-like devices for the design of integrated beam shaping elements, as well as active photonic molecules for the realization of compact laser sources. These photonic structures can be readily analyzed using the 2D Generalized Lorenz-Mie theory (2D-GLMT), a numerical scheme which exploits the symmetry of the underlying cylindrical structures. We begin this thesis by presenting the electromagnetic theory behind 2D-GLMT.Other useful frameworks are also presented, including a recently formulated stationary version of theMaxwell-Bloch equations called steady-state ab initio laser theory (SALT).Metaheuristics, optimization algorithms based on empirical rules for exploring large solution spaces, are also discussed. After laying down the theoretical content, we proceed to the design and optimization of beam shaping devices based on engineered photonic-crystal-like structures. The combinatorial optimization problem associated to beam shaping is tackled using the genetic algorithm (GA) as well as tabu search (TS). Our results show the possibility to design integrated beam shapers tailored for the control of the amplitude, phase and polarization profile of the output beam. A theoretical and numerical study of the lasing characteristics of photonic molecules – composed of a few coupled optically active cylinders – is also presented. Using a combination of 2D-GLMT and SALT, it is shown that the physical properties of photonic molecule lasers, specifically their threshold, spectrum and emission profile, can be significantly affected by the underlying gain medium parameters. These findings are out of reach of the established approach of computing the meta-stable states of the Helmholtz equation and their quality factor. This dissertation is concluded with a research outlook concerning themodeling of disordered photonicmedia

Metaheuristics for Transmission Network Expansion Planning

This chapter presents the characteristics of the metaheuristic algorithms used to solve the transmission network expansion planning (TNEP) problem. The algorithms used to handle single or multiple objectives are discussed on the basis of selected literature contributions. Besides the main objective given by the costs of the transmission system infrastructure, various other objectives are taken into account, representing generation, demand, reliability and environmental aspects. In the single-objective case, many metaheuristics have been proposed, in general without making strong comparisons with other solution methods and without providing superior results with respect to classical mathematical programming. In the multi-objective case, there is a better convenience of using metaheuristics able to handle conflicting objectives, in particular with a Pareto front-based approach. In all cases, improvements are still expected in the definition of benchmark functions, benchmark networks and robust comparison criteria