TY - CHAP

T1 - Heuristic optimization for multi-depot vehicle routing problem in atm network model

AU - Platonova, Valeria

AU - Gubar, Elena

AU - Kukkonen, Saku

N1 - Funding Information: Acknowledgments We are really grateful to Svetlana Medvedeva for many helpful suggestions and constructive comments. The third author wants to acknowledge the support of the Academy of Finland. Publisher Copyright: © 2020, The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG. Copyright: Copyright 2020 Elsevier B.V., All rights reserved.

PY - 2020

Y1 - 2020

N2 - Encashment process in the ATM network is an essential part of the banks’ activities. Timely encashment process plays an important role in building a good reputation of the bank that helps attract new clients. Uninterrupted work of money collector teams and stable functioning of ATM network requires solving the following major problems: one of them is the optimal location of the ATMs, the bank and its encashment centers, while another is, minimization of servicing costs of ATM network. In a large city such as St.Petersburg, encashment process of ATM network is associated with a problem of long distances between ATMs and encashment centers. As a possible solution to this problem, Multi-Depot Location Routing Problem with Multi-Depot Vehicle Routing Problem has been combined to design optimal or almost optimal routes for money collector teams and define the optimal location of encashment centers. To design optimal or almost optimal routes for money collector teams and define the optimal location of encashment centers, Multi-Depot Location Routing Problem with Multi-Depot Vehicle Routing Problem have been combined as a possible solution. In this research, we apply two heuristic methods for designing routes of the money collector teams located in the several depots (encashment centers). These approaches have been tested using the existing geo-location data for depots and ATMs of a bank in St.Petersburg, Russia.

AB - Encashment process in the ATM network is an essential part of the banks’ activities. Timely encashment process plays an important role in building a good reputation of the bank that helps attract new clients. Uninterrupted work of money collector teams and stable functioning of ATM network requires solving the following major problems: one of them is the optimal location of the ATMs, the bank and its encashment centers, while another is, minimization of servicing costs of ATM network. In a large city such as St.Petersburg, encashment process of ATM network is associated with a problem of long distances between ATMs and encashment centers. As a possible solution to this problem, Multi-Depot Location Routing Problem with Multi-Depot Vehicle Routing Problem has been combined to design optimal or almost optimal routes for money collector teams and define the optimal location of encashment centers. To design optimal or almost optimal routes for money collector teams and define the optimal location of encashment centers, Multi-Depot Location Routing Problem with Multi-Depot Vehicle Routing Problem have been combined as a possible solution. In this research, we apply two heuristic methods for designing routes of the money collector teams located in the several depots (encashment centers). These approaches have been tested using the existing geo-location data for depots and ATMs of a bank in St.Petersburg, Russia.

KW - Encashment problem

KW - Evolutionary computation

KW - Heuristic optimization

KW - Location problem

KW - MDLRP

KW - MDVRP

UR - http://www.scopus.com/inward/record.url?scp=85095987732&partnerID=8YFLogxK

UR - https://www.mendeley.com/catalogue/8696ea04-6927-3533-8d3b-5226790a9e78/

U2 - 10.1007/978-3-030-56534-3_9

DO - 10.1007/978-3-030-56534-3_9

M3 - Chapter

AN - SCOPUS:85095987732

T3 - Annals of the International Society of Dynamic Games

SP - 201

EP - 228

BT - Annals of the International Society of Dynamic Games

PB - Birkhäuser Verlag AG

ER -