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] A new approximation algorithm for the k-facility location problem
    Zhang, Peng
    THEORETICAL COMPUTER SCIENCE, 2007, 384 (01) : 126 - 135
  • [42] An Approximation Algorithm for the Dynamic Facility Location Problem with Submodular Penalties
    Jiang, Chun-yan
    Li, Gai-di
    Wang, Zhen
    ACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES, 2014, 30 (01): : 187 - 192
  • [43] An approximation algorithm for the dynamic facility location problem with submodular penalties
    Chun-yan Jiang
    Gai-di Li
    Zhen Wang
    Acta Mathematicae Applicatae Sinica, English Series, 2014, 30 : 187 - 192
  • [44] A primal-dual 3-approximation algorithm for the stochastic facility location problem with submodular penalties
    Xu, Dachuan
    Gao, Dongxiao
    Wu, Chenchen
    OPTIMIZATION, 2015, 64 (03) : 617 - 626
  • [45] An Approximation Algorithm for the Risk-Adjusted Two-Stage Stochastic Facility Location Problem with Penalties
    Shao J.
    Xu D.
    Journal of the Operations Research Society of China, 2013, 1 (3) : 339 - 346
  • [46] Multi-level facility location as the maximization of a submodular set function
    Ortiz-Astorquiza, Camilo
    Contreras, Ivan
    Laporte, Gilbert
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2015, 247 (03) : 1013 - 1016
  • [47] Approximation algorithms for k-level stochastic facility location problems
    Melo, Lucas P.
    Miyazawa, Flavio K.
    Pedrosa, Lehilton L. C.
    Schouery, Rafael C. S.
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2017, 34 (01) : 266 - 278
  • [48] Approximation algorithms for k-level stochastic facility location problems
    Lucas P. Melo
    Flávio K. Miyazawa
    Lehilton L. C. Pedrosa
    Rafael C. S. Schouery
    Journal of Combinatorial Optimization, 2017, 34 : 266 - 278
  • [49] Approximation algorithm for the k- product uncapacitated facility location problem
    Yi, Bin
    Li, Rongheng
    PROCEEDINGS OF 2010 3RD IEEE INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND INFORMATION TECHNOLOGY (ICCSIT 2010), VOL 5, 2010, : 602 - 605
  • [50] Improved approximation algorithm for universal facility location problem with linear penalties
    Xu, Yicheng
    Xu, Dachuan
    Du, Donglei
    Wu, Chenchen
    THEORETICAL COMPUTER SCIENCE, 2019, 774 (143-151) : 143 - 151