On gradient-based local search to hybridize multi-objective evolutionary algorithms

Adriana Lara, Oliver Schütze, Carlos A. Coello Coello

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

6 Scopus citations

Abstract

Using evolutionary algorithms when solving multi-objective optimization problems (MOPs) has shown remarkable results during the last decade. As a consolidated research area it counts with a number of guidelines and processes; even though, their efficiency is still a big issue which lets room for improvements. In this chapter we explore the use of gradient-based information to increase efficiency on evolutionary methods, when dealing with smooth real-valued MOPs. We show the main aspects to be considered when building local search operators using the objective function gradients, and when coupling them with evolutionary algorithms. We present an overview of our current methods with discussion about their convenience for particular kinds of problems.

Translated title of the contributionEn la búsqueda local basada en gradientes para hibridar algoritmos evolutivos multiobjetivo
Original languageEnglish
Title of host publicationEVOLVE- A Bridge between Probability, Set Oriented Numerics and Evolutionary Computation
EditorsEmilia Tantar, Pascal Bouvry, Alexandru-Adrian Tantar, Pierre Del Moral, Pierrick Legrand, Pierre Del Moral, Pierrick Legrand, Carlos Coello Coello, Oliver Schutze
Pages305-332
Number of pages28
DOIs
StatePublished - 2013

Publication series

NameStudies in Computational Intelligence
Volume447
ISSN (Print)1860-949X

Fingerprint

Dive into the research topics of 'On gradient-based local search to hybridize multi-objective evolutionary algorithms'. Together they form a unique fingerprint.

Cite this