A comparison of selection schemes in genetic algorithm for the multiple traveling salesman problem
碩士 === 元智大學 === 資訊管理學系 === 96 === The multiple traveling salesman problem（mTSP）is more complex than the traveling salesman problem（TSP）but is more suitable to model real life situations. Moreover, The mTSP can be considered as a relaxation of the vehicle routing problem（VRP）. Hence, the mTSP itself...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2008
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/09673442792283111720 |
| Summary: | 碩士 === 元智大學 === 資訊管理學系 === 96 === The multiple traveling salesman problem（mTSP）is more complex than the traveling salesman problem（TSP）but is more suitable to model real life situations. Moreover, The mTSP can be considered as a relaxation of the vehicle routing problem（VRP）. Hence, the mTSP itself plays an important role in practical distribution and routing. Many studies use genetic algorithm（GA）to solve the mTSP and different selection schemes are used. At the moment, it is unknown which scheme is the best to solve the mTSP. This study will increase the complexity of the problem and attempt to identify the optimum scheme to prove its capability.
|
|---|