A weighted coding in a genetic algorithm for the degree-constrained minimum spanning tree problem

Proceedings of the ACM Symposium on Applied Computing

Volumn 1, Issue , 2000, Pages 440-445

  Raidl, Günther R ^a   Julstrom, Bryant A ^b  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

^b ST CLOUD STATE UNIVERSITY   (United States)

Author keywords

Degree constrained minimum spanning trees; Genetic algorithms; Weighted coding

Indexed keywords

CHROMOSOMES; PARALLEL ARCHITECTURES; REPAIR;

COMPETING ALGORITHMS; DECODING ALGORITHM; DEGREE CONSTRAINTS; DEGREE-CONSTRAINED MINIMUM SPANNING TREE; DEGREE-CONSTRAINED MINIMUM SPANNING TREE PROBLEMS; FUNDAMENTAL DESIGN; MINIMUM SPANNING TREES; WEIGHTED CODING;

GENETIC ALGORITHMS;

EID: 84897423628     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/335603.335888     Document Type: Conference Paper

References (32)

1. F. N. Abuali, D. A. Schoenefeld, and R. L. Wainwright. Designing telecommunications networks using genetic algorithms and probabilistic minimum spanning trees. In E. Deaton, D. Oppenheim, J. Urban, and H. Berghel, editors, Proceedings of the 1994 ACM Symposium on Applied Computing, pages 242-246, New York, 1994. ACM Press.
2. F. N. Abuali, R. L. Wainwright, and D. A. Schoenefeld. Determinant factorization: A new encoding scheme for spanning trees applied to the probabilistic minimum spanning tree problem. In L. J. Eshelman, editor, Proceedings of the Sixth International Conference on Genetic Algorithms, pages 470-477, San Mateo, CA, 1995. Morgan Kaufmann Publishers.
3. F. N. Abuali, R. L. Wainwright, and D. A. Schoenefeld. Solving the three-star tree isomorphism problem using genetic algorithms. In K. M. George, J. H. Carroll, E. Deaton, D. Oppenheim, and J. Hightower, editors, Proceedings of the 1995 ACM Symposium on Applied Computing, pages 337-343, New York, 1995. ACM Press.
4. B. Boldon, N. Deo, and N. Kumar. Minimum-weight degree-constrained spanning tree problem: Heuristics and implementation on an SIMD parallel machine. Technical Report CS-TR-95-02, Department of Computer Science, University of Central Florida, Orlando, FL, 1995.
5. J. Branke and M. Middendorf. Searching for shortest common supersequences by means of a heuristic-based genetic algorithm. In J. T. Alander, editor, Proceedings of the Second Nordic Workshop on Genetic Algorithms and their Applications, pages 105-113, University of Vaasa, Vaasa, Finland, 1996.
6. S. Brave and A. S. Wu, editors. Late Breaking Papers at the 1999 Genetic and Evolutionary Computation Conference, Orlando, FL, 1999.
7. A. Cayley. A theorem on trees. Quarterly Journal of Mathematics, 23:376-378, 1889.
8. B. Dengiz, F. Altiparmak, and A. E. Smith. Local search genetic algorithm for optimization of highly reliable communications networks. In T, Bäck, editor. Proceedings of the Seventh International Conference on Genetic Algorithms, pages 650-657, San Francisco, CA, 1997. Morgan Kaufmann Publishers.
9. A. E. Eiben and J. K. van der Hauw. Solving 3-SAT by GAs adapting constraint weights. In Proceedings of 1997 IEEE International Conference on Evolutionary Computation, pages 81-86, Indianapolis, IN, 1997. IEEE Press.
10. S. Even. Algorithmic Combinatorics. The Macmillan Company, New York, 1973.
11. S. Fekete, S. Khuller, M. Klemmstein, B. Raghavachari, and N. Young. A network-flow technique for finding low-weight bounded-degree spanning trees. Journal of Algorithms, 24:310-324, 1997. (Pubitemid 127451222)
12. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York, 1979.
13. M. L. Gargano, W. Edelson, and O. Koval. A genetic algorithm with feasible search space for minimal spanning trees with time-dependent edge costs. In Koza et al. [19], page 495.
14. M. Gen, G. Zhou, and M. Takayama. A comparative study of tree encodings on spanning tree problems. In Proceedings of the 1998 IEEE International Conference on Evolutionary Computation Proceedings, pages 33-38, Anchorage, AL, 1998. IEEE Press.
15. B. A. Julstrom. Representing rectilinear Steiner trees in genetic algorithms. In K. M. George, J. H. Carroll, D. Oppenheim, and J. Hightower, editors, Proceedings of the 1996 ACM Symposium on Applied Computing, pages 245-250, New York, 1996. ACM Press.
16. B. A. Julstrom. Insertion decoding algorithms and initial tours in a weight-coded GA for TSP. In Koza et al. [19], pages 528-534.
17. J. R. Kim and M. Gen. Genetic algorithm for solving bicriteria network topology design problem. In Porto [25], pages 2272-2279.
18. J. Knowles and D. Corne. A new evolutionary approach to the degree constrained minimum spanning tree problem. IEEE Transactions on Evolutionary Computation, to appear.
19. J. R. Koza, W. Banzhaf, K. Chellapilla, K. Deb, M. Dorigo, D. B. Fogel, H. Iba, and R. L. Riolo, editors. Genetic Programming 1998: Proceedings of the Third. Annual Conference, Madison, Wisconsin, 1998. Morgan Kaufmann.
20. J. B. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematics Society, 7(1):48-50, 1956.
21. C. Mouma and S. Suri. Transitions in geometric minimum spanning trees. Discrete and Computational Geometry, 8(3):265-293, 1992.
22. S. C. Narula and C. A. Ho. Degree-constrained minimum spanning trees. Computers and Operations Research, 7:239-249, 1980.
23. C. C. Palmer and A. Kershenbaum. Representing trees in genetic algorithms. In Proceedings of the First IEEE Conference on Evolutionary Computation, pages 379-384, Orlando, FL, 1994. IEEE Press.
24. C. H. Papadimitriou and U. V. Vazirani. On two geometric problems related to the traveling salesman problem. Journal of Algorithms, 5:231-246, 1984.
25. V. W. Porto, editor. Proceedings of the 1999 IEEE Congress on Evolutionary Computation, Piscataway, NJ, 1999. IEEE Press.
26. R. Prim. Shortest connection networks and some generalizations. Bell System Technical Journal, 36:1389-1401, 1957.
27. G. R. Raidl. A weight-coded genetic algorithm for the multiple container packing problem. In J. Carroll, H. Hiddad, D. Oppenheim, B. Bryant, and G. B. Lamont, editors, Proceedings of the 1999 ACM Symposium on Applied Computing, pages 291-296, New York, 1999. ACM Press.
28. G. R. Raidl. Weight-codings in a genetic algorithm for the multiconstraint knapsack problem. In Porto [25], pages 596-603.
29. G. R. Raidl and J. Gottlieb. On the importance of phenotypic duplicate elimination in decoder-based evolutionary algorithms. In Brave and Wu [6], pages 204-211.
30. F. Rothlauf and D. Goldberg. Tree network design with genetic algorithms - an investigation in the locality of the Pruefernumber encoding. In Brave and Wu [6], pages 238-243.
31. M. Savelsbergh and T. Volgenant. Edge exchanges in the degree-constrained minimum spanning tree problem. Computers and Operations Research, 12(4):341-348, 1985. (Pubitemid 15509360)
32. G. Zhou and M. Gen. Approach to degree-constrained minimum spanning tree problem using genetic algorithm. Engineering Dosing & Automation, 3(2):157-165, 1997.