An Improved Long-Run Model for Multiple Warehouse Location

Dennis J. Sweeney and Ronad L. Tatham
Additional contact information
Dennis J. Sweeney: University of Cincinnati
Ronad L. Tatham: University of Cincinnati

Management Science, 1976, vol. 22, issue 7, 748-758

Abstract: This paper proposes an improved model for solving the long-run multiple warehouse location problem. The approach used provides a synthesis of a mixed integer programming formulation for the single-period warehouse location model with a dynamic programming procedure for finding the optimal sequence of configurations over multiple periods. We show that only the R t , best rank order solutions in any single period need be considered as candidates for inclusion in the optimal multi-period solution. Thus the computational feasibility of the dynamic programming procedure is enhanced by restricting the state space to these R t best solutions. Computational results on the ranking procedure are presented, and a problem involving two plants, five warehouses, 15 customer zones, and five periods is solved to illustrate the application of the method.

Date: 1976
References: Add references at CitEc
Citations: View citations in EconPapers (12)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.22.7.748 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:22:y:1976:i:7:p:748-758

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().