A sequential algorithm portfolio approach for black box optimization

Yaodong He*, Shiu Yin Yuen, Yang Lou, Xin Zhang

*Corresponding author for this work

Research output: Journal Publications and ReviewsRGC 21 - Publication in refereed journalpeer-review

Abstract

A large number of optimization algorithms have been proposed. However, the no free lunch (NFL) theorems inform us that no algorithm can solve all types of optimization problems. An approach, which can suggest the most suitable algorithm for different types of problems, is valuable. In this paper, we propose an approach called sequential algorithm portfolio (SAP) which belongs to the inter-disciplinary fields of algorithm portfolio and algorithm selection. It uses a pre-trained predictor to predict the most suitable algorithm and a termination mechanism to automatically stop the optimization algorithms. The SAP is easy to implement and can incorporate any optimization algorithm. We experimentally compare SAP with two state-of-the-art algorithm portfolio approaches and single optimization algorithms. The result shows that SAP is a well-performing algorithm portfolio approach.
Original languageEnglish
Pages (from-to)559-570
JournalSwarm and Evolutionary Computation
Volume44
Online published1 Aug 2018
DOIs
Publication statusPublished - Feb 2019

Research Keywords

  • Algorithm portfolio
  • Algorithm selection
  • Heuristic algorithms
  • Optimization problems
  • Performance prediction

Fingerprint

Dive into the research topics of 'A sequential algorithm portfolio approach for black box optimization'. Together they form a unique fingerprint.

Cite this