Location-Routing Problem

The aim of this chapter is to survey the state of the art in location-routing. The location-routing problem (LRP) is a research area within location analysis, with the distinguishing property of paying special attention to underlying issues of vehicle routing. Since the Vehicle-Routing Problem (VRP), which is a complex problem itself, is known as a basic component of LRPs, the main concepts of VRP are introduced in the first section. In the second section, the definition, applications and classifications of LRP are discussed. The next section is dedicated to the LRP models and introduces some basic mathematical models of this field. Solution techniques are presented in the fourth section. Finally, three case studies regarding applications of LRP in real world are briefly reviewed.

[1]  Thierry Kulcar,et al.  Optimizing solid waste collection in Brussels , 1996 .

[2]  Oded Berman,et al.  Probabilistic Sales-Delivery Man and Sales-Delivery Facility Location Problems on a Tree , 1995, Transp. Sci..

[3]  C. K. Y. Lin,et al.  A location-routing-loading problem for bill delivery services , 2002 .

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

[5]  Inmaculada Rodríguez Martín,et al.  A branch-and-cut algorithm for the plant-cycle location problem , 2004, J. Oper. Res. Soc..

[6]  Alain Billionnet,et al.  Designing radio-mobile access networks based on synchronous digital hierarchy rings , 2005, Comput. Oper. Res..

[7]  David Dery,et al.  Decision-making, problem-solving and organizational learning , 1983 .

[8]  G. Laporte,et al.  An exact algorithm for minimizing routing and operating costs in depot location , 1981 .

[9]  M. Wasner,et al.  An integrated multi-depot hub-location vehicle routing model for network planning of parcel service , 2004 .

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

[11]  Mikael Rönnqvist,et al.  A combined terminal location and ship routing problem , 2006, J. Oper. Res. Soc..

[12]  C. K. Y. Lin,et al.  Multi-objective metaheuristics for a location-routing problem with multiple use of vehicles on real data and simulated data , 2006, Eur. J. Oper. Res..

[13]  J. C. Higgins.  On the merits of simple models in distribution planning , 1972 .

[14]  Laura I. Burke,et al.  A two-phase tabu search approach to the location routing problem , 1999, Eur. J. Oper. Res..

[15]  Gilbert Laporte,et al.  Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems , 1988, Transp. Sci..

[16]  Rajan Batta,et al.  The Traveling Repairperson Home Base Location Problem , 1994, Transp. Sci..

[17]  W. Pierskalla,et al.  A Transportation Location-Allocation Model for Regional Blood Banking , 1979 .

[18]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[19]  Ángel Marín,et al.  Tactical design of rail freight networks. Part I: Exact and heuristic methods , 1996 .

[20]  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..

[21]  Thomas L. Magnanti,et al.  Combinatorial optimization and vehicle fleet planning: Perspectives and prospects , 1981, Networks.

[22]  Edwin von Böventer,et al.  THE RELATIONSHIP BETWEEN TRANSPORTATION COSTS AND LOCATION RENT IN TRANSPORTATION PROBLEMS , 1961 .

[23]  P. J. Pengilly,et al.  The Number and Location of Depots Required for Handling Products for Distribution to Retail Stores in South-East England , 1969 .

[24]  D. R. Fulkerson,et al.  MINIMIZING THE NUMBER OF CARRIERS TO MEET A FIXED SCHEDULE , 1954 .

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

[26]  Yupo Chan,et al.  A multiple-depot, multiple-vehicle, location-routing problem with stochastically processed demands , 2001, Comput. Oper. Res..

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

[28]  Zvi Drezner.  Fast Algorithms for the Round Trip Location Problem , 1982 .

[29]  Gilbert Laporte,et al.  Eulerian location problems , 1999 .

[30]  Éric D. Taillard,et al.  Solving real-life vehicle routing problems efficiently using tabu search , 1993, Ann. Oper. Res..

[31]  Mark S. Daskin,et al.  A warehouse location-routing problem , 1985 .

[32]  Oded Berman,et al.  Minmax p-Traveling Salesmen Location Problems on a Tree , 2002, Ann. Oper. Res..

[33]  Katta G. Murty,et al.  The U.S. Army National Guard's Mobile Training Simulators Location and Routing Problem , 1999, Oper. Res..

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

[35]  C. Watson-Gandy,et al.  Depot location with van salesmen — A practical approach , 1973 .

[36]  Nicos Christofides,et al.  An Algorithm for the Vehicle-dispatching Problem , 1969 .

[37]  Ludo Gelders,et al.  Plant location and vehicle routing in the Malaysian rubber smallholder sector: A case study , 1989 .

[38]  Gilbert Laporte,et al.  Optimal Routing under Capacity and Distance Restrictions , 1985, Oper. Res..

[39]  Oded Berman,et al.  Technical Note - Routing and Location-Routing p-Delivery Men Problems on a Path , 1994, Transp. Sci..

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

[41]  Fred W. Glover,et al.  A user's guide to tabu search , 1993, Ann. Oper. Res..

[42]  G. Laporte,et al.  Hamiltonian location problems , 1983 .

[43]  Thomas L. Magnanti,et al.  Implementing vehicle routing algorithms , 1977, Networks.

[44]  Arno Bruns,et al.  Restructuring of Swiss parcel delivery services , 2000, OR Spectr..

[45]  John Dinwoodie.  Network and discrete location: Models, algorithms and applications: Mark S. Daskin Wiley New York (1995) £58 ISBN 0 47101 897 , 1996 .

[46]  Youngho Lee,et al.  A Location-Routing Problem in Designing Optical Internet Access with WDM Systems , 2003, Photonic Network Communications.