Show/Hide Menu
Hide/Show Apps
anonymousUser
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Açık Bilim Politikası
Açık Bilim Politikası
Frequently Asked Questions
Frequently Asked Questions
Browse
Browse
By Issue Date
By Issue Date
Authors
Authors
Titles
Titles
Subjects
Subjects
Communities & Collections
Communities & Collections
Comparison of integer linear programming and dynamic programming approaches for ATM cash replenishment optimization problem
Download
index.pdf
Date
2019
Author
Özer, FaziIle
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
8
views
6
downloads
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.
Subject Keywords
Computer engineering.
,
Keywords: Cash Replenishment Problem
,
Replenishment Schedule
,
Optimization
,
Dynamic Programming
,
Linear Programming
,
Loading Cost
,
Interest Cost
URI
http://etd.lib.metu.edu.tr/upload/12623574/index.pdf
https://hdl.handle.net/11511/43648
Collections
Graduate School of Natural and Applied Sciences, Thesis