Towards high speed multiobjective evolutionary optimizers

One of the major difficulties when applying Multiobjective Evolutionary Algorithms (MOEA) to real world problems is the large number of objective function evaluations. Approximate (or surrogate) methods offer the possibility of reducing the number of evaluations, without reducing solution quality. Artificial Neural Network (ANN) based models are one approach that have been utilized to approximate the future front from the current available fronts with acceptable accuracy levels. However, the associated computational costs limit their effectiveness. In this research project, we have developed a simple approximation technique with comparatively smaller computational cost. Our model, has been developed as a variation operator that can be utilized in any kind of multiobjective optimizer. Initial simulation experiments have produced encouraging results in comparison to other existing sequential algorithms (i.e. NSGA-II, SPEAII). In the next phase of the project, this model will be integ...

• Type: Conference
• Year: 2008
• Where: GECCO
• Authors: A. K. M. Khaled Ahsan Talukder
• Keywords: Computational Cost, GECCO 2008, Multiobjective Evolutionary Algorithms, Objective Function Evaluations, Optimization