Dynamic landscape analysis for open-ended stacking

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

2 Citations (Scopus)

Abstract

Fitness landscape analysis (FLA) is a useful tool in the domain of (meta-)heuristic optimization but depends on explicitly knowing what fitness value is assigned to each solution. Dynamic optimization problems often do not provide their fitness landscape in such an explicit form, but by employing problem-specific knowledge, information about the problem itself and its current state can still be obtained. In this paper, a type of gray-box analysis of states of the open-ended stacking problem in two variations is presented. The current states obtained by monitoring the problem and algorithm during optimization are described via statistical measures similar to FLA measures. From this the distribution of possible states (the state landscape) and the transitions between problem states are analyzed. Visualization of the empirically obtained results reveals insights into algorithm-problem dynamics.

Original languageEnglish
Title of host publicationGECCO 2021 Companion - Proceedings of the 2021 Genetic and Evolutionary Computation Conference Companion
PublisherAssociation for Computing Machinery, Inc
Pages1700-1707
Number of pages8
ISBN (Electronic)9781450383516
DOIs
Publication statusPublished - 7 Jul 2021
Event2021 Genetic and Evolutionary Computation Conference, GECCO 2021 - Virtual, Online, France
Duration: 10 Jul 202114 Jul 2021

Publication series

NameGECCO 2021 Companion - Proceedings of the 2021 Genetic and Evolutionary Computation Conference Companion

Conference

Conference2021 Genetic and Evolutionary Computation Conference, GECCO 2021
Country/TerritoryFrance
CityVirtual, Online
Period10.07.202114.07.2021

Keywords

  • dynamic optimization
  • fitness landscape analysis
  • state space analysis

Fingerprint

Dive into the research topics of 'Dynamic landscape analysis for open-ended stacking'. Together they form a unique fingerprint.

Cite this