An approximation algorithm for stochastic multi-level facility location problem with soft capacities

被引:2
|
作者
Wu, Chenchen [1 ]
Du, Donglei [2 ]
Kang, Yue [3 ]
机构
[1] Tianjin Univ Technol, Coll Sci, 391 Binshui West St, Tianjin, Peoples R China
[2] Univ New Brunswick, Fac Business Adm, Fredericton, NB E3B 5A3, Canada
[3] Beijing Univ Technol, Dept Operat Res & Sci Comp, Beijing 100124, Peoples R China
基金
加拿大自然科学与工程研究理事会; 芬兰科学院;
关键词
Multi-level facility location; Approximation algorithm; Uncertainty;
D O I
10.1007/s10878-020-00538-8
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Facility location problem is one of the most important problems in the combinatorial optimization. The multi-level facility location problem and the facility location with capacities are important variants for the classical facility location problem. In this work, we consider the multilevel facility location problem with soft capacities in the uncertain scenario. The uncertainty setting means the location process is stochastic. We consider a two-stage model. The soft-capacities setting means each facility has multiple capacities by paying multiple opening cost. The multi-level setting means the client needs to connect to a path. We propose a bifactor (1/alpha,6/(1-2 alpha))-approximation algorithm for the stochastic multi-level facility location problem (SMLFLP), where alpha is an element of(0,0.5) is a given constant. Then, we reduce the stochastic multi-level facility location problem with soft capacities to SMLFLP. The reduction implies a (1/alpha+6/(1-2 alpha)-approximation algorithm. The ratio is 14.9282 when setting alpha=0.183.
引用
收藏
页码:1680 / 1692
页数:13
相关论文
共 50 条
  • [41] An approximation algorithm for the dynamic facility location problem with outliers
    Jiang, Yanjun
    Xu, Dachuan
    Du, Donglei
    Zhang, Dongmei
    OPTIMIZATION LETTERS, 2019, 13 (03) : 561 - 571
  • [42] A new approximation algorithm for the multilevel facility location problem
    Gabor, Adriana F.
    van Ommeren, Jan-Kees C. W.
    DISCRETE APPLIED MATHEMATICS, 2010, 158 (05) : 453 - 460
  • [43] A 1.488 approximation algorithm for the uncapacitated facility location problem
    Li, Shi
    INFORMATION AND COMPUTATION, 2013, 222 : 45 - 58
  • [44] Approximation algorithm for uniform bounded facility location problem
    Weng Kerui
    Journal of Combinatorial Optimization, 2013, 26 : 284 - 291
  • [45] An approximation algorithm for the dynamic facility location problem with outliers
    Yanjun Jiang
    Dachuan Xu
    Donglei Du
    Dongmei Zhang
    Optimization Letters, 2019, 13 : 561 - 571
  • [46] A 1.488 Approximation Algorithm for the Uncapacitated Facility Location Problem
    Li, Shi
    AUTOMATA, LANGUAGES AND PROGRAMMING, ICALP, PT II, 2011, 6756 : 77 - 88
  • [47] Approximation algorithm for uniform bounded facility location problem
    Weng Kerui
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2013, 26 (02) : 284 - 291
  • [48] Improved Approximation Algorithm for k-level Uncapacitated Facility Location Problem (with Penalties)
    Byrka, Jaroslaw
    Li, Shanfei
    Rybicki, Bartosz
    THEORY OF COMPUTING SYSTEMS, 2016, 58 (01) : 19 - 44
  • [49] A 3-approximation algorithm for the k-level uncapacitated facility location problem
    Aardal, K
    Chudak, FA
    Shmoys, DB
    INFORMATION PROCESSING LETTERS, 1999, 72 (5-6) : 161 - 167
  • [50] A combinatorial approximation algorithm for k-level facility location problem with submodular penalties
    Li Zhang
    Jing Yuan
    Zhizhen Xu
    Qiaoliang Li
    Journal of Combinatorial Optimization, 2023, 46