The Moving-Target Traveling Salesman Problem with Resupply
碩士 === 國立中正大學 === 應用數學研究所 === 95 === In the classical Traveling Salesman Problem (TSP), the targets to be visited are stationary. However, several practical scenarios give rise to TSP instances where the targets to be visited are themselves in motion. We introduce a time-dependent generalization of...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2006
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/29895811044133459299 |