The Blob Code is competitive with edge-sets in genetic algorithms for the minimum routing cost spanning tree problem

GECCO 2005 - Genetic and Evolutionary Computation Conference

Volumn , Issue , 2005, Pages 585-590

  Julstrom, Bryant A ^a  

^a ST CLOUD STATE UNIVERSITY   (United States)

Author keywords

Blob Code; Codings; Edge sets; Routing cost; Spanning trees

Indexed keywords

COSTS; TREES (MATHEMATICS);

BLOB CODE; EDGE-SETS; ROUTING COST; SPANNING TREES;

EVOLUTIONARY ALGORITHMS;

EID: 32444434799     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1068009.1068108     Document Type: Conference Paper

References (24)

1. Alfred V. Aho, John E. Hopcroft, and Jeffrey D. Ullman. Data Structures and Algorithms. Addison-Wesley, Reading, MA, 1983.
2. J. E. Beasley. OR-library: Distributing test problems by electronic mail. Journal of the Operational Research Society, 41:1069-1072, 1990.
3. L. T. M. Berry, B. A. Murtagh, S. J. Sugden, and G. B. McMahon. Application of a genetic-based algorithm for optimal design of tree-structured communication networks. In Proceedings of the Regional International Teletraffic Conference, pages 361-369, Pretoria, South Africa, 1995.
4. A. Cayley. A theorem on trees. Quarterly Journal of Mathematics, 23:376-378, 1889.
5. Shimon Even. Algorithmic Combinatorics. The Macmillan Company, New York, 1973.
6. Matteo Fischetti, Giuseppe Lancia, and Paolo Serafini. Exact algorithms for minimum routing cost trees. Networks, 39(1):161-173, 2002.
7. Thomas Gaube and Franz Rothlauf. The link and node biased encoding revisited: Bias and adjustment of parameters. Technical Report 2001011, Illinois Genetic Algorithms Laboratory, University of Illinois at Urbana-Champaign, 2001.
8. Jens Gottlieb, Bryant A. Julstrom, Günther R. Raidl, and Franz Rothlauf. Prüfer numbers: A poor representation of spanning trees for evolutionary search. In L. Spector et al., editors, Proceedings of the Genetic and Evolutionary Computation Conference, GECCO-2001, pages 343-350, San Francisco, CA, 2001, Morgan Kaufmann. July 7-11, San Francisco, CA.
9. Gregory C. Harfst and Edward M. Reingold. A potential-based amortized analysis of the union-find data structure, SIGACT News, 31(3):86-95, 2000.
10. T. C. Hu. Optimum communication spanning trees. SIAM Journal on Computing, 3(3):188-195, 1974.
11. D. S. Johnson, J. K. Lenstra, and A. H. G. Ronooy Kan. The complexity of the network design problem. Networks, 8:279-285, 1978.
12. Bryant A. Julstrom. The Blob Code: A better string coding of spanning trees for evolutionary search. In Annie S. Wu, editor, 2001 Genetic and Evolutionary Computation Conference Workshop Program, pages 256-261, San Francisco, CA, 2001, July 7.
13. Bryant A. Julstrom, A genetic algorithm and two hill-climbers for the minimum routing cost spanning tree problem. In H. R. Arabnia and Youngsong Mun, editors, Proceedings of the International Conference on Artificial Intelligence, volume III, pages 934-940. CSREA Press, 2002.
14. Yu Li. An effective implementation of a direct spanning tree representation in GAs. In Egbert J. W. Boers et al., editors, Proceedings of EvoWorkshops 2001, pages 11-19, Berlin, 2001, Springer-Verlag.
15. Yu Li and Youcef Bouchebaba. A new genetic algorithm for the optimal communications spanning tree problem, In Cyril Fonlupt et al., editors, Artificial Evolution: 4th European Conference, number 1829 in Lecture Notes in Computer Science, pages 162-173, Berlin, 1999. Springer-Verlag.
16. Charles C. Palmer and Aaron Kershenbaum. Representing trees in genetic algorithms. In Proceedings of the First IEEE Conference on Evolutionary Computation, volume 1, pages 379-384, June 1994.
17. Sally Picciotto. How to encode a tree. PhD thesis, University of California, San Diego, 1999.
18. H. Prüfer, Neuer beweis eines Satzes über permutationen, Archives of Mathematical Physics, 27:142-144, 1918.
19. Günther R. Raidl and Bryant A. Julstrom. Edge-sets: An effective evolutionary coding of spanning trees. IEEE Transactions on Evolutionary Computation, 7(3):225-239, 2003.
20. Franz Rothlauf. Representations for Genetic and Evolutionary Algorithms, volume 104 of Studies in Fuzziness and Soft Computing. Physica-Verlag, Heidelberg, 2002.
21. Franz Rothlauf and David Goldberg. Tree network design with genetic algorithms - An investigation in the locality of the Pruefernumber encoding. In Scott Brave and Annie S. Wu, editors, Late Breaking Papers at the 1999 Genetic and Evolutionary Computation Conference, pages 238-243, 1999.
22. Franz Rothlauf, David E. Goldberg, and Armin Heinzl, Network random keys - a tree network representation scheme for genetic and evolutionary algorithms. Technical Report No. 8/2000, University of Bayreuth, Germany, 2000.
23. R. E. Tarjan. Efficiency of a good but not linear set union algorithm. Journal of the ACM, 22:215-225, 1975.
24. Bang Ye Wu, Guiseppe Lancia, Vineet Bafna, Kun-Mao Chao, R. Ravi, and Chuan Yi Tang. A polynomial time approximation scheme for minimum routing cost spanning trees. SIAM Journal on Computing, 29(3):761-768, 1999.