An Eugenic Genetic Algorithm for the Traveling Salesman Problem
碩士 === 國立中興大學 === 應用數學系 === 85 === Abstract The major goal of this thesis is to discuss how to improve thesearching power of the genetic algorithm. The traditional geneticalgorithms are robust search procedures and can be used to solve complex search pr...
Main Authors: | Yu, Jenq Jy, 于正之 |
---|---|
Other Authors: | Lin Yu Tseng |
Format: | Others |
Language: | zh-TW |
Published: |
1997
|
Online Access: | http://ndltd.ncl.edu.tw/handle/41044145477997594618 |
Similar Items
-
Genetic Algorithms and the Travelling Salesman Problem
by: Bryant, Kylie
Published: (2000) -
Using Genetic Algorithm to Improve the Travelling Salesman Problem
by: Yang,Chih-Kuang, et al.
Published: (2018) -
A Hybrid Genetic Algorithm for the Traveling Salesman Problem
by: Ming-Chih Hsieh, et al.
Published: (2008) -
distributed genetic algorithm apply to travel salesman problem
by: Chieh-Lung Lee, et al.
Published: (2004) -
An Error Greedy Genetic Algorithm for Traveling Salesman Problem
by: Yang,Shiang-Tai, et al.
Published: (1994)