Dynamic Programming Solution to ATM Cash Replenishment Optimization Problem,, Pattaya, Thailand, Oct. 4-5, 2018.

Date

2018-10-05

Author

Özer, Fazilet
Toroslu, İsmail Hakkı
Karagöz, Pınar
Yucel, Ferhat

Metadata

Show full item record

Item Usage Stats

43
views

0
downloads

URI

https://hdl.handle.net/11511/70657

Collections

Unclassified, Article

Suggestions

OpenMETU
Core

Dynamic Programming Solution to ATM Cash Replenishment Optimization Problem Karagöz, Pınar; Toroslu, İsmail Hakkı (2018-10-05) Automated Telling Machine (ATM) replenishment is a wellknown problem in banking industry. Banks aim to improve customer satisfaction by reducing the number of out-of-cash ATMs and duration of out-of-cash status. On the other hand, they want to reduce the cost of cash replenishment, also. The problem conventionally has two components: forecasting ATM cash withdrawals, and then cash replenishment optimization on the basis of the forecast. In this work, for the first component, it is assumed that reliable fore...
Dynamic programming solution for multiple query optimization problem Toroslu, İsmail Hakkı (2004-11-15)
Dynamic Programming with Ant Colony Optimization Metaheuristic for Optimization of Distributed Database Queries Dokeroglu, Tansel; Coşar, Ahmet (2011-09-28) In this paper, we introduce and evaluate a new query optimization algorithm based on Dynamic Programming (DP) and Ant Colony Optimization (ACO) metaheuristic for distributed database queries. DP algorithm is widely used for relational query optimization, however its memory, and time requirements are very large for the query optimization problem in a distributed database environment which is an NP-hard combinatorial problem. Our aim is to combine the power of DP with heuristic approaches so that we can have ...
Dynamic constraint satisfaction algorithm for online feature model reconfiguration Oğuztüzün, Mehmet Halit S.; Entekhabi, Sina (2019-07-01) Dynamically reconfigurable systems are able to respond to changes in their operational environments by reconfiguring themselves automatically. Dynamic software product lines are dynamically reconfigurable systems with an explicit variability model that guides the reconfiguration. In this work, feature models are used as the variability model. An emerging situation in the environment can lead to some relevant changes to the current configuration: some features must be activated, and some must be deactivated....
Dynamic programming algorithms for scheduling parallel machines with family setup times Webster, Scott; Azizoğlu, Meral (Elsevier BV, 2001-2) We address the problem of scheduling jobs with family setup times on identical parallel machines to minimize total weighted flowtime. We present two dynamic programming algorithms - a backward algorithm and a forward algorithm - and we identify characteristics of problems where each algorithm is best suited. We also derive two properties that improve the computational efficiency of the algorithms. Scope and purpose While most production schedulers must balance conflicting goals of high system efficiency and...

Citation Formats

F. Özer, İ. H. Toroslu, P. Karagöz, and F. Yucel, “Dynamic Programming Solution to ATM Cash Replenishment Optimization Problem,, Pattaya, Thailand, Oct. 4-5, 2018.,” 2018, Accessed: 00, 2021. [Online]. Available: https://hdl.handle.net/11511/70657.