A Comparison of Evolutionary Programming and Genetic Algorithms on Selected Constrained Optimization Problems
- 1 June 1995
- journal article
- other
- Published by SAGE Publications in SIMULATION
- Vol. 64 (6) , 397-404
- https://doi.org/10.1177/003754979506400605
Abstract
Evolutionary programming and genetic algorithms are compared on two constrained optimization problems. The constrained problems are redesigned as related unconstrained problems by the application of penalty functions. The experiments indicate that evolutionary programming outperforms the genetic algorithm. The results are statistically significant under nonparametric hypothesis testing. The results also indicate potential difficulties in the design of suitable penalty functions for constrained optimization problems. A discussion is offered regarding the suitability of different methods of evolutionary computation for such problems.Keywords
This publication has 16 references indexed in Scilit:
- ASYMPTOTIC CONVERGENCE PROPERTIES OF GENETIC ALGORITHMS AND EVOLUTIONARY PROGRAMMING: ANALYSIS AND EXPERIMENTSCybernetics and Systems, 1994
- Constrained Optimization Via Genetic AlgorithmsSIMULATION, 1994
- An evolutionary algorithm that constructs recurrent neural networksIEEE Transactions on Neural Networks, 1994
- An introduction to simulated evolutionary optimizationIEEE Transactions on Neural Networks, 1994
- On the effectiveness of crossover in simulated evolutionary optimizationBiosystems, 1994
- Evolutionary algorithms and a fractal inverse problemBiosystems, 1994
- Notes on the simulation of evolutionIEEE Transactions on Neural Networks, 1994
- An Overview of Evolutionary Algorithms for Parameter OptimizationEvolutionary Computation, 1993
- Dynamic Parameter Encoding for genetic algorithmsMachine Learning, 1992
- Evolutionary learning circuitsJournal of Theoretical Biology, 1974