An optimisation-simulation framework for integrated inventory and cash replenishment problem of automated teller machines in India

Ankush Kamthane, Prashant Singh and Ajinkya N. Tanksale

International Journal of Operational Research, 2024, vol. 49, issue 1, 19-46

Abstract: This work is motivated by the problem of managing inventory and the optimal replenishment schedule for a network of automated teller machines (ATMs) in India. The objective is to minimise the occurrences of shortages at the ATMs and in turn to achieve a higher service levels while minimising the cost of holding inventory and replenishment of ATMs. The problem is casted as a rich variant of inventory routing problem with several practical restrictions such as maximum inventory at the ATMs. A two-phase iterative decomposition heuristic is proposed to efficiently solve the practical size problem instance. The computational experiments based on synthetic data are conducted to assess the efficiency and effectiveness of the proposed solution approach and a case of Varanasi city in India is presented for the analysis. The results show the effectiveness of our proposed approach over the conventional replenishment policies.

Keywords: automated teller machine; ATM; inventory routing problem; IRP; mixed-integer programming; heuristic; simulation. (search for similar items in EconPapers)
Date: 2024
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=136004 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijores:v:49:y:2024:i:1:p:19-46

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().