Author:
Zaferanieh Mehdi,Sadra Mahmood,Basirat Toktam
Abstract
Purpose
This paper aims to propose a bi-level mixed integer linear location-allocation problem. The upper-level objective function is dedicated to minimizing the total distances covered by customers to meet the p-selected facilities and the fixed cost values for establishing these facilities. While in the lower level, a customer preference function evaluates the priority of customers in selecting facilities.
Design/methodology/approach
The solution approach to the proposed model uses the Karush–Kuhn–Tucker (KKT) optimality conditions to the lower-level problem where a set of p-selected facilities are introduced as the selection of the upper-level decision maker. The bi-level model reduces to a single-level model with some added binary variables.
Findings
Sensitivity analysis of the proposed bi-level model concerning variations of such different parameters as customers’ preferences and the number of selected facilities have been provided, using some numerical examples. Also, locating a recreational facility in Mazandaran province, Iran, has been provided to evaluate the reliability of the proposed model and efficiency of the solution approach, as well.
Originality/value
To the best of the authors’ knowledge, this paper is original and its findings are not available elsewhere.
Reference55 articles.
1. On the two-level uncapacitated facility location problem;INFORMS Journal on Computing,1996
2. A bi-level capacitated p-median facility location problem with the most likely allocation solution;Transportation Research Part B: Methodological,2019
3. Promoting economic development with tourism in rural communities: destination image and motivation to return or recommend;Journal of Extension,2015
4. Metaheuristic approaches to facility location problems: a systematic review,2021
5. A bi-level multi objective programming approach to solve grey problems: an application to closed loop supply chain network;Journal of Modelling in Management,2021
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献