z-logo
Premium
Worst Case Prediction‐Based Differential Evolution for Multi‐Noisy‐Hard‐Objective Optimization Problems
Author(s) -
TAGAWA KIYOHARU,
HARADA SHOICHI
Publication year - 2017
Publication title -
electronics and communications in japan
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.131
H-Index - 13
eISSN - 1942-9541
pISSN - 1942-9533
DOI - 10.1002/ecj.11947
Subject(s) - differential evolution , mathematical optimization , resampling , optimization problem , multi objective optimization , computer science , evolutionary algorithm , mathematics , algorithm
SUMMARY A new multiobjective optimization problem in presence of noise is formulated and called multi‐noisy‐hard‐objective optimization problem (MNHOP). Since considering the worst case performance is important in many real‐world optimization problems, each solution of MNHOP is evaluated based on the upper bounds of noisy objective functions’ values predicted statistically from multiple samples. Then an Evolutionary Multiobjective Optimization Algorithm (EMOA) based on Differential Evolution is applied to MNHOP. Three sample saving techniques, namely U‐cut, C‐cut, and resampling, are proposed and introduced into the EMOA for allocating its computing budget only to promising solutions. Finally, the effects of those techniques are examined through numerical experiments.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here