AN INTEGRATED MODEL OF FACILITY LOCATION AND TRANSPORTATION NETWORK DESIGN

Abstract Network location models have been used extensively for siting public and private facilities. In this paper, we investigate a model that simultaneously optimizes facility locations and the design of the underlying transportation network. Motivated by the simple observation that changing the network topology is often more cost-effective than adding facilities to improve service levels, the model has a number of applications in regional planning, distribution, energy management, and other areas. The model generalizes the classical simple plant location problem. We show how the model can be solved effectively. We then use the model to analyze two potential transportation planning scenarios. The fundamental question of resource allocation between facilities and links is investigated, and a detailed sensitivity analysis provides insight into the model's usefulness for aiding budgeting and planning decisions. We conclude by identifying promising research directions.

[1]  Warren B. Powell,et al.  Interactive Optimization Improves Service and Performance for Yellow Freight System , 1992 .

[2]  Warren B. Powell,et al.  OR Practice - Design and Implementation of an Interactive Optimization System for Network Design in the Motor Carrier Industry , 1989, Oper. Res..

[3]  J. G. Klincewicz,et al.  HUB LOCATION IN BACKBONE/TRIBUTARY NETWORK DESIGN: A REVIEW , 1998 .

[4]  Michael J. Todd,et al.  An implementation of the simplex method for linear programming problems with variable upper bounds , 1982, Math. Program..

[5]  David Simchi-Levi,et al.  A Heuristic Algorithm for the Traveling Salesman Location Problem on Networks , 1988, Oper. Res..

[6]  Bruce L. Golden,et al.  VEHICLE ROUTING: METHODS AND STUDIES , 1988 .

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

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

[9]  Bhaba R. Sarker,et al.  Discrete location theory , 1991 .

[10]  N. Hingorani,et al.  HIGH-POWER ELECTRONICS , 1993 .

[11]  G. Rushton Use of Location-Allocation Models for Improving the Geographical Accessibility of Rural Services in Developing Countries , 1984 .

[12]  M. John Hodgson,et al.  A network location-allocation model trading off flow capturing andp-median objectives , 1992, Ann. Oper. Res..

[13]  Dominique Peeters,et al.  The Effect of Spatial Structure on p-Median Results , 1995, Transp. Sci..

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

[15]  Gilbert Laporte,et al.  Location routing problems , 1987 .

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

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

[18]  Thomas L. Magnanti,et al.  A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design , 1989, Oper. Res..

[19]  Mark S. Daskin,et al.  LOCATION, DISPATCHING AND ROUTING MODELS FOR EMERGENCY SERVICES WITH STOCHASTIC TRAVEL TIMES , 1984 .

[20]  Oded Berman,et al.  Improving the location of minisum facilities through network modification , 1993, Ann. Oper. Res..

[21]  Thomas L. Magnanti,et al.  Network Design and Transportation Planning: Models and Algorithms , 1984, Transp. Sci..

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

[23]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

[24]  Avijit Ghosh,et al.  Spatial analysis and location-allocation models , 1987 .

[25]  Leon F. McGinnis,et al.  Facility Layout and Location: An Analytical Approach , 1991 .

[26]  Michel Gendreau,et al.  The Covering Tour Problem , 1997, Oper. Res..

[27]  Mark S. Daskin,et al.  Capacitated facility location/network design problems , 2001, Eur. J. Oper. Res..

[28]  Gilbert Laporte,et al.  Generalized travelling salesman problem through n sets of nodes: the asymmetrical case , 1987, Discret. Appl. Math..

[29]  Gilbert Laporte,et al.  The Plant Location Problem: New Models and Research Prospects , 1996, Oper. Res..

[30]  J. Current,et al.  The median tour and maximal covering tour problems: Formulations and heuristics , 1994 .

[31]  Alfred A. Kuehn,et al.  A Heuristic Program for Locating Warehouses , 1963 .