Facility location when demand is time dependent

In this article we investigate the problem of locating a facility among a given set of demand points when the weights associated with each demand point change in time in a known way. It is assumed that the location of the facility can be changed one or more times during the time horizon. We need to find the time “breaks” when the location of the facility is to be changed, and the location of the facility during each time segment between breaks. We investigate the minisum Weber problem and also minimax facility location. For the former we show how to calculate the objective function for given time breaks and optimally solve the rectilinear distance problem with one time break and linear change of weights over time. Location of multiple time breaks is also discussed. For minimax location problems we devise two algorithms that solve the problem optimally for any number of time breaks and any distance metric. These algorithms are also applicable to network location problems.

[1]  Anthony Ralston,et al.  Mathematical Methods for Digital Computers , 1960 .

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

[3]  A. Pritsker,et al.  Locating New Facilities with Respect to Existing Facilities , 1970 .

[4]  G. Handler.  Minimax Location of a Facility in an Undirected Tree Graph , 1973 .

[5]  G. O. Wesolowsky,et al.  The Multiperiod Location-Allocation Problem with Relocation of Facilities , 1975 .

[6]  D. Hearn,et al.  Minimax Multifacility Location with Euclidean Distances , 1976 .

[7]  Donald Erlenkotter,et al.  A Dual-Based Procedure for Uncapacitated Facility Location , 1978, Oper. Res..

[8]  Zvi Drezner,et al.  A Trajectory Method for the Optimization of the Multi-Facility Location Problem With lp Distances , 1978 .

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

[10]  Zvi Drezner,et al.  Single Facility lp-Distance Minimax Location , 1980, SIAM J. Algebraic Discret. Methods.

[11]  Donald W. Hearn,et al.  Efficient Algorithms for the (Weighted) Minimum Circle Problem , 1982, Oper. Res..

[12]  Zvi Drezner,et al.  The p-Centre Problem—Heuristic and Optimal Algorithms , 1984 .

[13]  Zvi Drezner,et al.  The Planar Two-Center and Two-Median Problems , 1984, Transp. Sci..

[14]  Zvi Drezner,et al.  Layout of facilities with some fixed points , 1985, Comput. Oper. Res..

[15]  Martin E. Dyer,et al.  On a Multidimensional Search Technique and its Application to the Euclidean One-Centre Problem , 1986, SIAM J. Comput..

[16]  Z. Drezner.  On the rectangular p‐center problem , 1987 .

[17]  M. Shirosaki.  Another proof of the defect relation for moving targets , 1991 .

[18]  Z. Drezner.  The weighted minimax location problem with set-up costs and extensions , 1991 .