A bi-level capacitated P-median facility location problem with the most likely allocation solution

被引:22
作者
Abareshi, Maryam [1 ]
Zaferanieh, Mehdi [1 ]
机构
[1] Hakim Sabzevari Univ, Dept Appl Math, Sabzevar, Iran
关键词
Network; Facility location; Capacitated p-median problem; Bi-level programming; Information theory; ALGORITHM; MODEL; BRANCH;
D O I
10.1016/j.trb.2019.03.013
中图分类号
F [经济];
学科分类号
02 ;
摘要
In this paper, a bi-level model is introduced to evaluate the capacitated p-median facility location problem with the most likely allocation solution. The classical capacitated p-median problem is considered in the upper-level to minimize the cost of locating facilities and serving demands while a log-based model resulting from the minimum information approach is used in the lower-level to determine the most likely allocation solution based on the available information. Using Lagrangian dual theory, the proposed bi-level problem is reduced to a new one-level nonlinear mixed-integer problem whose solution is obtained by comparing two mixed-integer linear problems. Some numerical examples are provided to illustrate the added value of the proposed model. (C) 2019 Elsevier Ltd. All rights reserved.
引用
收藏
页码:1 / 20
页数:20
相关论文
共 44 条
[1]   Path Flow Estimator in an Entropy Model Using a Nonlinear L-Shaped Algorithm [J].
Abareshi, Maryam ;
Zaferanieh, Mehdi ;
Keramati, Bagher .
NETWORKS & SPATIAL ECONOMICS, 2017, 17 (01) :293-315
[2]  
Ahuja Ravindra K, 1993, Network Flows: Theory, Algorithms and Applications
[3]   A Bilevel p-median model for the planning and protection of critical facilities [J].
Aksen, Deniz ;
Aras, Necati ;
Piyade, Nuray .
JOURNAL OF HEURISTICS, 2013, 19 (02) :373-398
[4]  
[Anonymous], 1979, Computers and Intractablity: A Guide to the Theory of NP-Completeness
[5]   Combining the analytic hierarchy process and goal programming for global facility location-allocation problem [J].
Badri, MA .
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 1999, 62 (03) :237-248
[6]   INTEGER PROGRAMMING - METHODS, USES, COMPUTATION [J].
BALINSKI, ML .
MANAGEMENT SCIENCE, 1965, 12 (03) :253-313
[7]  
Bazaraa M.S., 1990, LINEAR PROGRAMMING N, DOI DOI 10.1002/0471787779
[8]   Solving the p-median problem with a semi-Lagrangian relaxation [J].
Beltran, C. ;
Tadonki, C. ;
Vial, J. -Ph. .
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2006, 35 (02) :239-260
[9]  
Bisschop J., 2006, AIMMS optimization modeling
[10]   A branch-and-price algorithm for the capacitated p-median problem [J].
Ceselli, A ;
Righini, G .
NETWORKS, 2005, 45 (03) :125-142