This thesis proposes an algorithm to enhance the convergence speed of genetic algorithm by modifying the function flow of a simple GA. Additional operators, such as asexual reproduction, competition, and livability, are added before the survival operation. After adding these three operators to the genetic algorithm, the convergence speed can be increased. Experiments indicate that simulations with the proposed algorithm have a 47% improvement in convergence speed on the traveling salesman problem. As for the graph coloring problem, the proposed algorithm also has a 10% improvement. Also, since these operators are additional parts to the original GA, the algorithm can be further improved by enhancing the operators, such as selection, crossover, and mutation.
| Identifer | oai:union.ndltd.org:NSYSU/oai:NSYSU:etd-0816107-122142 |
| Date | 16 August 2007 |
| Creators | Sie, Kun-Sian |
| Contributors | huan-Wen Chiang, Yau-Hwang Kuo, Chungnan Lee, Chung-Ho Chen, John Y. Chiang |
| Publisher | NSYSU |
| Source Sets | NSYSU Electronic Thesis and Dissertation Archive |
| Language | English |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0816107-122142 |
| Rights | withheld, Copyright information available at source archive |
Page generated in 0.0021 seconds