scholarly journals Development of set covering model for determining the open /closed facilities location and resizing capacity of fasilities

2020 ◽  
Vol 909 (1) ◽  
pp. 012082 ◽  
Author(s):  
Utaminingsih Linarti ◽  
Cahaya Annisa’ Fatonah ◽  
Annie Purwani
Keyword(s):  
Facility Location ◽  
Location Problem ◽  
Facility Location Problem ◽  
Set Covering ◽  
Second Stage ◽  
Basic Model ◽  
Facilities Location ◽  
Covering Model ◽  
Two Stages ◽  
The Cost

Abstract Set Covering model determines the location of facilities that can be used that minimize the cost of assigning facilities to the point of request with the limitation that each facility was used for a number points of request. If there is an imbalance between the volume of demand points and the capacity of the facilities, it is necessary to open/closed facilities. In fact, facility location problem can extended for the decision not only open/closed but rezising area the existing facilities that can be adjusted considering the avaibility area of facilities location and demand points. This case has not been accommodated on the basic model of set covering. Not all the existing facilities can be resized. Rezising the area of facility location was assumed discrete. The aims of this study was optimized the alghorithm of set covering model. The solution this study was devided into two stages. The first stage was screening facilities that can be resized with survey location. The second stage was set covering model which the facilities will be close/opened and resize the existing facilities.

scholarly journals Non-linear Integer Programming Model and Algorithms for Connected p-facility Location Problem

2014 ◽  
Vol 2 (5) ◽  
pp. 451-460 ◽  
Author(s):  
Jianming Zhu
Keyword(s):  
Integer Programming ◽  
Facility Location ◽  
Shortest Path ◽  
Location Problem ◽  
Programming Model ◽  
Maximum Clique ◽  
Facility Location Problem ◽  
Linear Integer Programming ◽  
Non Linear ◽  
The Cost

AbstractIn this paper, a new location analysis method is presented. Given a connected graphG= (V, E)with nonnegative edge costcefor each edgee∊E,dijis the cost of the shortest path between verticesiandjin the graph. TheConnected p-facility Location Problem(CpLP) is to choosepvertices fromVso as to minimize the total cost of shortest path of pair-wise of thesepvertices. This problem is proved to be NP-hard and non-linear integer programming is formulated. Then, two algorithms are designed for solving the CpLP. One is a heuristic algorithm based on classical maximum clique approach, while the second one is genetic algorithm. Finally, computational results show the comparison between these two algorithms.

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