An Eugenic Genetic Algorithm for the Traveling Salesman Problem

• 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

碩士 === 國立中興大學 === 應用數學系 === 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 problems in a large number of different disciplines.However, it has difficulty in finding the optimal solution on sometypes of problems especially when the solution space is large. Sowe propose the eugenic genetic algorithm which always searches forand retains the better solutions by eugenic strategy, which makesthe searching more effective and efficient. In this thesis, we apply the eugenic genetic algorithm for thetraveling salesman problems, which is an NP-hard problem. We alsopropose some new operators for TSP. The experiment results of fourtypes of TSP instances show that on method can obtain better solutions in comparison with other methods.