Benchmarks for dynamic multi-objective optimisation algorithms

  • Authors:

  • Mardé Helbig;Andries P. Engelbrecht

  • Affiliations:

  • CSIR, Meraka Institute and University of Pretoria, Department of Computer Science, Pretoria, South Africa;University of Pretoria, Department of Computer Science, Pretoria, South Africa

  • Venue:
  • ACM Computing Surveys (CSUR)
  • Year:
  • 2014

Quantified Score

Hi-index 0.00

Visualization

Abstract

Algorithms that solve Dynamic Multi-Objective Optimisation Problems (DMOOPs) should be tested on benchmark functions to determine whether the algorithm can overcome specific difficulties that can occur in real-world problems. However, for Dynamic Multi-Objective Optimisation (DMOO), no standard benchmark functions are used. A number of DMOOPs have been proposed in recent years. However, no comprehensive overview of DMOOPs exist in the literature. Therefore, choosing which benchmark functions to use is not a trivial task. This article seeks to address this gap in the DMOO literature by providing a comprehensive overview of proposed DMOOPs, and proposing characteristics that an ideal DMOO benchmark function suite should exhibit. In addition, DMOOPs are proposed for each characteristic. Shortcomings of current DMOOPs that do not address certain characteristics of an ideal benchmark suite are highlighted. These identified shortcomings are addressed by proposing new DMOO benchmark functions with complicated Pareto-Optimal Sets (POSs), and approaches to develop DMOOPs with either an isolated or deceptive Pareto-Optimal Front (POF). In addition, DMOO application areas and real-world DMOOPs are discussed.