Dynamic combinatorial optimization problems: A fitness landscape analysis

Philipp ROHLFSHAGEN*, Xin YAO

*Corresponding author for this work

Research output: Book Chapters | Papers in Conference ProceedingsBook ChapterResearchpeer-review

10 Citations (Scopus)

Abstract

The role of representations and variation operators in evolutionary computation is relatively well understood for the case of static optimization problems thanks to a variety of empirical studies as well as some theoretical results. In the field of evolutionary dynamic optimization very few studies exist to date that explicitly analyse the impact of these elements on the algorithm's performance. In this chapter we utilise the fitness landscape metaphor to review previous work on evolutionary dynamic combinatorial optimization. This review highlights some of the properties unique to dynamic combinatorial optimization problems and paves the way for future research related to these important issues. © Springer-Verlag Berlin Heidelberg 2013.
Original languageEnglish
Title of host publicationMetaheuristics for Dynamic Optimization
EditorsEnrique ALBA, Amir NAKIB, Patrick SIARRY
PublisherSpringer
Chapter5
Pages79-97
Number of pages19
ISBN (Electronic)9783642306655
ISBN (Print)9783642306648, 9783642443701
DOIs
Publication statusPublished - 2013
Externally publishedYes

Publication series

NameStudies in Computational Intelligence
PublisherSpringer
Volume433
ISSN (Print)1860-949X
ISSN (Electronic)1860-9503

Fingerprint

Dive into the research topics of 'Dynamic combinatorial optimization problems: A fitness landscape analysis'. Together they form a unique fingerprint.

Cite this