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 条
  • [11] Approximation Algorithm for the Squared Metric Soft Capacitated Facility Location Problem
    Han, Lu
    Xu, Dachuan
    Xu, Yicheng
    Zhang, Dongmei
    COMPUTATIONAL DATA AND SOCIAL NETWORKS, 2019, 11917 : 72 - 73
  • [12] An approximation algorithm for soft capacitated k-facility location problem
    Jiang, Yanjun
    Xu, Dachuan
    Du, Donglei
    Wu, Chenchen
    Zhang, Dongmei
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2018, 35 (02) : 493 - 511
  • [13] An approximation algorithm for soft capacitated k-facility location problem
    Yanjun Jiang
    Dachuan Xu
    Donglei Du
    Chenchen Wu
    Dongmei Zhang
    Journal of Combinatorial Optimization, 2018, 35 : 493 - 511
  • [14] Multi-level facility location problems
    Ortiz-Astorquiza, Camilo
    Contreras, Ivan
    Laporte, Gilbert
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2018, 267 (03) : 791 - 805
  • [15] An approximation algorithm for the k-level capacitated facility location problem
    Donglei Du
    Xing Wang
    Dachuan Xu
    Journal of Combinatorial Optimization, 2010, 20 : 361 - 368
  • [16] An approximation algorithm for the k-level facility location problem with outliers
    Lu Han
    Dachuan Xu
    Dandan Liu
    Chenchen Wu
    Optimization Letters, 2021, 15 : 2053 - 2065
  • [17] An Approximation Algorithm for the Dynamic k-level Facility Location Problem
    Wang, Limin
    Zhang, Zhao
    Xu, Dachuan
    Zhang, Xiaoyan
    ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT, AAIM 2019, 2019, 11640 : 284 - 291
  • [18] An approximation algorithm for the k-level capacitated facility location problem
    Du, Donglei
    Wang, Xing
    Xu, Dachuan
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2010, 20 (04) : 361 - 368
  • [19] Applying a revised VAM to a multi-level capacitated facility location problem
    Chen, Ying-Yen
    Wang, Hsiao-Fan
    2007 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT, VOLS 1-4, 2007, : 337 - 341
  • [20] An approximation algorithm for the k-level facility location problem with outliers
    Han, Lu
    Xu, Dachuan
    Liu, Dandan
    Wu, Chenchen
    OPTIMIZATION LETTERS, 2021, 15 (06) : 2053 - 2065