Topic
Evolutionary programming
About: Evolutionary programming is a research topic. Over the lifetime, 6007 publications have been published within this topic receiving 219180 citations.
Papers published on a yearly basis
Papers
More filters
TL;DR: This article provides a general overview of the field now known as "evolutionary multi-objective optimization," which refers to the use of evolutionary algorithms to solve problems with two or more (often conflicting) objective functions.
Abstract: This article provides a general overview of the field now known as "evolutionary multi-objective optimization," which refers to the use of evolutionary algorithms to solve problems with two or more (often conflicting) objective functions. Using as a framework the history of this discipline, we discuss some of the most representative algorithms that have been developed so far, as well as some of their applications. Also, we discuss some of the methodological issues related to the use of multi-objective evolutionary algorithms, as well as some of the current and future research trends in the area.
1,213 citations
TL;DR: The performance of evolutionary programs on ELD problems is examined and modifications to the basic technique are proposed, where adaptation is based on scaled cost and adaptation based on an empirical learning rate are developed.
Abstract: Evolutionary programming has emerged as a useful optimization tool for handling nonlinear programming problems. Various modifications to the basic method have been proposed with a view to enhance speed and robustness and these have been applied successfully on some benchmark mathematical problems. But few applications have been reported on real-world problems such as economic load dispatch (ELD). The performance of evolutionary programs on ELD problems is examined and presented in this paper in two parts. In Part I, modifications to the basic technique are proposed, where adaptation is based on scaled cost. In Part II, evolutionary programs are developed with adaptation based on an empirical learning rate. Absolute, as well as relative, performance of the algorithms are investigated on ELD problems of different size and complexity having nonconvex cost curves where conventional gradient-based methods are inapplicable.
1,207 citations
TL;DR: In this paper, a modified particle swarm optimization (MPSO) was proposed to deal with the equality and inequality constraints in the economic dispatch (ED) problems with nonsmooth cost functions.
Abstract: This work presents a new approach to economic dispatch (ED) problems with nonsmooth cost functions using a particle swarm optimization (PSO) technique. The practical ED problems have nonsmooth cost functions with equality and inequality constraints that make the problem of finding the global optimum difficult using any mathematical approaches. A modified PSO (MPSO) mechanism is suggested to deal with the equality and inequality constraints in the ED problems. A constraint treatment mechanism is devised in such a way that the dynamic process inherent in the conventional PSO is preserved. Moreover, a dynamic search-space reduction strategy is devised to accelerate the optimization process. To show its efficiency and effectiveness, the proposed MPSO is applied to test ED problems, one with smooth cost functions and others with nonsmooth cost functions considering valve-point effects and multi-fuel problems. The results of the MPSO are compared with the results of conventional numerical methods, Tabu search method, evolutionary programming approaches, genetic algorithm, and modified Hopfield neural network approaches.
1,172 citations
TL;DR: It is argued that genetic algorithms are inappropriate for network acquisition and an evolutionary program is described, called GNARL, that simultaneously acquires both the structure and weights for recurrent networks.
Abstract: Standard methods for simultaneously inducing the structure and weights of recurrent neural networks limit every task to an assumed class of architectures. Such a simplification is necessary since the interactions between network structure and function are not well understood. Evolutionary computations, which include genetic algorithms and evolutionary programming, are population-based search methods that have shown promise in many similarly complex tasks. This paper argues that genetic algorithms are inappropriate for network acquisition and describes an evolutionary program, called GNARL, that simultaneously acquires both the structure and weights for recurrent networks. GNARL's empirical acquisition method allows for the emergence of complex behaviors and topologies that are potentially excluded by the artificial architectural constraints imposed in standard network induction methods. >
1,092 citations
TL;DR: This paper provides a concise overview of the history and recent developments in surrogate-assisted evolutionary computation and suggests a few future trends in this research area.
Abstract: Surrogate-assisted, or meta-model based evolutionary computation uses efficient computational models, often known as surrogates or meta-models, for approximating the fitness function in evolutionary algorithms. Research on surrogate-assisted evolutionary computation began over a decade ago and has received considerably increasing interest in recent years. Very interestingly, surrogate-assisted evolutionary computation has found successful applications not only in solving computationally expensive single- or multi-objective optimization problems, but also in addressing dynamic optimization problems, constrained optimization problems and multi-modal optimization problems. This paper provides a concise overview of the history and recent developments in surrogate-assisted evolutionary computation and suggests a few future trends in this research area.
1,072 citations