Benchmarking heuristic search and optimisation algorithms in Matlab

Wuqiao Luo*, Yun Li

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution book

10 Citations (Scopus)

Abstract

With the proliferating development of heuristic methods, it has become challenging to choose the most suitable ones for an application at hand. This paper evaluates the performance of these algorithms available in Matlab, as it is problem dependent and parameter sensitive. Further, the paper attempts to address the challenge that there exists no satisfied benchmarks to evaluation all the algorithms at the same standard. The paper tests five heuristic algorithms in Matlab, the Nelder-Mead simplex search, the Genetic Algorithm, the Genetic Algorithm with elitism, Simulated Annealing and Particle Swarm Optimization, with four widely adopted benchmark problems. The Genetic Algorithm has an overall best performance at optimality and accuracy, while PSO has fast convergence speed when facing unimodal problem.

Original languageEnglish
Title of host publication2016 22nd International Conference on Automation and Computing, ICAC 2016
Subtitle of host publicationTackling the New Challenges in Automation and Computing
Pages250-255
Number of pages6
DOIs
Publication statusPublished - 20 Oct 2016
Event22nd International Conference on Automation and Computing, ICAC 2016 - University of Essex, Colchester, United Kingdom
Duration: 7 Sept 20168 Sept 2016
http://www.cacsuk.co.uk/index.php/conferences

Conference

Conference22nd International Conference on Automation and Computing, ICAC 2016
Abbreviated titleICAC 2016
Country/TerritoryUnited Kingdom
CityColchester
Period7/09/168/09/16
Internet address

Keywords

  • benchmarks
  • evolutionary algorithms
  • numerical optimization
  • single-objective

Fingerprint

Dive into the research topics of 'Benchmarking heuristic search and optimisation algorithms in Matlab'. Together they form a unique fingerprint.

Cite this