Facilitating Evolutionary Algorithm Analysis with Persistent Data Structures
E. Pitzer, M. Affenzeller - Facilitating Evolutionary Algorithm Analysis with Persistent Data Structures - Lecture Notes in Computer Science 10671, Las Palmas de Gran Canaria, Spain, 2017, pp. 416-423
Evolutionary algorithm analysis is often impeded by the large amounts of intermediate data that is usually discarded and has to be painstakingly reconstructed for real-world large-scale applications. In the recent past persistent data structures have been developed which offer extremely compact storage with acceptable runtime penalties. In this work, two promising persistent data structures are explored in the context of evolutionary computation with the hope to open the door to simplified analysis of large-scale evolutionary algorithm runs.