A Dynamic Programming Algorithm for Facility Location and Allocation

1 June 1969

journal article
research article
Published by Taylor & Francis in A I I E Transactions

Vol. 1 (2) , 133-138
https://doi.org/10.1080/05695556908974424

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.

Keywords

This publication has 3 references indexed in Scilit:

A Branch-Bound Algorithm for Plant Location
Operations Research, 1966
Warehouse Location Under Continuous Economies of Scale
Management Science, 1966
Applied Dynamic Programming
Published by Walter de Gruyter GmbH ,1962