Abstract
ATMs are critical to the success of any financial institution. Consumers continue to list the location of ATMs as one of their most important criteria in choosing a financial institution, for that banks are willing investment more ATMs for the purposes of providing greater convenience and attracting more customers. But there must be some equilibrium number of ATMs in the market otherwise rivals will enter the market and take all non-served customers. In the competitive case, the bank with most ATMs which are optimally deployed by using strong strategies would win the competition and get all the customers. Based on Bank clients' base, this study has placed great emphasis on the ATM's Deployment Strategies in order to provide greater convenience to the customers, consequently, banks can attract more customers and increase its market share and profitability. Technically, three algorithms are designed and compared namely; Heuristic Approach, Rank-Based Genetic Algorithm using Convolution and Simulated Annealing using Convolution. Dual objective is set to achieve highest Percentage Coverage (PC) and less ATMs Number required for covering intended area of study. Three experiments are carried out to measure the performance of each Algorithm. The experimental results show that Rank Based Genetic Algorithm shows a significant improvement in PC over Heuristic Approach, recording minimum improvement of 2.2% and maximum improvement of 20.13%. And it shows that Simulated Annealing outperforms both Heuristic Approach by up to 26.32% and Genetic Algorithm using convolution by up to 2.288% in terms of Percentage Coverage value. Regarding the saving in number of ATMs, Simulated Annealing Algorithm saves up to 33 ATMs over Heuristic Approach and up to 6 ATMs over Genetic Algorithm using Convolution. Index Terms—Heuristic Approach using Convolution (HAC), Rank Based Genetic Algorithm using convolution (RGAC), Simulated Annealing using Convolution (SAC), Automated Teller Machines (ATMs).
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Machine Learning and Computing
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
