TY - JOUR
T1 - Enhanced capacitated facility location problem for mental accounting management using partial resource concentration
AU - Tang, Luohao
AU - Wu, Dexiang
N1 - Publisher Copyright:
© The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2023.
PY - 2024/4
Y1 - 2024/4
N2 - This paper studies a framework of Reliable Capacitated Facility Location Problem with Single source constraint, which allows us to capture the mental account management problem for a bank under uncertain environment. In the problem, each facility, corresponding to a financial product, has limited capacity and may fail randomly, which represents that the product fails to reach the threshold level of return. Each customer, corresponding to a mental account, is served by a single primary facility or product, and its demands, or the setting goals, can be split on several backup facilities or alternative investments with redundant capacity. With the operation, a portion of the satisfaction can still be met by the backup facilities when the primary service of a customer fails. We formulate a mixed integer programming model for the problem and design a Lagrangian relaxation based solution algorithm, which sophisticatedly exploits the structure of the model and transfers the complicated relaxation problems into 0–1 knapsack problems to reduce the complexity. A local search procedure is also incorporated into the algorithm to enhance the accuracy of small- and large-scale computation. Finally, a real-life case of mental accounting is investigated to illustrate the application of the decision model.
AB - This paper studies a framework of Reliable Capacitated Facility Location Problem with Single source constraint, which allows us to capture the mental account management problem for a bank under uncertain environment. In the problem, each facility, corresponding to a financial product, has limited capacity and may fail randomly, which represents that the product fails to reach the threshold level of return. Each customer, corresponding to a mental account, is served by a single primary facility or product, and its demands, or the setting goals, can be split on several backup facilities or alternative investments with redundant capacity. With the operation, a portion of the satisfaction can still be met by the backup facilities when the primary service of a customer fails. We formulate a mixed integer programming model for the problem and design a Lagrangian relaxation based solution algorithm, which sophisticatedly exploits the structure of the model and transfers the complicated relaxation problems into 0–1 knapsack problems to reduce the complexity. A local search procedure is also incorporated into the algorithm to enhance the accuracy of small- and large-scale computation. Finally, a real-life case of mental accounting is investigated to illustrate the application of the decision model.
KW - Capacitated facility location problem
KW - Lagrangian relaxation
KW - Local search
KW - Mental accounting
KW - Risk management
KW - Single source constraint
UR - https://www.scopus.com/pages/publications/85170042162
U2 - 10.1007/s10479-023-05572-3
DO - 10.1007/s10479-023-05572-3
M3 - 文章
AN - SCOPUS:85170042162
SN - 0254-5330
VL - 335
SP - 385
EP - 424
JO - Annals of Operations Research
JF - Annals of Operations Research
IS - 1
ER -