A computation procedure for the exact solution of location-allocation problems with rectangular distances

A method is presented to locate and allocate p new facilities in relation to n existing facilities. Each of the n existing facilities has a requirement flow which must be supplied by the new facilities. Rectangular distances are assumed to exist between all facilities. The algorithm proceeds in two stages. In the first stage a set of all possible optimal new facility locations is determined by a set reduction algorithm. The resultant problem is shown to be equivalent to finding the p-median of a weighted connected graph. In the second stage the optimal locations and allocations are obtained by using a technique for solving the p-median problem.

[1]  L. Cooper.  Location-Allocation Problems , 1963 .

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

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

[4]  Roger C. Vergin,et al.  An Algorithm and Computational Procedure for Locating Economic Facilities , 1967 .

[5]  A. J. Goldman.  Optimal Locations for Centers in a Network , 1969 .

[6]  A. J. Goldman,et al.  Letter to the Editor---A Localization Theorem for Optimal Facility Placement , 1970 .

[7]  Cabot A.Victor,et al.  A Network Flow Solution to a Rectilinear Distance Facility Location Problem , 1970 .

[8]  G. O. Wesolowsky,et al.  Location of facilities with rectangular distances among point and area destinations , 1971 .

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

[10]  G. O. Wesolowsky,et al.  Technical Note - The Optimal Location of New Facilities Using Rectangular Distances , 1971, Oper. Res..

[11]  G. O. Wesolowsky,et al.  A Nonlinear Approximation Method for Solving a Generalized Rectangular Distance Weber Problem , 1972 .

[12]  Leon Cooper,et al.  The Transportation-Location Problem , 1972, Oper. Res..

[13]  Richard M. Soland,et al.  Exact and approximate solutions to the multisource weber problem , 1972, Math. Program..

[14]  Pertti Järvinen,et al.  Technical Note - A Branch-and-Bound Algorithm for Seeking the P-Median , 1972, Oper. Res..

[15]  R. Love,et al.  Modelling Inter-city Road Distances by Mathematical Functions , 1972 .

[16]  A. J. Goldman.  Approximate Localization Theorems for Optimal Facility Placement , 1972 .

[17]  A. M. El-Shaieb,et al.  A New Algorithm for Locating Sources Among Destinations , 1973 .

[18]  Richard E. Wendell,et al.  Location Theory, Dominance, and Convexity , 1973, Oper. Res..

[19]  Robert F. Love,et al.  A Dual Decomposition Method for Minimizing Transportation Costs in Multifacility Location Problems , 1973 .

[20]  Robert F. Love,et al.  The Dual of a Hyperbolic Approximation to the Generalized Constrained Multi-Facility Location Problem with lp, Distances , 1974 .

[21]  James G. Morris.  A linear programming solution to the generalized rectangular distance weber problem , 1975 .

[22]  Robert F. Love,et al.  Technical Note - Solving Constrained Multi-Facility Location Problems Involving lp Distances Using Convex Programming , 1975, Oper. Res..