Optimization of Encashment Routs in ATM Network

Authors

  • Elena Gubar Saint Petersburg State University
  • Maria Zubareva Saint Petersburg State University

Abstract

The main purpose of this work is to optimize cash flow in case of the encashment process in the ATM network. The solution of these problems is based on some modified algorithms for the Vehicle Routing Problem with Time Windows. A numerical example is considered.

Keywords:

ATM network, route optimization, Vehicle Routing Problem with Time Windows

Downloads

Download data is not yet available.

References

Clarke, G., Wright, J.W. (1964). Scheduling of Vehicles from a Central Depot to a Number of Delivery Points, Operations Research, 12, 568–58.

Chiang, W.C., Russell, R.A. (1996). Simulated annealing metaheuristics for the vehicle routing problem with time windows. Annals of Operations Research., 63, 3–27.

Gubar, E., Zubareva, M., Merzljakova, J. (2011). Cash Flow Optimization in ATM Network Model. Contributions to Game Theory and Management. Vol. 4. Eds. Leon A. Petrosyan, Nikolay A. Zenkevich - SPB.: Graduate School of Management, SPbU.

Hall, R.W. (2003). Handbook of Transportation Science. Springer.

Solomon, M.M. (1987). Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations Research, 35(2), 254–265.

Hamdy A. Taha. (2003). Operations Research: an Introduction. University of Arkansas, Fayetteville: Pearson Education, Inc.

Toth, P.,Vigo, D. (2001). The vehicle routing problem. Society for Industrial and Applied Mathematics. Philadelphia, PA, USA.

Woch, M., Lebkowski, P. (2009). Sequential simulated annealing for the vehicle routing problem with time windows. Decision Making in Manufacturing and Services, 3(1-2), 87–100.

Downloads

Published

2023-01-25

How to Cite

Gubar, E., & Zubareva, M. (2023). Optimization of Encashment Routs in ATM Network. Contributions to Game Theory and Management, 5, 121–127. Retrieved from https://gametheory.spbu.ru/article/view/14310

Issue

Section

Articles