| Summary: | 碩士 === 元智大學 === 工業工程研究所 === 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 there are still some
precautionary measures , we analyze patrolling problem by
using the idea of TSP and the condition of a plant as well.
Using the mathematical model as a tool in obtaining the route
and time period of patrolling , we can reduce the cost of
manpower and assure that no accidents will occur .
Furthermore , we can also spend more time to patroll
accident-prone areas or places with higher risks for
danger. The M-Salesman Traveling Salesman Problem (M-TSP) is
applicable for more operators to do mmore effective plant
control . Moreover , one heuristic method is built as a model
for multi-operator patrol . By using a plant as an example ,
these models have been tested to prove their effectiveness and
accuracy during actual conditions.
|
|---|
