考慮護運風險下保全運鈔車路線與排程模式暨演算法之研究

A MODEL WITH AN ALGORITHM FOR CASH TRANSPORTATION VEHICLE ROUTING AND SCHEDULING PROBLEMS CONSIDERING CONVEYANCE RISKS

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

This research utilizes the time-space network flow technique to describe the potential movements of cash transportation vehicles among all demand points in the time and space dimensions and develops a cash transportation vehicle routing and scheduling model which minimizes both operating cost and risk cost in order to help security carriers plan efficient and safe cash conveyance routes and schedules. The Analytical Hierarchy Process method is employed to determine the weights of a set of risk factors identified by cash transportation experts. The risk cost of cash transportation, which is computed based on the weights and the estimates of those risk factors, is then incorporated into the proposed model. Because the model can be formulated as a multi-commodity network flow problem, which is characterized as NP-hard, this study develops a heuristic to efficiently solve the model. The model and algorithm are solved and analyzed using a problem instance generated from operational data provided by a domestic security carrier. We also compare our model results with the results of a model presented in the literature. The case study results demonstrate that our model with a solution algorithm outperforms the previous model and could be a useful reference for security carriers in actual practice.