A hybrid nested partitions algorithm for banking facility location problems

Handle URI:
http://hdl.handle.net/10754/561489
Title:
A hybrid nested partitions algorithm for banking facility location problems
Authors:
Xia, Li; Yin, Wenjun; Dong, Jin; Wu, Teresa; Xie, Ming; Zhao, Yanjia
Abstract:
The facility location problem has been studied in many industries including banking network, chain stores, and wireless network. Maximal covering location problem (MCLP) is a general model for this type of problems. Motivated by a real-world banking facility optimization project, we propose an enhanced MCLP model which captures the important features of this practical problem, namely, varied costs and revenues, multitype facilities, and flexible coverage functions. To solve this practical problem, we apply an existing hybrid nested partitions algorithm to the large-scale situation. We further use heuristic-based extensions to generate feasible solutions more efficiently. In addition, the upper bound of this problem is introduced to study the quality of solutions. Numerical results demonstrate the effectiveness and efficiency of our approach. © 2010 IEEE.
KAUST Department:
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
Publisher:
Institute of Electrical and Electronics Engineers
Journal:
IEEE Transactions on Automation Science and Engineering
Issue Date:
Jul-2010
DOI:
10.1109/TASE.2010.2043430
Type:
Article
ISSN:
15455955
Appears in Collections:
Articles; Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division

Full metadata record

DC FieldValue Language
dc.contributor.authorXia, Lien
dc.contributor.authorYin, Wenjunen
dc.contributor.authorDong, Jinen
dc.contributor.authorWu, Teresaen
dc.contributor.authorXie, Mingen
dc.contributor.authorZhao, Yanjiaen
dc.date.accessioned2015-08-02T09:12:37Zen
dc.date.available2015-08-02T09:12:37Zen
dc.date.issued2010-07en
dc.identifier.issn15455955en
dc.identifier.doi10.1109/TASE.2010.2043430en
dc.identifier.urihttp://hdl.handle.net/10754/561489en
dc.description.abstractThe facility location problem has been studied in many industries including banking network, chain stores, and wireless network. Maximal covering location problem (MCLP) is a general model for this type of problems. Motivated by a real-world banking facility optimization project, we propose an enhanced MCLP model which captures the important features of this practical problem, namely, varied costs and revenues, multitype facilities, and flexible coverage functions. To solve this practical problem, we apply an existing hybrid nested partitions algorithm to the large-scale situation. We further use heuristic-based extensions to generate feasible solutions more efficiently. In addition, the upper bound of this problem is introduced to study the quality of solutions. Numerical results demonstrate the effectiveness and efficiency of our approach. © 2010 IEEE.en
dc.publisherInstitute of Electrical and Electronics Engineersen
dc.subjectBanking facilityen
dc.subjectmaximal covering location problemen
dc.subjectmixed integer programmingen
dc.subjectnested partitions algorithmen
dc.titleA hybrid nested partitions algorithm for banking facility location problemsen
dc.typeArticleen
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Divisionen
dc.identifier.journalIEEE Transactions on Automation Science and Engineeringen
dc.contributor.institutionIBM China Research Laboratory, Zhongguancun Software Park, Haidian District, Beijing 100193, Chinaen
dc.contributor.institutionDepartment of Industrial Engineering, Arizona State University, Tempe, AZ 85287-5906, United Statesen
dc.contributor.institutionCenter for Intelligent and Networked Systems, Department of Automation, Tsinghua University, Beijing 100084, Chinaen
kaust.authorXia, Lien
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.