A Reliable Budget-Constrained FL/ND Problem with Unreliable Facilities

被引:0
|
作者
Davood Shishebori
Lawrence V. Snyder
Mohammad Saeed Jabalameli
机构
[1] Yazd University,Department of Industrial Engineering
[2] Lehigh University,Department of Industrial and Systems Engineering
[3] Iran University of Science and Technology,Department of Industrial Engineering
来源
关键词
Facility location; Network design; Reliability; Investment budget constraint; Mixed integer programming; Heuristic;
D O I
暂无
中图分类号
学科分类号
摘要
The combined facility location and network design problem is an important practical problem for locating public and private facilities. Moreover, incorporating aspects of reliability into the modeling of facility location problems is an effective way to hedge against disruptions in the system. In this paper, we consider a combined facility location/network design problem that considers system reliability. This problem has a number of applications, many of which fall into the category of service systems, such as regional planning and locating schools, health care service centers and airline networks. Our model also includes an investment budget constraint. We propose a mixed integer programming formulation to model this problem, as well as an efficient heuristic based on the problem’s LP relaxation. Numerical results demonstrate that the proposed heuristic significantly outperforms CPLEX in terms of solution speed, while still maintaining excellent solution quality. Our results also suggest a favorable tradeoff between the “nominal cost” (including fixed facility location costs and link construction costs, as well as transportation costs) and system reliability; that is, substantial improvements in reliability are often possible with only slight increases in the total cost of investment and transportation.
引用
收藏
页码:549 / 580
页数:31
相关论文
共 50 条
  • [1] A Reliable Budget-Constrained FL/ND Problem with Unreliable Facilities
    Shishebori, Davood
    Snyder, Lawrence V.
    Jabalameli, Mohammad Saeed
    NETWORKS & SPATIAL ECONOMICS, 2014, 14 (3-4): : 549 - 580
  • [2] Budget-constrained rail network electrification problem
    Patil, Priyadarshan N.
    Walthall, Rydell
    Boyles, Stephen D.
    arXiv, 2021,
  • [3] Budget-constrained search
    Manning, R
    Manning, JRA
    EUROPEAN ECONOMIC REVIEW, 1997, 41 (09) : 1817 - 1834
  • [4] An exact algorithm for the budget-constrained multiple knapsack problem
    You, Byungjun
    Yamada, Takeo
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 2011, 88 (16) : 3380 - 3393
  • [5] Robustness Analysis of Budget-Constrained Route Flow Observability Problem
    Yuan, Jian
    Li, Lin
    Ma, Wanjing
    CICTP 2021: ADVANCED TRANSPORTATION, ENHANCED CONNECTION, 2021, : 2494 - 2503
  • [6] Budget-constrained expenditure multipliers
    Guerra, Ana-Isabel
    Sancho, Ferran
    APPLIED ECONOMICS LETTERS, 2011, 18 (13-15) : 1259 - 1262
  • [7] On budget-constrained flow improvement
    Schwarz, S
    Krumke, SO
    INFORMATION PROCESSING LETTERS, 1998, 66 (06) : 291 - 297
  • [8] BUDGET-CONSTRAINED STOCHASTIC APPROXIMATION
    Shanbhag, Uday V.
    Blanchet, Jose H.
    2015 WINTER SIMULATION CONFERENCE (WSC), 2015, : 368 - 379
  • [9] A network simplex method for the budget-constrained minimum cost flow problem
    Holzhauser, Michael
    Krumke, Sven O.
    Thielen, Clemens
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2017, 259 (03) : 864 - 872
  • [10] Budget-Constrained Coalition Strategies with Discounting
    Bozzone, Lia
    Naumov, Pavel
    PROCEEDINGS OF THE THIRTIETH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, IJCAI 2021, 2021, : 1808 - 1814