Dual evolutionary optimization
Résumé
The most general strategy for handling constraints in evolutionary optimization is through penalty functions. The choice of the penalty function is critical to both success and efficiency of the optimization. Many strategies have been proposed for formulating penalty functions, most of which rely on arbitrary tuning of parameters. An new insight on function penalization is proposed in this paper that relies on the dual optimization problem. An evolutionary algorithm for approximately solving dual optimization problems is first presented. Next, an efficient and exact penalty function without penalization parameter to be tuned is proposed. Numerical tests are provided for continuous variables and inequality constraints.