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.
No takes yet. Share an insight, caveat, or question.
David B. Fogel (1995) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: