現金運送路線排程問題之研究;A Study on the cash transport routing/scheduling problem

NCU Institutional Repository > 工學院 > 土木工程學系 > 研究計畫 > Item 987654321/62226

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://ir.lib.ncu.edu.tw/handle/987654321/62226

题名:	現金運送路線排程問題之研究;A Study on the cash transport routing/scheduling problem
作者:	顏上堯
贡献者:	國立中央大學土木工程學系
关键词:	土木水利工程
日期:	2013-12-01
上传时间:	2014-03-17 11:20:27 (UTC+8)
出版者:	行政院國家科學委員會
摘要:	研究期間：10208~10307;The banks and ATMs (Automatic Teller Machines) in Taiwan have rapidly enlarged, increasing the risk of robbery during the period of transporting cash. Based on past records of robbery, the main reason of robbery is that the already planned vehicle routes/schedules are usually fixed, making it easy for the bad guys to track and target the vehicle. In practice, the personal experience of the decision maker is used to perform the cash pick-up and delivery vehicle routing/scheduling, which lacks a system optimization, often wasting resources and increasing risk of robbery. Besides, to simplify the complex routing/scheduling process, the carriers often use an average travel time for each trip to construct the vehicle routes/schedules, which neglects the stochastic travel times for trips that often occur in real operations. If stochastic travel times for trips occur during the period of transporting cash, then the already planned vehicle routines/schedules may be disturbed to lose their optimality. Therefore, we will consider the variations in vehicle routes/schedules and the arrival times at each demand point, under deterministic and stochastic travel times, to respectively develop a useful model with a solution algorithm, in order to help carriers reduce the risk of robbery. After a preliminary evaluation, this research is expectedly complicated, so we will propose it as a two-year project. In the first year, we will construct the cash pick-up and delivery vehicle routing/scheduling under deterministic travel times. In this model, to increase the conveyance safety, a new concept of similarity of time and space for vehicle routing/scheduling and a time-space network flow technique are employed to formulate the variant vehicle routing/scheduling problem. Since the model is expected to be an NP-hard problem and can not be optimally solved in a reasonable time for large-scale problems, a solution algorithm will be developed to efficiently solve the problem. In the second year, we will construct the cash pick-up and delivery vehicle routing/scheduling problem under stochastic travel times. To increase the safety during the period of transporting cash, we will also employ the concept of similarity of time and space for vehicle routing/scheduling and a time-space network flow technique to formulate the variant vehicle routing/scheduling problem. The model is also expected to be an NP-hard problem and a solution algorithm will be developed by modifying the solution algorithm developed in the first year to efficiently solve the problem. In addition, a method will be developed to evaluate the performance of the two models in simulated real operations. Finally, conclusions and suggestions will be drawn.
關聯:	財團法人國家實驗研究院科技政策研究與資訊中心
显示于类别:	[土木工程學系 ] 研究計畫

文件中的档案:

档案	描述	大小	格式	浏览次数
index.html		0Kb	HTML	356	检视/开启

在NCUIR中所有的数据项都受到原著作权保护.

社群 sharing

数据加载中.....