為協助保全業者規劃有效且安全的運鈔車路線與排程，本研究應用時 空網路流動技巧，描述運鈔車在需求點問之時空移動情形，以建立營運成 本與風險成本最小化之運鈔車路線與排程模式。研究中由具運鈔經驗的專 家協助建立風險因素層級架構，採用層級分析法決定各項風險因素權重， 再配合各項風險因素估計值，計算風險成本， 並將其反映在所建立的模式 中。由於此模式可定式為多元商品網路流動問題，屬NP-hard ，因此本研究 發展一段發式演算法以有效地求解模式。為評估模式及演算法之實用績效， 本研究根據國內一家保全公司的營運資料產生測試範例並進行求解與分析。此外，本研究亦將求解結果與文獻中所發展之運鈔車路線與排程模式結果比較，測試結果顯示本研究之模式優於過去文獻中之模式，應可為實務應用之參考。

This research utilizes the time－spαce network flow technique to describe the potentiαl movements of cash trαnsportαtion vehicles αmong αll dement points in the time αnd spαce dimensions αnd develops αcαsh trαnsportαtioη vehicle routing and scheduling model which minimizes both operating cost αnd risk cost in order to help securi。cαrriers plan efficient and safe cash conveyance routes αnd schedules. The Anα.Zytical Hierαrchy Process method is employed to determine the weights of α set of risk factors identified by cαsh trαnsportαtion esperts. The risk cost of cαsh transportαtion, which is computed bαsed on the weights and the estimαtes of those risk factors, is then incorporαted into the proposed model. Because the model cαn be formulαted as α multi-commodity network flow problem, which is charαcterized αs NP-hard, this study develops α heuristic to elfzciently solve the model‘ The model αnd αlgorithm are solved and αnalyzed using α problem instαnce gener，αted from operαtional d.αtα provided by α domestic security carrier. We also compαre our model results with the results of α model presented in the literature. The cαse study results demonstrαte thαt our model with α solution algorithm outperforms the previous model αnd could be α useful referencefor security cαrriers in αctual prαctice ..