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 条
  • [1] An approximation algorithm for stochastic multi-level facility location problem with soft capacities
    Chenchen Wu
    Donglei Du
    Yue Kang
    Journal of Combinatorial Optimization, 2022, 44 : 1680 - 1692
  • [2] An Improved Approximation Algorithm for the k-Level Facility Location Problem with Soft Capacities
    Wu, Chen-chen
    Xu, Da-chuan
    ACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES, 2017, 33 (04): : 1015 - 1024
  • [3] An improved approximation algorithm for the k-level facility location problem with soft capacities
    Chen-chen Wu
    Da-chuan Xu
    Acta Mathematicae Applicatae Sinica, English Series, 2017, 33 : 1015 - 1024
  • [4] An Improved Approximation Algorithm for the k-Level Facility Location Problem with Soft Capacities
    Chen-chen WU
    Da-chuan XU
    ActaMathematicaeApplicataeSinica, 2017, 33 (04) : 1015 - 1024
  • [5] An approximation algorithm for the k-level stochastic facility location problem
    Wang, Zhen
    Du, Donglei
    Gabor, Adriana F.
    Xu, Dachuan
    OPERATIONS RESEARCH LETTERS, 2010, 38 (05) : 386 - 389
  • [6] AN EFFICIENT GENETIC ALGORITHM FOR SOLVING THE MULTI-LEVEL UNCAPACITATED FACILITY LOCATION PROBLEM
    Maric, Miroslav
    COMPUTING AND INFORMATICS, 2010, 29 (02) : 183 - 201
  • [7] A BRANCH-AND-BOUND ALGORITHM FOR THE MULTI-LEVEL UNCAPACITATED FACILITY LOCATION PROBLEM
    TCHA, DW
    LEE, BI
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1984, 18 (01) : 35 - 43
  • [8] A 3-approximation algorithm for the facility location problem with uniform capacities
    Aggarwal, Ankit
    Louis, Anand
    Bansal, Manisha
    Garg, Naveen
    Gupta, Neelima
    Gupta, Shubham
    Jain, Surabhi
    MATHEMATICAL PROGRAMMING, 2013, 141 (1-2) : 527 - 547
  • [9] A 3-approximation algorithm for the facility location problem with uniform capacities
    Ankit Aggarwal
    Anand Louis
    Manisha Bansal
    Naveen Garg
    Neelima Gupta
    Shubham Gupta
    Surabhi Jain
    Mathematical Programming, 2013, 141 : 527 - 547
  • [10] Approximation algorithm for squared metric facility location problem with nonuniform capacities
    Xu, Yicheng
    Xu, Dachuan
    Du, Donglei
    Zhang, Dongmei
    DISCRETE APPLIED MATHEMATICS, 2019, 264 (208-217) : 208 - 217