Institutions | About Us | Help | Gaeilge
rian logo

Go Back
On the Use of Dynamic GP Fitness Cases in Static and Dynamic Optimisation Problems
Galvan, Edgar; Vazquez, Lucia; Schoenauer, Marc; Trujillo, Leonardo
In Genetic Programming (GP), the fitness of individuals is normally computed by using a set of fitness cases (FCs). Research on the use of FCs in GP has primarily focused on how to reduce the size of these sets. However, often, only a small set of FCs is available and there is no need to reduce it. In this work, we are interested in using the whole FCs set, but rather than adopting the commonly used GP approach of presenting the entire set of FCs to the system from the beginning of the search, referred as static FCs, we allow the GP system to build it by aggregation over time, named as dynamic FCs, with the hope to make the search more amenable. Moreover, there is no study on the use of FCs in Dynamic Optimisation Problems (DOPs). To this end, we also use the Kendall Tau Distance (KTD) approach, which quantifies pairwise dissimilarities among two lists of fitness values. KTD aims to capture the degree of a change in DOPs and we use this to promote structural diversity. Results on eight symbolic regression functions indicate that both approaches are highly beneficial in GP.
Keyword(s): Genetic programming; Fitness Cases; Static and Dynamic Optimisation Problems
Publication Date:
Type: Book chapter
Peer-Reviewed: Yes
Institution: Maynooth University
Citation(s): Galvan, Edgar and Vazquez, Lucia and Schoenauer, Marc and Trujillo, Leonardo (2018) On the Use of Dynamic GP Fitness Cases in Static and Dynamic Optimisation Problems. In: EA 2017: Artificial Evolution. Lecture Notes in Computer Science book series (LNCS 10764) . Springer, pp. 72-87. ISBN 9783319781327
Publisher(s): Springer
File Format(s): other
Related Link(s):
First Indexed: 2018-12-05 06:01:06 Last Updated: 2018-12-05 06:01:06