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

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 \in (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 $$ \left( 1/\alpha + 6/(1-2\alpha ) \right) $$-approximation algorithm. The ratio is 14.9282 when setting $$ \alpha = 0.183 $$.

[1]  Vijay V. Vazirani,et al.  Approximation algorithms for metric facility location and k-Median problems using the primal-dual schema and Lagrangian relaxation , 2001, JACM.

[2]  Aravind Srinivasan,et al.  An Improved Approximation for k-Median and Positive Correlation in Budgeted Optimization , 2014, SODA.

[3]  Mohit Singh,et al.  LP-Based Algorithms for Capacitated Facility Location , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.

[4]  Dongmei Zhang,et al.  A local search approximation algorithm for the uniform capacitated k-facility location problem , 2018, J. Comb. Optim..

[5]  Dachuan Xu,et al.  An improved approximation algorithm for the k-level facility location problem with soft capacities , 2017 .

[6]  Mohammad Mahdian,et al.  A 2-Approximation Algorithm for the Soft-Capacitated Facility Location Problem , 2003, RANDOM-APPROX.

[7]  Shi Li,et al.  Approximating k-Median via Pseudo-Approximation , 2016, SIAM J. Comput..

[8]  Amitabh Sinha,et al.  Hedging Uncertainty: Approximation Algorithms for Stochastic Optimization Problems , 2006, Math. Program..

[9]  Jiawei Zhang,et al.  Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem , 2004, SIAM J. Discret. Math..

[10]  David B. Shmoys,et al.  Approximation algorithms for facility location problems , 2000, APPROX.

[11]  Adriana Felicia Gabor,et al.  A Simple Dual Ascent Algorithm for the Multilevel Facility Location Problem , 2001, RANDOM-APPROX.

[12]  Jiawei Zhang Approximating the two-level facility location problem via a quasi-greedy approach , 2004, SODA '04.

[13]  Kamesh Munagala,et al.  Local Search Heuristics for k-Median and Facility Location Problems , 2004, SIAM J. Comput..

[14]  Evangelos Markakis,et al.  Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP , 2002, JACM.

[15]  Shi Li On Facility Location with General Lower Bounds , 2019, SODA.

[16]  Aravind Srinivasan,et al.  Approximation algorithms for stochastic and risk-averse optimization , 2007, SODA '07.

[17]  Fabián A. Chudak,et al.  Improved Approximation Algorithms for the Uncapacitated Facility Location Problem , 2003, SIAM J. Comput..

[18]  Jan-Kees C. W. van Ommeren,et al.  A new approximation algorithm for the multilevel facility location problem , 2010, Discret. Appl. Math..

[19]  W. Kern,et al.  A simple dual ascent algorithm for the multilevel facility location problem , 2001, Electron. Notes Discret. Math..

[20]  Éva Tardos,et al.  Approximation algorithms for facility location problems (extended abstract) , 1997, STOC '97.

[21]  Maxim Sviridenko,et al.  Inapproximability of the Multilevel Uncapacitated Facility Location Problem , 2016, ACM Trans. Algorithms.

[22]  Dongmei Zhang,et al.  A Streaming Algorithm for k-Means with Approximate Coreset , 2019, Asia Pac. J. Oper. Res..

[23]  Shi Li A 1.488 approximation algorithm for the uncapacitated facility location problem , 2013, Inf. Comput..

[24]  Behrooz Alizadeh,et al.  Optimal Algorithms for Integer Inverse Undesirable p-Median Location Problems on Weighted Extended Star Networks , 2018, Journal of the Operations Research Society of China.

[25]  Jaroslaw Byrka,et al.  An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem , 2006, SIAM J. Comput..

[26]  Chaitanya Swamy,et al.  An approximation scheme for stochastic linear programming and its application to stochastic integer programs , 2006, JACM.