Özet:
Cash related costs constitute a large portion of management cost of an Automated Teller Machine (ATM) network. Cash should be loaded to or taken from ATM devices in certain intervals in order to both meet customer satisfaction and to be able to generate additional revenue from excess cash through daily interest rates. Unlike classical ATMs, new generation ATMs have a single tape for cash withdrawal and deposit; this property imposes new restrictions on ATM cash management. Moreover, recycle ATMs are costly and hence their deployment should be planned carefully. In this thesis, our aim is to optimize the ATM networks in terms of cash related costs. We formulate an optimization problem as an integer linear program, which jointly decides on when to visit an ATM, how much amount of money to load to which ATM and which road should be followed for the distribution of cash to the ATMs. We also decide on which ATMs in the network should be replaced by a recycle ATM. We then propose a polynomial-time heuristic algorithm and compare it with the optimization formulation in terms of cash cost and the recycle ATM decision. We demonstrate through performance evaluation that our heuristic algorithm is suitable for practical implementation.
