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 条
  • [21] An approximation algorithm for the k-level stochastic facility location problem (vol 38, pg 386, 2010)
    Wang, Zhen
    Du, Donglei
    Gabor, Adriana F.
    Xu, Dachuan
    OPERATIONS RESEARCH LETTERS, 2011, 39 (02) : 160 - 161
  • [22] Approximation algorithm for dynamic facility location problem
    Li Zhang
    Qiaoliang Li
    Journal of Combinatorial Optimization, 2025, 49 (3)
  • [23] Approximation algorithms for the stochastic priority facility location problem
    Li, Gaidi
    Wang, Zhen
    Wu, Chenchen
    OPTIMIZATION, 2013, 62 (07) : 919 - 928
  • [24] AN APPROXIMATION ALGORITHM FOR THE k-LEVEL FACILITY LOCATION PROBLEM WITH SUBMODULAR PENALTIES
    Li, Gaidi
    Wang, Zhen
    Xu, Dachuan
    JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, 2012, 8 (03) : 521 - 529
  • [25] Approximation algorithm for squared metric two-stage stochastic facility location problem
    Jin Zhang
    Min Li
    Yishui Wang
    Chenchen Wu
    Dachuan Xu
    Journal of Combinatorial Optimization, 2019, 38 : 618 - 634
  • [26] Approximation algorithm for squared metric two-stage stochastic facility location problem
    Zhang, Jin
    Li, Min
    Wang, Yishui
    Wu, Chenchen
    Xu, Dachuan
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2019, 38 (02) : 618 - 634
  • [27] Approximation algorithm for uniform bounded facility location problem
    Weng Kerui
    Journal of Combinatorial Optimization, 2013, 26 : 284 - 291
  • [28] 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
  • [29] 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
  • [30] Approximation algorithm for uniform bounded facility location problem
    Weng Kerui
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2013, 26 (02) : 284 - 291