scholarly journals A simulation based research on chance constrained programming in robust facility location problem

Open Physics ◽  
2017 ◽  
Vol 15 (1) ◽  
pp. 87-96
Author(s):  
Leng Kaijun ◽  
Shi Wen ◽  
Song Guanghua ◽  
Pan Lin

AbstractSince facility location decisions problem include long-term character and potential parameter variations, it is important to consider uncertainty in its modeling. This paper examines robust facility location problem considering supply uncertainty, in which we assume the supply of the facility in the actual operation is not equal to the supply initially established, the supply is subject to random fluctuation. The chance constraints are introduced when formulating the robust facility location model to make sure the system operate properly with a certain probability while the supply fluctuates. The chance constraints are approximated safely by using Hoeffding’s inequality and the problem is transformed to a general deterministic linear programming. Furthermore, how the facility location cost change with confidence level is investigated through a numerical example. The sensitivity analysis is conducted for important parameters of the model and we get the main factors that affect the facility location cost.

2016 ◽  
Vol 49 (1) ◽  
pp. 136-160 ◽  
Author(s):  
Reza Tavakkoli-Moghaddam ◽  
Samira Vazifeh-Noshafagh ◽  
Ata Allah Taleizadeh ◽  
Vahid Hajipour ◽  
Amin Mahmoudi

Algorithmica ◽  
2021 ◽  
Author(s):  
Alexander Grigoriev ◽  
Tim A. Hartmann ◽  
Stefan Lendl ◽  
Gerhard J. Woeginger

AbstractWe study a continuous facility location problem on a graph where all edges have unit length and where the facilities may also be positioned in the interior of the edges. The goal is to position as many facilities as possible subject to the condition that any two facilities have at least distance $$\delta$$ δ from each other. We investigate the complexity of this problem in terms of the rational parameter $$\delta$$ δ . The problem is polynomially solvable, if the numerator of $$\delta$$ δ is 1 or 2, while all other cases turn out to be NP-hard.


2007 ◽  
Vol 158 (17) ◽  
pp. 1922-1930 ◽  
Author(s):  
Hiroaki Ishii ◽  
Yung Lung Lee ◽  
Kuang Yih Yeh

Sign in / Sign up

Export Citation Format

Share Document