Nothing Special   »   [go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

Single facility location and relocation problem with time dependent weights and discrete planning horizon

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

In this paper a single facility location problem with multiple relocation opportunities is investigated. The weight associated with each demand point is a known function of time. We consider either rectilinear, or squared Euclidean, or Euclidean distances. Relocations can take place at pre-determined times. The objective function is to minimize the total location and relocation costs. An algorithm which finds the optimal locations, relocation times and the total cost, for all three types of distance measurements and various weight functions, is developed. Locations are found using constant weights, and relocations times are the solution to a Dynamic Programming or Binary Integer Programming (BIP) model. The time horizon can be finite or infinite.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Andretta, G., & Mason, F. M. (1994). A perfect forward procedure for a single facility dynamic location/relocation problem. Operations Research Letters, 15, 81–83.

    Article  Google Scholar 

  • Ballou, R. H. (1968). Dynamic warehouse location analysis. Journal of Marketing Research, 5, 271–276.

    Article  Google Scholar 

  • Bastian, M., & Volkmer, M. (1992). A perfect forward procedure for a single facility dynamic location/relocation problem. Operations Research Letters, 12, 11–16.

    Article  Google Scholar 

  • Berman, O., & LeBlanc, B. (1984). Location-relocation of mobile facilities on a stochastic network. Transportation Science, 8, 315–330.

    Article  Google Scholar 

  • Campbell, J. F. (1990). Locating transportation terminals to serve an expanding demand. Transportation Research, 24B(3), 173–192.

    Google Scholar 

  • Chand, S. (1988). Decision/Forecast horizon results for a single facility dynamic location/relocation problem. Operations Research Letters, 7(5), 247–251.

    Article  Google Scholar 

  • Daskin, M. S., Hopp, W. J., & Medina, B. (1992). Forecast horizon and dynamic facility location planning. Annals of Operations Research, 40, 125–151.

    Article  Google Scholar 

  • Drezner, Z. (1995a). Dynamic facility location: the progressive p-median problem. Location Science, 3(1), 1–7.

    Article  Google Scholar 

  • Drezner, Z. (1995b). Facility location: a survey of applications and methods. New York: Springer.

    Google Scholar 

  • Drezner, Z. (1996). A note on acceleration the Weiszfeld procedure. Location Science, 3, 275–279.

    Article  Google Scholar 

  • Drezner, Z., & Wesolowsky, G. O. (1991). Facility location when demand is time dependent. Naval Research Logistics, 38, 763–771.

    Article  Google Scholar 

  • Drezner, Z., Klamroth, K., Schobel, A., & Wesolowsky, G. (2002). In Z. Drezner & Hamacher (Eds.), The Weber problem in facility location: applications and theory. Berlin: Springer.

    Google Scholar 

  • Erlenkotter, D. (1981). A comparative study of approaches to dynamic location problems. European Journal of Operational Research, 6, 133–143.

    Article  Google Scholar 

  • Francis, R. L., McGinnis, L. F., & White, J. A. (1992). Facility layout and location: an analytical approach (2nd edn.). Englewood Cliffs: Prentice Hall.

    Google Scholar 

  • Gunawardane, G. (1982). Dynamic version of set covering type public facility location problems. European Journal of Operational Research, 10, 190–195.

    Article  Google Scholar 

  • Hormozi, A. M., & Khumawala, B. M. (1996). An improved algorithm for solving a multi-period facility location problem. IIE Transactions, 28, 105–114.

    Article  Google Scholar 

  • Love, R. F., Morris, J. G., & Wesolowsky, G. O. (1988). Facilities location: models and methods. New York: North-Holland.

    Google Scholar 

  • Min, H. (1988). Dynamic expansion and relocation of capacitated public facilities: a multi-objective approach. Computers and Operations Research, 15(3), 243–252.

    Article  Google Scholar 

  • Mirchandani, P. B., & Francis, R. L. (1990). Discrete location theory. New York: Wiley.

    Google Scholar 

  • Morris, J. G. (1981). Convergence of the Weiszfeld algorithm for Weber problems using a generalized distance function. Operations Research, 26, 37–48.

    Article  Google Scholar 

  • Murthy, I. (1993). Solving the multiperiod assignment problem with start-up costs using dual ascent. Naval Research Logistics, 40, 325–344.

    Article  Google Scholar 

  • Ostresh Jr., L. M. (1981). On the convergence of a class of iterative methods for solving the Weber location problem. Operations Research, 26, 597–609.

    Article  Google Scholar 

  • Schilling, D. A. (1980). Dynamic modeling for public-sector facilities: a multi-criteria approach. Decision Science, 11, 714–724.

    Article  Google Scholar 

  • Scott, A. J. (1971). Dynamic location-allocation systems: some basic planning strategies. Environment and Planning, 3, 73–82.

    Article  Google Scholar 

  • Sheppard, E. S. (1974). A conceptual framework for dynamic location-allocation analysis. Environment and Planning A, 6, 547–564.

    Article  Google Scholar 

  • Sweeney, D. J., & Tatham, R. L. (1976). An improved long-run model for multiple warehouse location. Management Science, 22(7), 748–758.

    Article  Google Scholar 

  • Tapiero, C. S. (1971). Transportation location-allocation problems over time. Journal of Regional Science, 11(3), 377–384.

    Article  Google Scholar 

  • VanRoy, T. J., & Erlenkotter, D. (1982). A dual-based procedure for dynamic facility location. Management Science, 28(10), 1091–1105.

    Article  Google Scholar 

  • Weiszfeld, E. (1936). Sur le point pour lequel la somme des distances de n points donnes est minimum. Tohoku Mathematical Journal, 43, 355–386.

    Google Scholar 

  • Wesolowsky, G. O. (1973). Dynamic facility location. Management Science, 19(11), 1241–1248.

    Article  Google Scholar 

  • Wesolowsky, G. O., & Truscott, W. G. (1976). The multi-period location-allocation problem with relocation of facilities. Management Science, 22(1), 57–65.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Industrial Engineering, Amirkabir University of Technology, Tehran, Iran

    Reza Zanjirani Farahani

  2. Department of ISDS, College of Business and Economics, California State University, Fullerton, CA, USA

    Zvi Drezner

  3. Entrepreneurship Faculty, University of Tehran, Tehran, Iran

    Nasrin Asgari

Authors
  1. Reza Zanjirani Farahani
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zvi Drezner
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Nasrin Asgari
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Reza Zanjirani Farahani.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Farahani, R.Z., Drezner, Z. & Asgari, N. Single facility location and relocation problem with time dependent weights and discrete planning horizon. Ann Oper Res 167, 353–368 (2009). https://doi.org/10.1007/s10479-008-0338-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-008-0338-x

Keywords

Search

Navigation