What you should know about location modeling

Facility location models have been applied to problems in the public and private sectors for years. In this article, the author first presents a taxonomy of location problems based on the underlying space in which the problem is embedded. The article illustrates problems from each part of the taxonomy with an emphasis on discrete location problems. Selected recent research in the area is also discussed. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008

[1]  Mark A. Turnquist,et al.  Integrating inventory impacts into a fixed-charge model for locating distribution centers , 1998 .

[2]  F. Plastria.  Network and discrete location models, algorithms and applications , 1996 .

[3]  Zuo-Jun Max Shen,et al.  An Inventory-Location Model: Formulation, Solution Algorithm and Computational Results , 2002, Ann. Oper. Res..

[4]  C. Revelle,et al.  A Lagrangean heuristic for the maximal covering location problem , 1996 .

[5]  Zvi Drezner,et al.  The gradual covering decay location problem on a network , 2003, Eur. J. Oper. Res..

[6]  Tony J. Van Roy,et al.  A Dual-Based Procedure for Dynamic Facility Location , 1982 .

[7]  Arie Tamir,et al.  An O(pn2) algorithm for the p-median and related problems on tree graphs , 1996, Oper. Res. Lett..

[8]  W. Isard.  Methods Of Regional Analysis , 1960 .

[9]  Mark S. Daskin,et al.  Models for Reliable Supply Chain Network Design , 2007 .

[10]  Charles S. ReVelle,et al.  The Location of Emergency Service Facilities , 1971, Oper. Res..

[11]  Mark S. Daskin,et al.  Network and Discrete Location: Models, Algorithms and Applications , 1995 .

[12]  R. L. Francis,et al.  State of the Art-Location on Networks: A Survey. Part II: Exploiting Tree Network Structure , 1983 .

[13]  Ferman Cumhur,et al.  Theory Of The Location Of Industries , 1960 .

[14]  Marshall L. Fisher,et al.  An Applications Oriented Guide to Lagrangian Relaxation , 1985 .

[15]  Mark S. Daskin,et al.  α-reliable p-minimax regret: a new model for strategic facility location modeling , 1997 .

[16]  Mark S. Daskin,et al.  The α‐reliable mean‐excess regret model for stochastic facility location modeling , 2006 .

[17]  H. Hotelling.  Stability in Competition , 1929 .

[18]  J. Current,et al.  An efficient tabu search procedure for the p-Median Problem , 1997 .

[19]  Donald Erlenkotter,et al.  A Dual-Based Procedure for Uncapacitated Facility Location , 1978, Oper. Res..

[20]  Vladimir Marianov,et al.  PROBABILISTIC MAXIMAL COVERING LOCATION-ALLOCATION FOR CONGESTED SYSTEMS , 1998 .

[21]  Carlos F. Daganzo,et al.  Logistics Systems Analysis , 1991 .

[22]  Zvi Drezner,et al.  An Efficient Genetic Algorithm for the p-Median Problem , 2003, Ann. Oper. Res..

[23]  J. Jewkes,et al.  Theory of Location of Industries. , 1933 .

[24]  Jiamin Wang,et al.  Locating service facilities to reduce lost demand , 2002 .

[25]  Zuo-Jun Max Shen,et al.  A Joint Location - Inventory Model , 2003, Transp. Sci..

[26]  R. Church,et al.  Location Modeling Utilizing Maximum Service Distance Criteria , 2010 .

[27]  M. Shirosaki.  Another proof of the defect relation for moving targets , 1991 .

[28]  Said Salhi,et al.  Facility Location: A Survey of Applications and Methods , 1996 .

[29]  T. Bell,et al.  An Analysis of Ancient Egyptian Settlement Patterns Using Location-Allocation Covering Models , 1988 .

[30]  P. Jonas.  General Theory, Social, Political and Regional with Particular Reference to Decision-making Analysis. Walter Isard , Tony E. Smith , Peter Isard , Tze Hsiung Tung , Michael Dacey , 1973 .

[31]  O. Kariv,et al.  An Algorithmic Approach to Network Location Problems. I: The p-Centers , 1979 .

[32]  Lawrence V. Snyder,et al.  Reliability Models for Facility Location: The Expected Failure Cost Case , 2005, Transp. Sci..

[33]  Trevor S. Hale,et al.  Location Science Research: A Review , 2003, Ann. Oper. Res..

