Mission-Oriented Ant-Team ACO for Min-Max MTSP
博士 === 大同大學 === 資訊工程學系(所) === 107 === The multiple traveling salesman problem (mTSP) is a combinatorial optimization problem and is an extension of the famous Traveling Salesman Problem (TSP). Not only does the mTSP possess academic research value, but its application is extensive. For example, the...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2019
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/eph8dq |