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: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
1997
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/41044145477997594618 |