TY - JOUR
T1 - A model with a solution algorithm for the cash transportation vehicle routing and scheduling problem
AU - Yan, Shangyao
AU - Wang, Sin Siang
AU - Wu, Ming Wei
N1 - Funding Information:
This research was supported by a Grant (NSC-96-2628-E-008-057-MY2) from the National Science Council of Taiwan. We thank the unnamed security carrier for providing the test data and their valuable opinions. We would also like to thank the two anonymous referees for their helpful comments and suggestions on the presentation of the paper.
PY - 2012/9
Y1 - 2012/9
N2 - Cash transportation vehicle routing and scheduling are essential for security carriers to minimize their operating costs and ensure safe cash conveyance. In real operations, to increase cash conveyance safety, there must be significant variation in daily cash transportation vehicle routes and schedules, making such vehicle routes and schedules difficult to formulate. However, for convenient planning purposes, security carriers normally plan such routes and schedules based on personal experience, without considering variations in routes and schedules from a system perspective. As a result, the obtained routes and schedules are neither safe nor efficient for transporting cash. In this study, a model is developed where the time-space network technique is utilized to formulate the potential movements of cash transportation vehicles among all demand points in the dimensions of time and space. This model incorporates a new concept of similarity of time and space for routing and scheduling, which is expected to help security carriers formulate more flexible routing and scheduling strategies. This is helpful to reduce the risk of robbery. Mathematically, the model is formulated as an integer multiple-commodity network flow problem. A solution algorithm, based on a problem decomposition/collapsing technique, coupled with the use of a mathematical programming software, is developed to efficiently solve the problem. The case study results show that our model and solution algorithm could be useful references for security carriers in actual practice.
AB - Cash transportation vehicle routing and scheduling are essential for security carriers to minimize their operating costs and ensure safe cash conveyance. In real operations, to increase cash conveyance safety, there must be significant variation in daily cash transportation vehicle routes and schedules, making such vehicle routes and schedules difficult to formulate. However, for convenient planning purposes, security carriers normally plan such routes and schedules based on personal experience, without considering variations in routes and schedules from a system perspective. As a result, the obtained routes and schedules are neither safe nor efficient for transporting cash. In this study, a model is developed where the time-space network technique is utilized to formulate the potential movements of cash transportation vehicles among all demand points in the dimensions of time and space. This model incorporates a new concept of similarity of time and space for routing and scheduling, which is expected to help security carriers formulate more flexible routing and scheduling strategies. This is helpful to reduce the risk of robbery. Mathematically, the model is formulated as an integer multiple-commodity network flow problem. A solution algorithm, based on a problem decomposition/collapsing technique, coupled with the use of a mathematical programming software, is developed to efficiently solve the problem. The case study results show that our model and solution algorithm could be useful references for security carriers in actual practice.
KW - Cash transportation
KW - Multiple-commodity network flow problem
KW - Similarity of time and space
KW - Time-space network
KW - Vehicle routing and scheduling
UR - http://www.scopus.com/inward/record.url?scp=84861140204&partnerID=8YFLogxK
U2 - 10.1016/j.cie.2012.04.004
DO - 10.1016/j.cie.2012.04.004
M3 - 期刊論文
AN - SCOPUS:84861140204
SN - 0360-8352
VL - 63
SP - 464
EP - 473
JO - Computers and Industrial Engineering
JF - Computers and Industrial Engineering
IS - 2
ER -