A model with a solution algorithm for the cash transportation vehicle routing and scheduling problem

NCUIR > Engineering College > Department of Civil Engineering > journal & Dissertation > Item 987654321/99708

Please use this identifier to cite or link to this item: https://ir.lib.ncu.edu.tw/handle/987654321/99708

Title:	A model with a solution algorithm for the cash transportation vehicle routing and scheduling problem
Authors:	顏上堯;Yan, Shangyao;Wang, Sin-Siang;Wu, Ming-Wei
Contributors:	工學院土木工程學系
Keywords:	Algorithms;Cash transportation;Mathematical programming;Multiple-commodity network flow problem;Network flow problem;Optimization algorithms;Routing;Scheduling;Similarity of time and space;Studies;Time–space network;Transportation industry;Vehicle routing and scheduling
Date:	2012-09-01
Issue Date:	2026-04-21 13:29:51 (UTC+8)
Publisher:	Elsevier Ltd.;New York: Elsevier Ltd
Abstract:	摘要： ► We develop a model to solve the cash transportation problem. ► A time–space network flow technique is adopted to create the model. ► A heuristic algorithm is developed to solve the model. 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. 出版者： New York: Elsevier Ltd 出版日期： 2012-09 出處： Computers & industrial engineering, 2012-09, Vol.63 (2), p.464-473 資源來源： Elsevier ScienceDirect Journals Complete 版權： 2012 Elsevier Ltd 版權： Copyright Pergamon Press Inc. Sep 2012 識別號： ISSN: 0360-8352 識別號： EISSN: 1879-0550 識別號： DOI: 10.1016/j.cie.2012.04.004 識別號： CODEN: CINDDL
Appears in Collections:	[Department of Civil Engineering] journal & Dissertation

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	12	View/Open

社群 sharing

Loading...