Abstract
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 efficiently 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 efficiently 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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Feremans, C.: Generalized Spanning Trees and Extensions. PhD thesis, Universite Libre de Bruxelles (2001)
Fredkin, E.: Trie memory. Communications of the ACM 3, 490–499 (1960)
Ghosh, D.: Solving medium to large sized Euclidean generalized minimum spanning tree problems. Technical Report NEP-CMP-2003-09-28, Indian Institute of Management, Research and Publication Department, Ahmedabad, India (2003)
Golden, B., Raghavan, S., Stanojevic, D.: Heuristic search for the generalized minimum spanning tree problem. INFORMS Journal on Computing 17(3), 290–304 (2005)
Hu, B., Leitner, M., Raidl, G.R.: Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem. Journal of Heuristics 14(5), 473–499 (2008)
Jiang, H., Chen, Y.: An efficient algorithm for generalized minimum spanning tree problem. In: GECCO 2010: Proceedings of the 12th Annual Conference on Genetic and Evolutionary Computation, pp. 217–224. ACM, New York (2010)
Kratica, J.: Improving performances of the genetic algorithm by caching. Computers and Artificial Intelligence 18(3), 271–283 (1999)
Myung, Y.S., Lee, C.H., Tcha, D.W.: On the generalized minimum spanning tree problem. Networks 26, 231–241 (1995)
Pop, P.C.: The Generalized Minimum Spanning Tree Problem. PhD thesis, University of Twente, The Netherlands (2002)
Raidl, G.R., Hu, B.: Enhancing genetic algorithms by a trie-based complete solution archive. In: Cowling, P., Merz, P. (eds.) EvoCOP 2010. LNCS, vol. 6022, pp. 239–251. Springer, Heidelberg (2010)
Raidl, G.R., Julstrom, B.A.: Edge-sets: An effective evolutionary coding of spanning trees. IEEE Transactions on Evolutionary Computation 7(3) (2003)
Sonnleitner, M.: Ein neues Lösungsarchiv für das Generalized Minimum Spanning Tree-Problem. Master’s thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms (September 2010)
Wolf, M.: Ein Lösungsarchiv-unterstützter evolutionärer Algorithmus für das Generalized Minimum Spanning Tree-Problem. Master’s thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms (July 2009)
Yuen, S.Y., Chow, C.K.: A non-revisiting genetic algorithm. In: IEEE Congress on Evolutionary Computation (CEC 2007), pp. 4583–4590. IEEE Press, Los Alamitos (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hu, B., Raidl, G.R. (2012). An Evolutionary Algorithm with Solution Archive for the Generalized Minimum Spanning Tree Problem. In: Moreno-Díaz, R., Pichler, F., Quesada-Arencibia, A. (eds) Computer Aided Systems Theory – EUROCAST 2011. EUROCAST 2011. Lecture Notes in Computer Science, vol 6927. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27549-4_37
Download citation
DOI: https://doi.org/10.1007/978-3-642-27549-4_37
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-27548-7
Online ISBN: 978-3-642-27549-4
eBook Packages: Computer ScienceComputer Science (R0)