New challenges for memetic algorithms on continuous multi-objective problems

Adriana Lara, Carlos A.Coello Coello, Oliver Schuetze

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

2 Scopus citations

Abstract

This work presents the main aspects to tackle when designing memetic algorithms using gradient-based local searchers. We address the main drawbacks and advantages of this coupling, when focusing on the efficiency of the local search stage. We conclude with some guidelines and draw further research paths in these topics.

Original languageEnglish
Title of host publicationProceedings of the 12th Annual Genetic and Evolutionary Computation Conference, GECCO '10 - Companion Publication
Pages1967-1970
Number of pages4
DOIs
StatePublished - 2010
Externally publishedYes
Event12th Annual Genetic and Evolutionary Computation Conference, GECCO-2010 - Portland, OR, United States
Duration: 7 Jul 201011 Jul 2010

Publication series

NameProceedings of the 12th Annual Genetic and Evolutionary Computation Conference, GECCO '10 - Companion Publication

Conference

Conference12th Annual Genetic and Evolutionary Computation Conference, GECCO-2010
Country/TerritoryUnited States
CityPortland, OR
Period7/07/1011/07/10

Keywords

  • Memetic algorithms
  • Multi-objective search directions

Fingerprint

Dive into the research topics of 'New challenges for memetic algorithms on continuous multi-objective problems'. Together they form a unique fingerprint.

Cite this