Skip to main navigation Skip to search Skip to main content

When Hillclimbers Beat Genetic Algorithms in Multimodal Optimization

  • Universidade do Algarve, Faro

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We show that multistart next ascent hillclimbing compares favourably to crowding-based genetic algorithms when solving instances of the multimodal problem generator. We conjecture that it is unlikely that any practical evolutionary algorithm is capable of solving this type of problem instances faster than the multistart hillclimbing strategy.
Original languageEnglish
Title of host publicationProceedings of the Companion Publication of the 2015 Annual Conference on Genetic and Evolutionary Computation
Place of PublicationNew York, NY, USA
PublisherAssociation for Computing Machinery
Pages1421–1422
ISBN (Print)9781450334884
DOIs
Publication statusPublished - 2015
Externally publishedYes

Publication series

NameGECCO Companion '15
PublisherAssociation for Computing Machinery

Keywords

  • niching
  • multimodal problem generator
  • multimodal optimization
  • hillclimbing
  • genetic algorithms

Fingerprint

Dive into the research topics of 'When Hillclimbers Beat Genetic Algorithms in Multimodal Optimization'. Together they form a unique fingerprint.

Cite this