In this work the concept of a trie-based complete solution
archive in combination with a genetic algorithm is applied to the Reconstruction
of Cross-Cut Shredded Text Documents (RCCSTD) problem.
This archive is able to detect and subsequently convert duplicates into
new yet unvisited solutions. Cross-cut shredded documents are documents
that are cut into rectangular pieces of equal size and shape. The
reconstruction of documents can be of high interest in forensic science.
Two types of tries are compared as underlying data structure, an indexed
trie and a linked trie. Experiments indicate that the latter needs considerably
less memory without affecting the run-time. While the archiveenhanced
genetic algorithm yields better results for runs with a fixed
number of iterations, advantages diminish due to the additional overhead
when considering run-time.