TGA: A new integrated approach to evolutionary algorithms

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

Research output: Contribution to conferencePaper

14 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages917-924
Number of pages8
Publication statusPublished - 2001 Jan 1
EventCongress on Evolutionary Computation 2001 - Seoul, Korea, Republic of
Duration: 2001 May 272001 May 30

Other

OtherCongress on Evolutionary Computation 2001
CountryKorea, Republic of
CitySeoul
Period01-05-2701-05-30

Fingerprint

Evolutionary algorithms
Tabu search
Genetic algorithms
Traveling salesman problem
Mathematical operators
Data storage equipment

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Engineering(all)

Cite this

Ting, C. K., Li, S. T., & Lee, C. (2001). TGA: A new integrated approach to evolutionary algorithms. 917-924. Paper presented at Congress on Evolutionary Computation 2001, Seoul, Korea, Republic of.
Ting, C. K. ; Li, S. T. ; Lee, C. / TGA : A new integrated approach to evolutionary algorithms. Paper presented at Congress on Evolutionary Computation 2001, Seoul, Korea, Republic of.8 p.
@conference{efe26da4b68d427788902960a70e5b00,
title = "TGA: A new integrated approach to evolutionary algorithms",
abstract = "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.",
author = "Ting, {C. K.} and Li, {S. T.} and C. Lee",
year = "2001",
month = "1",
day = "1",
language = "English",
pages = "917--924",
note = "Congress on Evolutionary Computation 2001 ; Conference date: 27-05-2001 Through 30-05-2001",

}

Ting, CK, Li, ST & Lee, C 2001, 'TGA: A new integrated approach to evolutionary algorithms', Paper presented at Congress on Evolutionary Computation 2001, Seoul, Korea, Republic of, 01-05-27 - 01-05-30 pp. 917-924.

TGA : A new integrated approach to evolutionary algorithms. / Ting, C. K.; Li, S. T.; Lee, C.

2001. 917-924 Paper presented at Congress on Evolutionary Computation 2001, Seoul, Korea, Republic of.

Research output: Contribution to conferencePaper

TY - CONF

T1 - TGA

T2 - A new integrated approach to evolutionary algorithms

AU - Ting, C. K.

AU - Li, S. T.

AU - Lee, C.

PY - 2001/1/1

Y1 - 2001/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0034874136&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0034874136&partnerID=8YFLogxK

M3 - Paper

AN - SCOPUS:0034874136

SP - 917

EP - 924

ER -

Ting CK, Li ST, Lee C. TGA: A new integrated approach to evolutionary algorithms. 2001. Paper presented at Congress on Evolutionary Computation 2001, Seoul, Korea, Republic of.