A tabu search algorithm for a multi-period bank branch location problem: A case study in a Turkish bank

Message:
Article Type:
Research/Original Article (دارای رتبه معتبر)
Abstract:
Banks need to open new branches in new sites as a result of increase in the population, individual earnings and the growth in national economy. In this respect, opening new branches or reorganizing the locations of current branches is an important decision problem for banks to accomplish their strategic objectives. This paper presents a decision support method for multi-period bank branch location problems. Our aim is to find bank branch location based on transaction volume, distance between branches, and cost of opening and closing branches. The proposed method not only develops an Integer Program and a Tabu Search algorithm to find the exact places of branches but also presents a structuring method to identify the related criteria and their importance. We demonstrate the effectiveness of the method on random data. In the final stage, the method is applied in a Turkish bank’s branch location problem considering the current and possible places of the branches, availability of the data, and the bank’s strategies for a four-year strategic planning.
Language:
English
Published:
Pages:
3728 to 3746
https://magiran.com/p2069341  
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یک‌ساله به مبلغ 1,390,000ريال می‌توانید 70 عنوان مطلب دانلود کنید!
اشتراک سازمانی
به کتابخانه دانشگاه یا محل کار خود پیشنهاد کنید تا اشتراک سازمانی این پایگاه را برای دسترسی نامحدود همه کاربران به متن مطالب تهیه نمایند!
توجه!
  • حق عضویت دریافتی صرف حمایت از نشریات عضو و نگهداری، تکمیل و توسعه مگیران می‌شود.
  • پرداخت حق اشتراک و دانلود مقالات اجازه بازنشر آن در سایر رسانه‌های چاپی و دیجیتال را به کاربر نمی‌دهد.
In order to view content subscription is required

Personal subscription
Subscribe magiran.com for 70 € euros via PayPal and download 70 articles during a year.
Organization subscription
Please contact us to subscribe your university or library for unlimited access!