- 期刊
ST Encoding: An Efficient Scheme for Encoding Trees in Genetic Algorithms
並列摘要
Graph optimization problems are usually difficult and time-consuming NP problems. Genetic algorithms have been proven to be an efficient technique for solving these problems. Well-designed chromosomes and appropriate operators are key factors that determine the performance of such genetic algorithms. This study proposes a novel scheme, sequence and topology encoding, for encoding trees and three associated operators. Experiments on different scales of minimum spanning tree problems are conducted to compare the performance of the proposed encoding scheme with that of the Prüfer number, which is the best encoding scheme so far. The results indicate that the proposed encoding scheme is an efficient scheme for encoding trees in genetic algorithms.
延伸閱讀
- 陳華、侯玉松（2006）。A study on Specific Primer Selection Algorithms Using Suffix Trees。Journal of Information Technology and Applications(資訊科技與應用期刊)，1(1)，25-30。https://doi.org/10.6302/JITA.200605_1(1).0004
- 張庭瑋（2013）。Efficient Approximation Algorithms for Solving Directed Steiner Tree Problem〔碩士論文，國立清華大學〕。華藝線上圖書館。https://www.airitilibrary.com/Article/Detail?DocID=U0016-2511201311371818
- 陳漢隆（2009）。A Study of Low-complexity Tree-Based Sequential Decoding of Error-Correcting Binary Arithmetic Codes〔碩士論文，國立暨南國際大學〕。華藝線上圖書館。https://www.airitilibrary.com/Article/Detail?DocID=U0020-0709200922080100
- 邱泰威（2008）。A Study of Tree-based Sequential MAP Decoding Schemes for Error-Correcting Binary Arithmetic Codes〔碩士論文，國立暨南國際大學〕。華藝線上圖書館。https://www.airitilibrary.com/Article/Detail?DocID=U0020-1009200816442400
- Yen, L. C. (2015). Efficient Algorithms for Two Gene Tree Correction Problems [master's thesis, National Tsing Hua University]. Airiti Library. https://www.airitilibrary.com/Article/Detail?DocID=U0016-0312201510303271