TGA: A new integrated approach to evolutionary algorithms

C. K. Ting, S. T. Li, C. Lee

研究成果: Paper

14 引文 斯高帕斯（Scopus）

摘要

Genetic Algorithm (GA) is a well-known heuristic optimization algorithm. However, it suffers from the serious problem of premature convergence, which is caused mainly by the population diversity decreasing in evolution. In this paper, we propose a novel algorithm, called TGA, which integrates the memory structure and search strategy of Tabu Search (TS) with GA. As such, the selection efficiency is improved and the population diversity is maintained by incorporating the regeneration operator. The traveling salesman problem is used as a benchmark to evaluate TGA and compare it with GA and TS. Experimental results show that TGA gets the better performance than GA and TS in terms of both convergence speed and solution quality.

原文English
頁面917-924
頁數8
出版狀態Published - 2001 一月 1
事件Congress on Evolutionary Computation 2001 - Seoul, Korea, Republic of
持續時間: 2001 五月 27 → 2001 五月 30

Other

OtherCongress on Evolutionary Computation 2001
國家Korea, Republic of
城市Seoul
期間01-05-27 → 01-05-30

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Engineering(all)

存取文件

指紋 深入研究「TGA: A new integrated approach to evolutionary algorithms」主題。共同形成了獨特的指紋。

    • 引用此

    Ting, C. K., Li, S. T., & Lee, C. (2001). TGA: A new integrated approach to evolutionary algorithms. 917-924. 論文發表於 Congress on Evolutionary Computation 2001, Seoul, Korea, Republic of.