A minimax regret model for the leader–follower facility location problem

2020 ◽  
Author(s):  
Xiang Li ◽  
Tianyu Zhang ◽  
Liang Wang ◽  
Hongguang Ma ◽  
Xiande Zhao
Keyword(s):  
Facility Location ◽  
Location Problem ◽  
Facility Location Problem ◽  
Minimax Regret

scholarly journals A New Model for Reliable Facility Location Problem under Random Disruptions

2010 ◽  
pp. 90-93
Author(s):  
M. Rajaei ◽  
S.M. Moattarhusseini ◽  
F. Parvaresh
Keyword(s):  
Supply Chain ◽  
Facility Location ◽  
Location Problem ◽  
Facility Location Problem ◽  
Fixed Charge ◽  
Minimax Regret ◽  
Computational Results ◽  
Worst Case ◽  
New Model ◽  
Reliable Facility Location

Supply chains are subject to various types of disruptions. In this paper, we analyze the problem of locating facilities in a supply chain under random disruptions on facilities. We present a new reliable location model called ‘the α-reliable Minimax regret’ which we apply it to the capacitated reliable fixed charge location problem. The model minimizes the worst-case regret with respect to a subset of worst-case scenarios whose collective probability of occurrence is at least α. The model is solved by CPLEX. Computational Results show it is efficient.

scholarly journals Dispersing Obnoxious Facilities on a Graph

Algorithmica ◽  
2021 ◽  
Author(s):  
Alexander Grigoriev ◽  
Tim A. Hartmann ◽  
Stefan Lendl ◽  
Gerhard J. Woeginger
Keyword(s):  
Facility Location ◽  
Location Problem ◽  
Unit Length ◽  
Facility Location Problem ◽  
Np Hard ◽  
Obnoxious Facilities ◽  
Rational Parameter ◽  
Polynomially Solvable

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.

Fuzzy facility location problem with preference of candidate sites

2007 ◽  
Vol 158 (17) ◽  
pp. 1922-1930 ◽  
Author(s):  
Hiroaki Ishii ◽  
Yung Lung Lee ◽  
Kuang Yih Yeh
Keyword(s):  
Facility Location ◽  
Location Problem ◽  
Facility Location Problem
Sign in / Sign up

Export Citation Format

Share Document