Applying Ant Colony Optimization in Solving the Traveling Salesman Problem with Time Windows
碩士 === 朝陽科技大學 === 工業工程與管理系碩士班 === 94 === The traveling salesman problem with time windows (TSPTW) is a problem of finding a minimum cost tour where all cities must be visited exactly once within their requesting time windows. This problem has important applications in practice such as scheduling and...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2006
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/755779 |