A-034 Application of Genetic Recombination to Genetic Local Search in TSP
スポンサーリンク
概要
- 論文の詳細を見る
In this paper, an approach based upon Genetic Recombination is proposed, and applied to the TSP. The algorithm is composed of two SGAs which only consist of the basic genetic operators such as selection, crossover and mutation. One of the SGAs is named as the Global Genetic Algorithm (GGA), and encompasses the main tours where it is designed to search for the global optimal solutions. Another one is named as the Local Genetic Algorithm (LGA) and traverses over the sub tours to find the local optimal solutions. The LGA is combined to the GGA as an operator. The local optimal solutions are recombined to the main tours for improving the search quality. To investigate the features of the proposed algorithm, it is applied to a small double circles TSP, and some interesting results are presented in our experiments.
- FIT(電子情報通信学会・情報処理学会)推進委員会の論文
- 2005-08-22
著者
-
Iimura Ichiro
熊本県大
-
Peng Gang
Oita National College Of Technology
-
NAKAMURA Takeshi
Oita National College of Technology
-
NAKAYAMA Shigeru
鹿児島大
関連論文
- A-034 Application of Genetic Recombination to Genetic Local Search in TSP
- STUDY ON MULTIPLE HEURISTIC SEARCH IN GENETIC ALGORITHM(ABSTRACTS OF DOCTORAL THESIS)
- F-006 Case-Based Interior Coordination