Location Planning and Network Design

The planning of a new location belongs to the most complex and difficult planning problems in decision making. Moreover, it belongs to the strategic field of planning which deals with the most important and far-reaching decisions. While the problems considered in the previous chapters are mostly studied on an operative planning level, decisions about single locations or the structure of a supply chain are usually of long-term nature and may be crucial for the future survival and success of a company.

[1]  Jayaram K. Sankaran,et al.  On solving large instances of the capacitated facility location problem , 2007, Eur. J. Oper. Res..

[2]  Maria João Cortinhal,et al.  Dynamic design and re-design of multi-echelon, multi-product logistics networks with outsourcing opportunities: A computational study , 2015, Comput. Ind. Eng..

[3]  Sudipto Guha,et al.  A constant factor approximation algorithm for the fault-tolerant facility location problem , 2003, J. Algorithms.

[4]  Paolo Toth,et al.  A two-phase hybrid heuristic algorithm for the capacitated location-routing problem , 2013, Comput. Oper. Res..

[5]  Juan A. Díaz,et al.  Hybrid scatter search and path relinking for the capacitated p , 2006, Eur. J. Oper. Res..

[6]  Saïd Salhi,et al.  Location-routing: Issues, models and methods , 2007, Eur. J. Oper. Res..

[7]  Rajan Batta,et al.  On the use of genetic algorithms to solve location problems , 2002, Comput. Oper. Res..

[8]  Tunchan Cura,et al.  A parallel local search approach to solving the uncapacitated warehouse location problem , 2010, Comput. Ind. Eng..

[9]  Mustafa Ç. Pınar,et al.  An exact algorithm for the capacitated vertex p-center problem , 2006, Comput. Oper. Res..

[10]  Leon Cooper,et al.  Heuristic Methods for Location-Allocation Problems , 1964 .

[11]  George L. Nemhauser,et al.  The uncapacitated facility location problem , 1990 .

[12]  Tsung-Yu Chou,et al.  A fuzzy multi-criteria decision model for international tourist hotels location selection , 2008 .

[13]  Chen-Tung Chen,et al.  A fuzzy approach to select the location of the distribution center , 2001, Fuzzy Sets Syst..

[14]  I. K. Altinel,et al.  Solving the uncapacitated multi-facility Weber problem by vector quantization and self-organizing maps , 2006, J. Oper. Res. Soc..

[15]  Ehsan Nikbakhsh,et al.  Hub location problems: A review of models, classification, solution techniques, and applications , 2013, Comput. Ind. Eng..

[16]  J Brimberg,et al.  The multi-source Weber problem with constant opening cost , 2004, J. Oper. Res. Soc..

[17]  Temel Öncan.  Heuristics for the single source capacitated multi-facility Weber problem , 2013, Comput. Ind. Eng..

[18]  Meilin Wen,et al.  Facility location-allocation problem in random fuzzy environment: Using (alpha, beta) -cost minimization model under the Hurewicz criterion , 2008, Comput. Math. Appl..

[19]  Timothy J. Lowe,et al.  Specially Structured Uncapacitated Facility Location Problems , 1995, Oper. Res..

[20]  Gerhard Reinelt,et al.  Minimizing the maximum travel time in a combined model of facility location and network design , 2012 .

[21]  Sebastián Lozano,et al.  Kohonen maps for solving a class of location-allocation problems , 1998, Eur. J. Oper. Res..

[22]  Ching-Jung Ting,et al.  Combining Lagrangian heuristic and Ant Colony System to solve the Single Source Capacitated Facility Location Problem , 2008 .

[23]  Bassem Jarboui,et al.  Genetic algorithm with iterated local search for solving a location-routing problem , 2012, Expert Syst. Appl..

[24]  Alex Alves Freitas,et al.  A Genetic Algorithm for Solving a Capacitated p-Median Problem , 2004, Numerical Algorithms.

[25]  Samir Khuller,et al.  Greedy strikes back: improved facility location algorithms , 1998, SODA '98.

[26]  Sibel A. Alumur,et al.  Location and Logistics , 2013 .

[27]  Minghe Sun.  Solving the uncapacitated facility location problem using tabu search , 2006, Comput. Oper. Res..

[28]  Zvi Drezner,et al.  A new formulation for the conditional p-median and p-center problems , 2008, Oper. Res. Lett..

[29]  Jozef Kratica,et al.  Solving the simple plant location problem by genetic algorithm , 2001, RAIRO Oper. Res..

[30]  Diptesh Ghosh,et al.  Neighborhood search heuristics for the uncapacitated facility location problem , 2003, Eur. J. Oper. Res..

[31]  Shuo-Yan Chou,et al.  A fuzzy simple additive weighting system under group decision-making for facility location selection with objective/subjective attributes , 2008, Eur. J. Oper. Res..

