Heuristic Optimization for Multi-Depot Vehicle Routing Problem in ATM Network Model

Abstract

AbstractEncashment 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.KeywordsMDVRPMDLRPEncashment problemLocation problemHeuristic optimizationEvolutionary computation