Talks and Poster Presentations (with Proceedings-Entry):

M. Prandtstetter, G. Raidl:
"Meta-heuristics for reconstructing cross cut shredded text documents";
Talk: GECCO: Genetic and Evolutionary Computation Conference, Montreal, Kanada; 2009-07-08 - 2009-07-12; in: "Proceedings of the 11th annual conference on Genetic and evolutionary computation", (2009), 8 pages.

English abstract:
In this work, we present two new approaches based on variable
neighborhood search (VNS) and ant colony optimization
(ACO) for the reconstruction of cross cut shredded text
documents. For quickly obtaining initial solutions, we consider
four di erent construction heuristics. While one of
them is based on the well known algorithm of Prim, another
one tries to match shreds according to the similarity of their
borders. Two further construction heuristics rely on the fact
that in most cases the left and right edges of paper documents
are blank, i.e. no text is written on them. Randomized
variants of these construction heuristics are applied within
the ACO. Experimental tests reveal that regarding the solution
quality the proposed ACO variants perform better
than the VNS approaches in most cases, while the running
times needed are shorter for VNS. The high potential of
these approaches for reconstructing cross cut shredded text
documents is underlined by the obtained results.

Electronic version of the publication:

Created from the Publication Database of the Vienna University of Technology.