Handling uncertainties in evolutionary multi-objective optimization

  • Authors:
  • Kay Chen Tan;Chi Keong Goh

  • Affiliations:
  • National University of Singapore, Singapore;Data Storage Institute, Agency for Science Technology and Research, Singapore

  • Venue:
  • WCCI'08 Proceedings of the 2008 IEEE world conference on Computational intelligence: research frontiers
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Evolutionary algorithms are stochastic search methods that are efficient and effective for solving sophisticated multi-objective (MO) problems. Advances made in the field of evolutionary multi-objective optimization (EMO) are the results of two decades worth of intense research, studying various topics that are unique to MO optimization. However many of these studies assume that the problem is deterministic and static, and the EMO performance generally deteriorates in the presence of uncertainties. In certain situations, the solutions found may not even be implementable in practice. In this chapter, the challenges faced in handling three different forms of uncertainties in EMO will be discussed, including 1) noisy objective functions, 2) dynamic MO fitness landscape, and 3) robust MO optimization. Specifically, the impact of these uncertainties on MO optimization will be described and the approaches/modifications to basic algorithm design for better and robust EMO performance will be presented.