Using Miners Genetic Algorithm to Solve Travelling Salesman Problems
碩士 === 國立臺灣科技大學 === 工業管理系 === 100 === This thesis modifies the structure of Genetic Algorithms (GA) to develop a new algorithm to solve the Traveling Salesman Problem (TSP). The new algorithm is called Miners Genetic Algorithms (MGA). The MGA includes three phases as follows: (i) Mining, (ii) Explor...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2012
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/11066710453199853202 |