A cash transportation vehicle routing problem with combinations of different cash denominations. (14th February 2019)

• Record Type: Journal Article
• Authors: Xu, Guoxun; Li, Yanfeng; Szeto, W. Y.; Li, Jun
• Is Part Of: International transactions in operational research. Volume 26:Number 6(2019)
• Page Start: 2179
• Page End: 2198
• Publication Date: 2019-02-14
• Subjects: vehicle routing problem -- cash transportation -- cash denominations -- risk management -- combined hybrid tabu search; Operations research -- Periodicals; 003
• DOI: 10.1111/itor.12640
• Languages: English
• ISSNs: 0969-6016

Abstract

Abstract: This paper investigates a new cash transportation problem, which is a variant of the capacitated vehicle routing problem. To better satisfy the demands of customers (e.g., banks, large retailers, shopping centers, automated teller machines, etc.), the combination of different cash denominations (i.e., $100, $50, $20, etc.) is considered. The robbery risk, which is measured by both the amount of cash being carried and the distance covered by the vehicle carrying the cash, is limited by a risk threshold. The problem is formulated as mixed‐integer linear programming to minimize the total cost, which consists of the total travel cost and the total penalties due to the unmet expected demand of customers. A combined hybrid tabu search metaheuristic is proposed to solve this problem. Tabu search is adopted for determining routing decisions while three methods, namely the exact method, the greedy method, and the mixed method, are proposed to be embedded within the tabu search to determine the denomination combination strategy. The numerical studies show that the proposed method makes a good tradeoff between the solution quality and the computation time. Experimental results also reveal the effects of the unit penalty and the risk threshold.