An Effective Implementation of a Direct Spanning Tree Representation in GAs
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.
KeywordsGenetic Algorithm Tree Representation Span Tree Problem Main Operation Adjacency List
Unable to display preview. Download preview PDF.
- 1.Crecenzi P., Kann V. A compendium of NP optimization problems. Available online at http://www.nada.kth.se/theory/compendium/, Aug. 1998
- 2.Goldberg D.E. Genetic algorithms in search, optimization and machine learning. Addison-Wesley (Reading, Mass).Google Scholar
- 3.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.Google Scholar
- 5.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.Google Scholar
- 7.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.Google Scholar
- 8.Gibbons A. Algorithmic graph theory. Cambridge University Press, New York.Google Scholar
- 9.Michalewicz Z. Genetic Algorithms + Data Structures = Evolutionnary Programs. Springer-Verlag, 3rd edition, 1996.Google Scholar