A note on genetic algorithms for degree-constrained spanning tree problems

Networks

Volumn 30, Issue 2, 1997, Pages 91-95

  Zhou, Gengui ^a   Gen, Mitsuo ^a  

^a ASHIKAGA INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

Degree constraint; Genetic algorithms; Minimum spanning tree

Indexed keywords

EID: 0039054277     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0037(199709)30:2<91::AID-NET3>3.0.CO;2-F     Document Type: Article

References (19)

1. 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. Proceedings of the Sixth International Conference on Genetic Algorithms (L. J. Eshelman, Ed.). Morgan Kaufmann, San Francisco, CA (1995) 470-475.
2. T. Bäck, F. Hoffmeister, and H. Schwefel, A survey of evolution strategy. Proceedings of the Fourth International Conference on Genetic Algorithms (R. Belew and L. Booker, Eds.). Morgan Kaufmann, Los Altos, CA (1991) 2-9.
3. D. J. Bertsimas, The probabilistic minimum spanning tree problem. Networks 20 (1990) 245-275.
4. E. W. Dijkstra, A note on two problems in connection with graphs. Num. Math. 1 (1959) 269-271.
5. J. Dossey, A. Otto, L. Spence, and C. Eynden, Discrete Mathematics. Harper Collins. New York (1993).
6. D. Fogel, Evolution Computation: Toward a New Philosophy of Machine Intelligence. IEEE Press, Piscataway, NJ (1995).
7. M. Gen and R. Cheng, Genetic Algorithms and Engineering Design. Wiley, New York (1997).
8. J. H. Holland, Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor, MI (1975).
9. H. Ishii, H. Shiode, and T. Nishida, Stochastic spanning tree problem. Discr. Appl. Math. 3 (1981) 263-273.
10. J. B. Kruskal, Jr., On the shortest spanning subtree of a graph and the traveling salesman problem. Proc. ACM. 7 (1956) 48-50.
11. Z. Michalewicz, Genetic Algorithms + Data Structure = Evolution Program, 2nd ed. Springer Verlag, New York (1994).
12. S. C. Narula and C. A. Ho, Degree-constrained minimum spanning tree. Comput. Op. Res. 7 (1980) 239-249.
13. R. C. Prim, Shortest connection networks and some generalizations. Bell Syst. Tech. J. 36 (1957) 1389-1401.
14. H. Prüfer, Neuer beweis eines satzes über permutationen. Arch. Math. Phys. 27 (1918) 742-744.
15. M. Savelsbergh and T. Volgenant, Edge exchanges in the degree-constrained spanning tree problem. Comput. Op. Res. 12 (1985) 341-348.
16. M. Sollin, Le trace de canalisation. Programming, Games, and Transportation Networks (C. Berge and A. Ghouilla-Houri, Eds.). Wiley, New York (1965).
17. W. Xu, On the quadratic minimum spanning tree problem. Proceedings of 1995 Japan-China Joint International Workshops on Information Systems, Ashikaga, Japan (M. Gen and W. Xu, Eds.). (1995) 141-148.
18. G. Zhou and M. Gen, A new approach to the degree-constrained minimum spanning tree problem using genetic algorithm. Proceedings of 1996 IEEE International Conference on Systems, Man and Cybernetics. IEEE Press, Bejing, China (1996) 2683-2688.
19. G. Zhou and M. Gen, An effective genetic algorithm approach to the quadratic minimum spanning tree problem. Proceedings of the First Asia-Pacific Conference on Simulated Evolution and Learning, Taejon, Korea (J-H. Kim, X. Yao, and T. Furuhashi, Eds.). (1996) 395-402.