Analysis of Automated Plant Patrol Problems
碩士 === 元智大學 === 工業工程研究所 === 81 === The Traveling Salesman Problem (TSP) is applicable in patrolling the automated plants , we can use the Integer Linear Programming (ILP) models to look upon the real condition of a plant . Since...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Online Access: | http://ndltd.ncl.edu.tw/handle/41935138044401337200 |