Constrained Evolutionary Optimization by Approximate Ranking and Surrogate Models

Abstract. The paper describes an evolutionary algorithm for the general nonlinear programming problem using a surrogate model. Surrogate models are used in optimization when model evaluation is expensive. Two surrogate models are implemented, one for the objective function and another for a penalty function based on the constraint violations. The proposed method uses a sequential technique for updating these models. The quality of the surrogate models is determined by their consistency in ranking the population rather than their statistical accuracy. The technique is evaluated on a number of standard test problems.

• Type: Conference
• Year: 2004
• Where: PPSN
• Authors: Thomas Philip Runarsson
• Keywords: Distributed And Parallel Computing, Nonlinear Programming Problem, Penalty Function, PPSN 2004, Surrogate Models