[32]  Pierre Hansen,et al.  Decomposition Strategies for Large Scale Continuous Location-Allocation Problems , 2004 .

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

[34]  Roberto Musmanno,et al.  The capacitated plant location problem with multiple facilities in the same site , 2002, Comput. Oper. Res..

[35]  Mohamad Saeed Jabalameli,et al.  Modeling the budget-constrained dynamic uncapacitated facility location-network design problem and solving it via two efficient heuristics: A case study of health care , 2013, Math. Comput. Model..

[36]  Yang Yan,et al.  Parallel multi-population Particle Swarm Optimization Algorithm for the Uncapacitated Facility Location problem using OpenMP , 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).

[37]  Maria Paola Scaparra,et al.  Sloan School of Management Working Paper 4387-02 October 2002 A MULTI-EXCHANGE HEURISTIC FOR THE SINGLE SOURCE CAPACITATED FACILITY LOCATION PROBLEM , 2002 .

[38]  Iván A. Contreras,et al.  Scatter search for the single source capacitated facility location problem , 2007, Ann. Oper. Res..

[39]  Mehmet Sevkli,et al.  A discrete particle swarm optimization algorithm for uncapacitated facility location problem , 2008 .

[40]  Da Ruan,et al.  Fuzzy group decision-making for facility location selection , 2003, Inf. Sci..

[41]  Pierre Hansen,et al.  Solving the p‐Center problem with Tabu Search and Variable Neighborhood Search , 2000, Networks.

[42]  Mohammad Reza Malek,et al.  A new GA based solution for capacitated multi source Weber problem , 2010, Int. J. Comput. Intell. Syst..

[43]  Heng Li,et al.  A GIS approach to shopping mall location selection , 2007 .

[44]  Refael Hassin,et al.  Lexicographic local search and the p , 2003, Eur. J. Oper. Res..

[45]  M. Gen,et al.  Hybrid evolutionary method for obstacle location-allocation , 1995 .

[46]  Zorica Stanimirovic,et al.  Metaheuristic methods for solving the Bilevel Uncapacitated Facility Location Problem with Clients' Preferences , 2012, Electron. Notes Discret. Math..

[47]  Baoding Liu,et al.  New stochastic models for capacitated location-allocation problem , 2003, Comput. Ind. Eng..

[48]  Mohammad Saeed Jabalameli,et al.  An Efficient Hybrid Particle Swarm Optimization Algorithm for Solving the Uncapacitated Continuous Location-Allocation Problem , 2012 .

[49]  Rex K. Kincaid,et al.  Technical Note - The Discrete Anti-P-Center Problem , 1994, Transp. Sci..

[50]  Basheer M. Khumawala,et al.  An empirical comparison of tabu search, simulated annealing, and genetic algorithms for facilities location problems , 1997 .

[51]  Pierre Hansen,et al.  The p-median problem: A survey of metaheuristic approaches , 2005, Eur. J. Oper. Res..

[52]  P. Hansen,et al.  Variable neighborhood search for the p-median , 1997 .

[53]  Chih-Hung Wu,et al.  Genetic subgradient method for solving location-allocation problems , 2007, Appl. Soft Comput..

[54]  Temel Öncan,et al.  The multi-commodity capacitated multi-facility Weber problem: heuristics and confidence intervals , 2010 .

[55]  Maria Grazia Speranza,et al.  A heuristic for BILP problems: The Single Source Capacitated Facility Location Problem , 2014, Eur. J. Oper. Res..

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

[57]  Mohammad Abdulrahman Al-Fawzan,et al.  A tabu search approach to the uncapacitated facility location problem , 1999, Ann. Oper. Res..

[58]  Ching-Jung Ting,et al.  A simulated annealing heuristic for the capacitated location routing problem , 2010, Comput. Ind. Eng..

[59]  Minghe Sun,et al.  A tabu search heuristic procedure for the capacitated facility location problem , 2012, J. Heuristics.

[60]  Roberto Baldacci,et al.  A Bionomic Approach to the Capacitated p-Median Problem , 1998, J. Heuristics.

[61]  Justo Puerto,et al.  Location Theory - A Unified Approach , 2005 .

[62]  Christine L. Mumford,et al.  The multi-objective uncapacitated facility location problem for green logistics , 2009, 2009 IEEE Congress on Evolutionary Computation.

[63]  M Ohlemüller.  Tabu search for large location–allocation problems , 1997 .

[64]  Kenichi Ida,et al.  A genetic algorithm for the uncapacitated facility location problem , 2011 .

[65]  Michael Drexl,et al.  A survey of variants and extensions of the location-routing problem , 2015, Eur. J. Oper. Res..

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

