[Zurück]

B. Hu, G. Raidl:
"An evolutionary algorithm with solution archive for the generalized minimum spanning tree problem";
Vortrag: International Conference on Computer Aided Systems Theory (Eurocast), Gran Canaria, Spain; 06.02.2011 - 11.02.2011; in: "Proceedings of the 13th International Conference on Computer Aided Systems Theory: Part I", volume 6927 of LNCS (2012), ISBN: 978-3642275487; S. 287 - 294.

We propose a concept of enhancing an evolutionary algorithm
(EA) with a complete solution archive that stores evaluated solutions
during the optimization in a trie in order to detect duplicates and
to e ciently convert them into yet unconsidered solutions. As an application
we consider the generalized minimum spanning tree problem where
we are given a graph with nodes partitioned into clusters and exactly one
node from each cluster must be connected. For this problem there exist
two compact solution representations that can be e ciently decoded, and
we use them jointly in our EA. The solution archive contains two tries
{ each is based on one representation, respectively. We show that these two tries complement each other well. Test results on TSPlib instances
document the strength of this concept and that it can match up with the leading state-of-the-art metaheuristic approaches from the literature.

http://publik.tuwien.ac.at/files/PubDat_213006.pdf