Abstract
This paper presents an effective implementation based on predecessor vectors of a genetic algorithm using a direct tree representation. The main operations associated with crossovers and mutations can be achieved in O(d) time, where d is the length of a path. Our approach can avoid usual drawbacks of the fixed linear representations, and provide a framework facilitating the incorporation of problem-specific knowledge into initialization and operators for constrained minimum spanning tree problems.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Crecenzi P., Kann V. A compendium of NP optimization problems. Available online at http://www.nada.kth.se/theory/compendium/, Aug. 1998
Goldberg D.E. Genetic algorithms in search, optimization and machine learning. Addison-Wesley (Reading, Mass).
Raidl G.R. An Efficient Evolutionary Algorithm for the Degree-Constrained Minimum Spanning Tree Problem. Proc. of the 2000 IEEE Congress on Evolutionary Computation, San Diego, CA, pp. 104–111, July 2000.
Palmer C.C., Kershenbaum A. An approach to a problem in network design using genetic algorithms. Networks, vol. 26 (1995) 151–163.
Raidl G.R., Julstrom B.A. A Weighted Coding in a Genetic Algorithm for the Degree-Constrained Minimum Spanning Tree Problem. Proc. of the 15th ACM Symposium on Applied Computing, Como, Italy, pp. 440–445, March 2000.
Knowles J., Corne D. A new evolutionary approach to the degree constrained minimum spanning tree problem. IEEE Transactions on Evolutionary Computation, Volume 4number 2, pp. 125–134, July 2000.
Raidl G.R., Drexel C. A Predecessor Coding in an Evolutionary Algorithm for the Capacitated Minimum Spanning Tree Problem. Late-Breaking-Papers Proc. Of the 2000 Genetic and Evolutionary Computation Conference, Las Vegas, NV, pp. 309-316, July 2000. bibitemli Li Y., Bouchebaba Y. A new genetic algorithm for the optical communication spanning tree problem. Proc. of Artifical Evolution 99, LNCS 1829, pp. 162–173, Dunkerque, France, 1999.
Gibbons A. Algorithmic graph theory. Cambridge University Press, New York.
Michalewicz Z. Genetic Algorithms + Data Structures = Evolutionnary Programs. Springer-Verlag, 3rd edition, 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, Y. (2001). An Effective Implementation of a Direct Spanning Tree Representation in GAs. In: Boers, E.J.W. (eds) Applications of Evolutionary Computing. EvoWorkshops 2001. Lecture Notes in Computer Science, vol 2037. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45365-2_2
Download citation
DOI: https://doi.org/10.1007/3-540-45365-2_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41920-4
Online ISBN: 978-3-540-45365-9
eBook Packages: Springer Book Archive