[67]  Christine L. Mumford,et al.  An evolutionary bi-objective approach to the capacitated facility location problem with cost and CO2 emissions , 2011, GECCO '11.

[68]  M. Jabalameli,et al.  Hybrid algorithms for the uncapacitated continuous location-allocation problem , 2008 .

[69]  S. M. H. Manzour-al-Ajdad,et al.  Single-Source Capacitated Multi-Facility Weber Problem - An iterative two phase heuristic algorithm , 2012, Comput. Oper. Res..

[70]  Charles ReVelle,et al.  Central Facilities Location , 2010 .

[71]  R. Sridharan.  The capacitated plant location problem , 1995 .

[72]  Bassem Jarboui,et al.  An Iterated Local Search for Solving A Location-Routing Problem , 2010, Electron. Notes Discret. Math..

[73]  Nenad Mladenovic,et al.  Variable neighborhood search for location routing , 2013, Comput. Oper. Res..

[74]  Nimrod Megiddo,et al.  On the Complexity of Some Common Geometric Location Problems , 1984, SIAM J. Comput..

[75]  Hanif D. Sherali,et al.  NP-Hard, Capacitated, Balanced p-Median Problems on a Chain Graph with a Continuum of Link Demands , 1988, Math. Oper. Res..

[76]  Dusan Ramljak,et al.  Bee colony optimization for the p-center problem , 2011, Comput. Oper. Res..

[77]  Andrew Lim,et al.  k-Center Problems with Minimum Coverage , 2004, COCOON.

[78]  Christopher R. Houck,et al.  Comparison of genetic algorithms, random restart and two-opt switching for solving large location-allocation problems , 1996, Comput. Oper. Res..

[79]  Saudi Arabia,et al.  Simulated Annealing Metaheuristic for Solving P-Median Problem 1 , 2008 .

[80]  D. Tcha,et al.  A branch-and-bound algorithm for the multi-level uncapacitated facility location problem , 1984 .

[81]  Carlos Ivorra,et al.  The fuzzy p-median problem: A global analysis of the solutions , 2001, Eur. J. Oper. Res..

[82]  Nasrin Asgari,et al.  Multiple criteria facility location problems: A survey , 2010 .

[83]  Fang-Chih Tien,et al.  Self-organizing feature maps for solving location-allocation problems with rectilinear distances , 2004, Comput. Oper. Res..

[84]  Karl F. Doerner,et al.  Multi-criteria location planning for public facilities in tsunami-prone coastal areas , 2009, OR Spectr..

[85]  M. Rönnqvist,et al.  Lagrangian heuristics for the two-echelon, single-source, capacitated facility location problem , 1997 .

[86]  Kerstin Dächert,et al.  Allocation search methods for a generalized class of location-allocation problems , 2009, Eur. J. Oper. Res..

[87]  Said Salhi,et al.  Constructive heuristics for the uncapacitated continuous location-allocation problem , 2001, J. Oper. Res. Soc..

[88]  Maria Paola Scaparra,et al.  Large-scale local search heuristics for the capacitated vertex p-center problem , 2004, Networks.

[89]  S. K. Goyal,et al.  A multi-criteria decision making approach for location planning for urban distribution centers under uncertainty , 2011, Math. Comput. Model..

[90]  António Pais Antunes,et al.  On solving complex multi-period location models using simulated annealing , 2001, Eur. J. Oper. Res..

[91]  Christian Prins,et al.  A survey of recent research on location-routing problems , 2014, Eur. J. Oper. Res..

[92]  F. Silva,et al.  A capacitated facility location problem with constrained backlogging probabilities , 2007 .

[93]  Fernando Y. Chiyoshi,et al.  A statistical analysis of simulated annealing applied to the p-median problem , 2000, Ann. Oper. Res..

[94]  Jian Zhou,et al.  Modeling capacitated location-allocation problem with fuzzy demands , 2007, Comput. Ind. Eng..

[95]  Pierre Hansen,et al.  Improvement and Comparison of Heuristics for Solving the Uncapacitated Multisource Weber Problem , 2000, Oper. Res..

[96]  Ali Kaveh,et al.  Solving the conditional and unconditional p-center problem with modified harmony search: A real case study , 2011 .

[97]  Saïd Salhi,et al.  A guided reactive GRASP for the capacitated multi-source Weber problem , 2011, Comput. Oper. Res..

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

[99]  Saïd Salhi,et al.  A Genetic Algorithm Based Approach for the Uncapacitated Continuous Location–Allocation Problem , 2003, Ann. Oper. Res..

[100]  Ching-Jung Ting,et al.  A multiple ant colony optimization algorithm for the capacitated location routing problem , 2013 .