Open AccessBook
Facility location : a survey of applications and methods
Zvi Drezner
- 01 Jan 1995
924
TL;DR: In this paper, the authors present a methodology and analysis of facility location, including estimating distances, and global optimization in location, with the goal of reducing the number of workers in a facility.
read more
Abstract: Book Overview.- I Methodology and Analysis of Facility Location.- 1 Estimating Distances.- 1.1 Introduction.- 1.2 Norms as Distance Estimating Functions.- 1.3 The ?p Norm.- 1.4 Conclusions.- 2 Replacing Discrete Demand with Continuous Demand.- 2.1 Introduction.- 2.2 Formulation and Analysis.- 2.3 Evaluating a Double Integral.- 2.4 Analysis of the Example Problem.- 2.5 The Distance Correction Approach.- 2.6 Conclusions.- 3 Global Optimization in Location.- 3.1 Introduction.- 3.2 Branch-and-bound Methods.- 3.3 Lipschitz Optimization.- 3.4 Outer Approximation.- 3.5 Polyhedral Annexation.- 3.6 Decomposition Methods.- 3.7 Linearization Methods.- 3.8 Specialized Methods.- 3.9 Conclusions.- 4 Inferred Ideal Weights for Multiple Facilities.- 4.1 Introduction.- 4.2 Information Minimizing Model.- 4.3 Extensions to Multiple Facilities.- 4.4 Conclusions.- 5 Conjugate Duality in Facility Location.- 5.1 Introduction.- 5.2 Conjugate Duality Theory.- 5.3 The Minisum Model.- 5.4 The Minimax Model.- 6 Using Voronoi Diagrams.- 6.1 Introduction.- 6.2 The Voronoi Diagram.- 6.3 The Continuous p-median Problem.- 6.4 Continuous p-center Problems.- 6.5 The Time-Space p-Median Problem.- 6.6 Mobile Facility Location Problem (Constrained p-median).- 6.7 Other Continuous Location Problems.- 6.8 Conclusions.- II Various Objectives in Facility Location.- 7 Location with Market Externalities.- 7.1 Introduction.- 7.2 Notation and Assumptions.- 7.3 Analysis of User-Choice Equilibrium.- 7.4 Facility Location with Market Externalities.- 7.5 Resource Allocation with Market Externalities.- 7.6 Future Research and Conclusions.- 8 Objectives in Location Problems.- 8.1 Introduction.- 8.2 Elements of Location Models.- 8.3 Pull Objectives.- 8.4 Push Objectives.- 8.5 Balancing Objectives.- 8.6 Conclusions.- 8.7 Glossary.- 9 Distribution System Design.- 9.1 Introduction.- 9.2 A Case Study.- 9.3 Diagnostic Tools.- 9.4 Algebraic Language Tools.- 9.5 Conclusions.- 9.6 Annotated Bibliography.- 10 Siting Emergency Services.- 10.1 Introduction - What are the Important Issues?.- 10.2 Methods Based on Deterministic Optimization Models.- 10.3 Deterministic Models Addressing Congestion.- 10.4 Methods Based on Probabilistic Optimization Models.- 10.5 Descriptive Models and Heuristic Solution Procedures.- 10.6 Conclusions.- 11 Continuous Location Problems.- 11.1 Continuous Location.- 11.2 Distance.- 11.3 Dominance, Efficiency and Voting.- 11.4 Single Facility Location Problems.- 11.5 Single Facility Location-Allocation Problems.- 11.6 Multifacility Location Problems.- 11.7 Multifacility Location-Allocation Problems.- 11.8 Other Related Problems.- 12 Global Manufacturing Strategy.- 12.1 Introduction.- 12.2 Global Manufacturing Strategy Planning Process.- 12.3 The Production-Distribution System Design Problem.- 12.4 Designing International Production-Distribution Systems.- 12.5 Concluding Comments.- III Competitive Facility Location.- 13 Competitive Facility Location in the Plane.- 13.1 Introduction.- 13.2 The Deterministic Utility Model.- 13.3 The Random Utility Model.- 13.4 Gravity Models.- 13.5 Computational Results.- 13.6 Conclusions.- 14 Multifacility Retail Networks.- 14.1 Introduction.- 14.2 Location-Allocation Models.- 14.3 The Components of Retail Location-Allocation Models.- 14.4 Five Types of Location-Allocation Models.- 14.5 Applying Covering Models for Service Center Location.- 14.6 Extension to Basic Models.- 14.7 Conclusions.- 15 Economic Models of Firm Location.- 15.1 Introduction.- 15.2 Spatial Pricing Policies.- 15.3 Finding the Optimal Price(s).- 15.4 The Price-Continuous Facility Location Problem.- 15.5 The Price-Discrete Facility Location Problem.- 15.6 Conclusions.- 16 Competitive Location in Discrete Space.- 16.1 Introduction.- 16.2 Discrete Competitive Location Models: An Overview.- 16.3 A Review of The Maximum Capture Problem.- 16.4 Extensions of the Maximum Capture Problem.- 16.5 Extensions of the Pre-emptive Capture Problem.- 16.6 Conclusions.- IV Routing and Location.- 17 Flow-Interception Problems.- 17.1 Introduction.- 17.2 Deterministic Flow Interception Problems.- 17.3 Probabilistic Flow Interception Problems.- 17.4 Future Research.- 18 Location-Routing Problems with Uncertainty.- 18.1 Introduction.- 18.2 The Traveling Salesman Location Problem.- 18.3 The Probabilistic Traveling Salesman Location Problem.- 18.4 Applications to Systems Design and Strategic Planning.- 18.5 A Different Class of Stochastic Facility Location Problems.- 19 Location, Routing and the Environment.- 19.1 Introduction.- 19.2 The Mechanism of Airborne Pollution Spread.- 19.3 Relevant Features of Bicriterion Problems.- 19.4 Location of Obnoxious Facilities.- 19.5 Routing of Obnoxious Vehicles.- 19.6 Future Directions.- 20 Hazardous Materials Logistics.- 20.1 Introduction.- 20.2 Risk Assessment.- 20.3 Equity.- 20.4 Cost Aspects.- 20.5 Planning Potentially Hazardous Facilities.- 20.6 Hazardous Materials Transport Planning.- 20.7 Integrated Models.- 20.8 Conclusions and Suggestions.- References.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
On r-Gatherings on the Line
Toshihiro Akagi,Shin-ichi Nakano +1 more
TL;DR: An algorithm to find an \(r\)-gathering with the minimum cost, where the cost is \(\max _{c_i\in C}\{co( c_i,A(c-i))\}\), when all \(C\) and \(F\) are on the real line.
9
An ADMM-based location–allocation algorithm for nonconvex constrained multi-source Weber problem under gauge
TL;DR: A new ADMM-based location–allocation algorithm is presented for CMSWP and its local convergence is theoretically proved and some preliminary numerical results are reported to verify the effectiveness of proposed methods.
9
Moving walkways, escalators, and elevators
Jean Cardinal,Sébastien Collette,Ferran Hurtado,Stefan Langerman,Belén Palop +4 more
- 01 Jan 2007
TL;DR: This work considers algorithms for finding the optimal location of a moving walkway, consisting of a pair of points in the plane between which the travel speed is high, and gives a simple linear-time algorithm for finding an optimal location in the case where the points are on a line.
9
Discrete Optimization A note on duality gap in the simple plant location problem
N. Mladenovica,J. Brimberg,P. Hansen +2 more
- 01 Jan 2006
TL;DR: The duality gap derived by Erlenkotter, which has been widely used in the literature, is a special case of the formulas presented here, and may be used to obtain improved lower bounds for branch-and-bound algorithms.
9
Intermodal network expansion in a competitive environment with uncertain demands
Fateme Fotuhi,Nathan Huynh +1 more
TL;DR: In this article, a Simulated Annealing (SA) algorithm is developed to solve the robust optimization problem of finding near-optimal locations for new intermodal terminals and their capacities for a railroad company, which operates an inter-modal network in a competitive environment.
Related Papers (5)
Zvi Drezner,Horst W. Hamacher +1 more
- 01 Jan 2001
Jorge E. Cortes,Sonia Martinez,Timur Karatas,Francesco Bullo +3 more
- 07 Aug 2002
Richard L. Church,Charles R. Velle +1 more
- 01 Jan 1974