Browse > Article

Evolutionary Algorithm for solving Optimum Communication Spanning Tree Problem  

Soak Sang-Moon (광주과학기술원 기전공학과)
Chang Seok-Cheol (광주과학기술원 기전공학과)
Byun Sung-Cheal (광주과학기술원 기전공학과)
Ahn Byung-Ha (광주과학기술원 기전공학과)
Publication Information
Journal of KIISE:Software and Applications / v.32, no.4, 2005 , pp. 268-276 More about this Journal
Abstract
This paper deals with optimum communication spanning tree(OCST) problem. Generally, OCST problem is known as NP-hard problem and recently, it is reveled as MAX SNP hard by Papadimitriou and Yannakakis. Nevertheless, many researchers have used polynomial approximation algorithm for solving this problem. This paper uses evolutionary algorithm. Especially, when an evolutionary algorithm is applied to tree network problem such as the OCST problem, representation and genetic operator should be considered simultaneously because they affect greatly the performance of algorithm. So, we introduce a new representation method to improve the weakness of previous representation which is proposed for solving the degree constrained minimum spanning tree problem. And we also propose a new decoding method to generate a reliable tree using the proposed representation. And then, for finding a suitable genetic operator which works well on the proposed representation, we tested three kinds of genetic operators using the information of network or the genetic information of parents. Consequently, we could confirm that the proposed method gives better results than the previous methods.
Keywords
Optimum communication spanning tree problem; Evolutionary algorithm; Genetic algorithm;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 Rothlauf, F. Goldberg, D.E. and Heinzl, A., 'Network Random Keys - A Tree Network Representation Scheme for Genetic and Evolutionary Algorithms,' Evolutionary Computation, Vol.10 (1), pp. 75-97, 2002   DOI   ScienceOn
2 Wu, B.Y. Chao, K.M. and Tang, C.Y., 'A Polynomial Time Approximation Scheme for Optimal Product-Requirement Communication Spanning Trees,' Journal of Algorithms, Vol.36, pp. 182-204, 2000   DOI   ScienceOn
3 Gaube, T. and Rothlauf, F. 'The Link and Node Biased Encoding Revisited: Bias and Adjustment of Parameters,' EvoWorkshop 2001, LNCS Vol. 2037, pp.1-10, 2001   DOI
4 Soak, S.M. Crone, D. and Ahn, B.H., 'A New Encoding for the Degree Constrained Minimum Spanning Tree Problem.' KES2004, LNAI Vol. 3213, pp. 952-958. 2004   DOI
5 Peleg, D. and Reshcf, E., 'Deterministic Polylog Approximation for Minimum Communication Spanning Trees,' ICALP'98, LNCS Vol.1443, pp. 670-681, 1998
6 Wu, B.Y. Chao, K.M. and Tang, C.Y., 'Approximation algorithms for Some Optimum Communication Spanning Tree Problem,' ISAAC'98, LNCS Vol.1533, pp. 407-416, 1998
7 Papadimitriou, C. H and Yannakakis, M., 'Optimization, approximation, and complexity classes, Journal of Computer and System Science,' Vol.43, pp. 425-440, 1991   DOI   ScienceOn
8 Arora, S. Lund, C. Motwani, R. Sundan, M. and Szegedy, M., 'ProofVarification and the Hardness of Approximation Problems,' Colloquium on Computational Complexity Report TR98-008, University of Trier
9 Hu, T.C., 'Optimum communication spanning trees,' SLAM J. Computing, Vol.3, No.3, pp. 188-195, 1974   DOI
10 Garey, M.R. and Johnson, D.S., 'Computers and Intractability: A Guide to the Theory of NPCompleteness,' San Francisco, Freeman, 1979
11 석상문, 안병하, '차수 제약 걸침 나무 문제를 해결하기 위한 트리 표현법',한국정보과학회 추계 학술 대회, 2003   과학기술학회마을
12 Yu Li, 'An Effective Implementation of a Direct Spanning Tree Representation in GAs,' Evoworkshop 2001, LNCS Vol.2037, pp. 11-19, 2001   DOI
13 Rothlauf, F. Gerstacker, J. and Heinzl, A.,'On the Optimal Communication Spanning Tree Problem,' Working Papers in Information Systems, University of Mannheim, 2003
14 Bean, J. C., 'Genetic algorithms and random keys for sequencing and optimization,' ORSA Journal on Computing, Vol.6, No.2, pp. 154-160, 1994   DOI   ScienceOn
15 Abuali, F.N. Wainwright, R.L. and Schoenefeld, D.A., 'Determinant Factorization: A New Encoding Scheme for Spanning Trees Applied to the Probabilistic Minimum Spanning Tree Problem,' in Proceedings of the Sixth International Conference on Genetic Algorithms. Larry J. Eshelman, Ed, pp. 470-477, 1995
16 Yu Li and Bouchebaba, Y., 'A New Genetic Algorithm for the Optimal Communication Spanning Tree Problem,' Proceedings of Artificial Evolution: Fifth European Conference, pp. 162-173, 1999
17 Gen, M. Cheng, R., Genetic Algorithms and Engineering Design, John Wiley & Sons, 1997