Bank Branch Network Optimization Based on Customers Geospatial Profiles

Oleg Zaikin, Anton Petukhov, Klavdiya Bochenina

Abstract: In this study, the bank branch network optimization problem is considered. The problem consists in choosing several branches for closure based on the overall expected level of dissatisfaction of bank customers with the location of remaining branches. This problem is considered as a black-box optimization problem. We propose a new algorithm for determining dissatisfaction of customers, based on their geospatial profiles. Namely, the following geospatial metrics are used for this purpose: Loyalty and Diversity. Also, a method for comparison of algorithms aimed at solving the mentioned problem is proposed. In this method, data on really dissatisfied customers is employed. Using the method, the proposed algorithm was compared with its competitor on a data set from one of the largest regional banks in Russia. It turned out, that the new algorithm usually shows better accuracy.