Recent Advances and Issues in Facility Location Problems

There exist many variants of facility location problems. This chapter discusses some most recent advances and issues in this field including a capacitated plant location problem with multi commodity flow (CPLPMF) , a multi-type transshipment point location problem with multi commodity flow (MTTLMF), a large scale new variant of capacitated clustering problem (VCCP), a location problem with selective matching and vehicles assignment (LCSMVA), and competitive. CPLPMF is a combination of capacitated plant location problem (CPLP) and multi commodity min-cost flow (MMCF) problem. MTTLMF is an extension of two-stage capacitated facility location problem (TSCFLP) considering both MMCF and several transshipment point (TP) types for the goal to locate TPs with appropriate types to ship different commodities from plants to customers while minimizing the total cost for opening TPs and shipment. VCCP is a new variant of the capacitated clustering problem, which describes a location-replenishment problem in upstream supply network design.

[1]  D. Tcha,et al.  A branch and bound algorithm for the two-level uncapacitated facility location problem with some side constraints , 1984 .

[2]  Oli B.G. Madsen,et al.  A comparative study of heuristics for a two-level routing-location problem , 1980 .

[3]  Mark S. Daskin,et al.  Strategic facility location: A review , 1998, Eur. J. Oper. Res..

[4]  Francisco Saldanha-da-Gama,et al.  Facility location and supply chain management - A review , 2009, Eur. J. Oper. Res..

[5]  Justo Puerto,et al.  A multiperiod two-echelon multicommodity capacitated plant location problem , 2000, Eur. J. Oper. Res..

[6]  Rafael Martí,et al.  Scatter Search: Diseño Básico y Estrategias avanzadas , 2002, Inteligencia Artif..

[7]  Nathalie Bostel,et al.  A facility location model for logistics systems including reverse flows: The case of remanufacturing activities , 2007, Comput. Oper. Res..

[8]  L. Nozick.  The fixed charge facility location problem with coverage restrictions , 2001 .

[9]  Feng Chu,et al.  A Lagrangian relaxation approach for a large scale new variant of capacitated clustering problem , 2011, Comput. Ind. Eng..

[10]  Rafael Caballero,et al.  Solving a multiobjective location routing problem with a metaheuristic based on tabu search. Application to a real case in Andalusia , 2007, Eur. J. Oper. Res..

[11]  Feng Chu,et al.  Lower and upper bounds for a capacitated plant location problem with multicommodity flow , 2009, Comput. Oper. Res..

[12]  Gilbert Laporte,et al.  The capacity and distance constrained plant location problem , 2009, Comput. Oper. Res..

[13]  Deniz Aksen,et al.  A location-routing problem for the conversion to the "click-and-mortar" retailing: The static case , 2008, Eur. J. Oper. Res..

[14]  James F. Campbell.  Hub location for time definite transportation , 2009, Comput. Oper. Res..

[15]  Hasan Pirkul,et al.  Planning and coordination of production and distribution facilities for multiple commodities , 2001, Eur. J. Oper. Res..

[16]  Samir Elhedhli,et al.  Integrated design of supply chain networks with three echelons, multiple commodities and technology selection , 2008 .

[17]  Halit Üster,et al.  A scatter search-based heuristic to locate capacitated transshipment points , 2007, Comput. Oper. Res..

[18]  Qiang Meng,et al.  Production , Manufacturing and Logistics Competitive facility location on decentralized supply chains , 2009 .

[19]  F. Glover.  HEURISTICS FOR INTEGER PROGRAMMING USING SURROGATE CONSTRAINTS , 1977 .

[20]  Andrés L. Medaglia,et al.  Solution methods for the bi-objective (cost-coverage) unconstrained facility location problem with an illustrative example , 2006, Ann. Oper. Res..

[21]  Feng Chu,et al.  Competitive facility location and design with reactions of competitors already in the market , 2012, Eur. J. Oper. Res..

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

[23]  H. Edwin Romeijn,et al.  Designing two-echelon supply networks , 2007, Eur. J. Oper. Res..

[24]  George O. Wesolowsky,et al.  A Trajectory Approach to the Round-Trip Location Problem , 1982 .

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

[26]  Juan A. Díaz,et al.  A compact model and tight bounds for a combined location-routing problem , 2005, Comput. Oper. Res..

[27]  G. Cornuéjols,et al.  A comparison of heuristics and relaxations for the capacitated plant location problem , 1991 .

[28]  M. H. J. Webb,et al.  Cost Functions in the Location of Depots for Multiple-Delivery Journeys , 1968 .

[29]  Nicos Christofides,et al.  EXPECTED DISTANCES IN DISTRIBUTION PROBLEMS , 1969 .

[30]  Halit Üster,et al.  Meta-heuristic approaches with memory and evolution for a multi-product production/distribution system design problem , 2007, Eur. J. Oper. Res..