A Dynamic Programming Algorithm for Facility Location and Allocation Academic Article uri icon

abstract

  • This article considers the problem of facility location-allocation. The problem is to allocate K facilities in M facility locations and assign N demands such that the total cost is minimized. The model is formulated as a mathematical programming problem and decomposed into the recursive equations of dynamic programming. A sample problem is presented and analyzed in detail in order to demonstrate an application of the model. The procedure was coded in Fortran IV and used to obtain the sample problem results. Taylor & Francis Group, LLC.

published proceedings

  • A I I E Transactions

author list (cited authors)

  • Curry, G. L., & Skeith, R. W.

citation count

  • 14

complete list of authors

  • Curry, Guy L||Skeith, Ronald W

publication date

  • June 1969