A Comparison of Evolutionary Programming and Genetic Algorithms on Selected Constrained Optimization Problems

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.