Obnoxious-facility location and data-envelopment analysis: A combined distance-based formulation

2002 ◽  
Vol 141 (3) ◽  
pp. 495-514 ◽  
Author(s):  
Peter Thomas ◽  
Yupo Chan ◽  
Lee Lehmkuhl ◽  
William Nixon
Keyword(s):  
Data Envelopment Analysis ◽  
Facility Location ◽  
Data Envelopment ◽  
Obnoxious Facility Location ◽  
Obnoxious Facility

OBNOXIOUS FACILITY LOCATION: COMPLETE SERVICE WITH MINIMAL HARM

2000 ◽  
Vol 10 (06) ◽  
pp. 581-592 ◽  
Author(s):  
BOAZ BEN-MOSHE ◽  
MATTHEW J. KATZ ◽  
MICHAEL SEGAL
Keyword(s):  
Data Structure ◽  
Facility Location ◽  
Efficient Solution ◽  
Location Problem ◽  
Facility Location Problem ◽  
Efficient Algorithms ◽  
Minimal Distance ◽  
Rectangular Region ◽  
Obnoxious Facility Location ◽  
Obnoxious Facility

We present efficient algorithms for several instances of the following facility location problem. Place k obnoxious facilities, with respect to n given demand sites and m given regions, where the goal is to maximize the minimal distance between a demand site and a facility, under the constraint that each of the regions must contain at least one facility. We also present an efficient solution to the following planar problem that arises as a subproblem. Given n transmitters, each of range r, construct a compact data structure that supports coverage queries, i.e., determine whether a query polygonal/rectangular region is fully covered by the transmitters.

scholarly journals Combined Single-Source and Multi-source Capacitated Facility Location Problems with Data Envelopment Analysis

2020 ◽  
Vol 2020 ◽  
pp. 1-9
Author(s):  
Ali Jamalian ◽  
Maziar Salahi
Keyword(s):  
Data Envelopment Analysis ◽  
Facility Location ◽  
Location Problems ◽  
Data Envelopment ◽  
Single Source ◽  
Efficiency Criterion ◽  
Facility Location Problems ◽  
Capacitated Facility Location ◽  
Location Patterns ◽  
Using Data

In this paper, we incorporate an efficiency criterion using data envelopment analysis into the single-source and multi-source capacitated facility location problems. We develop two bi-objective integer programs to find optimal and efficient location patterns, simultaneously. The proposed models for these capacitated facility location problems have fewer variables and constraints compared to existing models presented in the literature. We use the LP-metric procedure to solve the proposed models on two numerical examples. Results show that new models give better solutions, based on cost and efficiency criteria.

Sign in / Sign up

Export Citation Format

Share Document