Comparison of Integer Linear Programming and Dynamic Programming Approaches for ATM Cash Replenishment Optimization Problem

---

Tezin Türü: Yüksek Lisans

Tezin Yürütüldüğü Kurum: Orta Doğu Teknik Üniversitesi, Fen Bilimleri Enstitüsü, Türkiye

Tezin Onay Tarihi: 2019

Tezin Dili: İngilizce

Öğrenci: FAZİLET ÖZER

Asıl Danışman (Eş Danışmanlı Tezler İçin): İsmail Hakkı Toroslu

Eş Danışman: Pınar Karagöz

Özet:

In Automated Telling Machine (ATM) cash replenishment problem, banks aim to re-duce the number of out-of-cash ATMs and duration of out-of-cash status. On theother hand, they want to reduce the cost of cash replenishment, as well. The problemconventionally involves forecasting ATM cash withdrawals, and then cash replenish-ment optimization on the basis of the forecast. We assume that reliable forecasts arealready obtained for the amount of cash needed in ATMs. The focus of the thesisis cash replenishment optimization. After introducing Linear Programming basedsolutions, we propose a solution based on dynamic programming. Experiments con-ducted on real data reveal that the proposed approach can find the optimal solutionmore efficiently than linear programming.