Presentation Information
[5H3-OS-18b-04]Cash-in-Transit Rebalancing Problem with Reuse of Collected Cash: Formulation and Heuristics
〇Ai Kondoh1, Hideaki Tamai1 (1. Oki Electric Industry Co., Ltd.)
Keywords:
optimization,Tabu Search,Cash-in-Transit
Cash-in-transit (CIT) is a service in which security companies use specialized vehicles to transport cash safely. This paper focuses on operations that load and collect cash to prevent cash-handling devices—such as ATMs and cash dispensers—from running out of cash or overflowing. In conventional operations, cash to be loaded must be prepared in advance at a CIT depot, and banknotes collected from devices must be brought back to the depot, which incurs substantial cash processing (counting and verification) costs at the depot. To address this issue, CIT rebalancing has been proposed, in which cash collected from devices is processed on board the CIT vehicle and reused to load other devices.
We formulate the CIT Rebalancing Problem (CIT-RP) as a multi-objective optimization problem that aims to minimize travel distance and cash processing costs, and we implement a tabu-search-based heuristic to solve practical-scale instances within a short computation time. Using numerical experiments with randomly generated device data, we show that, compared with the conventional approach, the proposed method can substantially reduce cash processing costs at the depot.
We formulate the CIT Rebalancing Problem (CIT-RP) as a multi-objective optimization problem that aims to minimize travel distance and cash processing costs, and we implement a tabu-search-based heuristic to solve practical-scale instances within a short computation time. Using numerical experiments with randomly generated device data, we show that, compared with the conventional approach, the proposed method can substantially reduce cash processing costs at the depot.