Fast genetic algorithm based on pattern reduction

Shih Pang Tseng, Chun Wei Tsai, Ming Chao Chiang, Chu-Sing Yang

研究成果: Conference article同行評審

7 引文 斯高帕斯(Scopus)


This paper presents a simple but efficient algorithm for enhancing the performance of GA or GA-based algorithms while retaining the diversity of the search directions. The proposed algorithm is motivated by the observation that some of the genes common to all the individuals during the evolution process can be considered as part of the final solutions and thus can be removed to eliminate the redundant computations at the later generations of the evolution process. To evaluate the performance of the proposed algorithm, we use it to solve the traveling salesman problem (TSP). The benchmarks for the TSP problem range in size from 574 up to 2,152 cities. For the three problems evaluated, our experimental results indicate that the proposed algorithm can reduce the computation time from 28% up to about 84% compared to that of traditional GA and GA-based algorithms alone.

頁(從 - 到)214-219
期刊Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics
出版狀態Published - 2008 12月 1
事件2008 IEEE International Conference on Systems, Man and Cybernetics, SMC 2008 - Singapore, Singapore
持續時間: 2008 10月 122008 10月 15

All Science Journal Classification (ASJC) codes

  • 電氣與電子工程
  • 控制與系統工程
  • 人機介面


深入研究「Fast genetic algorithm based on pattern reduction」主題。共同形成了獨特的指紋。