[34]  David Simchi-Levi,et al.  A Location Based Heuristic for General Routing Problems , 1995, Oper. Res..

[35]  S. L. Hakimi,et al.  Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph , 1964 .

[36]  Timothy J. Lowe,et al.  Location on Networks: A Survey. Part I: The p-Center and p-Median Problems , 1983 .

[37]  Gilbert Laporte,et al.  What you should know about the vehicle routing problem , 2007 .

[38]  Mark S. Daskin,et al.  Planning for Disruptions in Supply Chain Networks , 2006 .

[39]  Hokey Min,et al.  Combined location-routing problems: A synthesis and future research directions , 1998, Eur. J. Oper. Res..

[40]  James P. Jarvis,et al.  Optimization in stochastic service systems with distinguishable servers , 1975 .

[41]  C. Revelle,et al.  Heuristic concentration: Two stage solution construction , 1997 .

[42]  Richard C. Larson,et al.  Approximating the Performance of Urban Emergency Service Systems , 1975, Oper. Res..

[43]  S. Hakimi.  Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems , 1965 .

[44]  Richard L. Church,et al.  Identifying Critical Infrastructure: The Median and Covering Facility Interdiction Problems , 2004 .

[45]  Walter Isard,et al.  Location and Space-Economy: A General Theory Relating to Industrial Location, Market Areas, Land Use, Trade, and Urban Structure , 1956 .

[46]  Richard L. Church,et al.  Protecting Critical Assets: The r-interdiction median problem with fortification , 2007 .

[47]  Mark S. Daskin,et al.  Stochastic p-robust location problems , 2006 .

[48]  RICHARD C. LARSON,et al.  A hypercube queuing model for facility location and redistricting in urban emergency services , 1974, Comput. Oper. Res..

[49]  Mark A. Turnquist,et al.  A two-echelon inventory allocation and distribution center location analysis , 2001 .

[50]  A. J. Goldman.  Optimal Center Location in Simple Networks , 1971 .

[51]  M. Kuby.  Programming Models for Facility Dispersion: The p‐Dispersion and Maxisum Dispersion Problems , 2010 .

[52]  F. E. Maranzana,et al.  On the Location of Supply Points to Minimize Transport Costs , 1964 .

[53]  Halit Üster,et al.  Tabu Search and Benders Decomposition Approaches for a Capacitated Closed-Loop Supply Chain Network Design Problem , 2009, Transp. Sci..

[54]  Vladimir Marianov,et al.  Probabilistic, Maximal Covering Location—Allocation Models forCongested Systems , 1998 .

[55]  Richard L. Church,et al.  A bilevel mixed-integer program for critical infrastructure protection planning , 2008, Comput. Oper. Res..

[56]  Mark S. Daskin,et al.  APPLICATION OF AN EXPECTED COVERING MODEL TO EMERGENCY MEDICAL SERVICE SYSTEM DESIGN , 1982 .

[57]  Richard L. Church,et al.  The maximal covering location problem , 1974 .

[58]  J. Current,et al.  Heuristic concentration and Tabu search: A head to head comparison , 1998 .

[59]  Mark S. Daskin,et al.  A Maximum Expected Covering Location Model: Formulation, Properties and Heuristic Solution , 1983 .

[60]  Elif Akçali,et al.  Benders decomposition with alternative multiple cuts for a multi‐product closed‐loop supply chain network design model , 2007 .

[61]  Oded Berman,et al.  Facility Location Problems with Stochastic Demands and Congestion , 2002 .

[62]  Polly Bart,et al.  Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph , 1968, Oper. Res..

[63]  Charles S. ReVelle,et al.  The Maximum Availability Location Problem , 1989, Transp. Sci..

[64]  Mark S. Daskin,et al.  A Facility Location Model for Bidirectional Flows , 2007, Transp. Sci..

[65]  Zvi Drezner,et al.  Facility location - applications and theory , 2001 .

[66]  R. D. Galvão.  THE USE OF LAGRANGEAN RELAXATION IN THE SOLUTION OF UNCAPACITATED FACILITY LOCATION PROBLEMS. , 1993 .

[67]  Marshall L. Fisher,et al.  The Lagrangian Relaxation Method for Solving Integer Programming Problems , 2004, Manag. Sci..

[68]  O. Kariv,et al.  An Algorithmic Approach to Network Location Problems. II: The p-Medians , 1979 .