Research on Dynamic Location Problem Model and Algorithm of Distribution Centers

Article Preview

Abstract:

Considering the logistics system time-varying characteristic, this paper establishes a distribution center dynamic programming model. The model is using improved D&O rules and branch and bound algorithm to list each phase alternative distribution center scheme, then solved by dynamic programming method, to find the optimal scheme of the whole planning period. Through example and contrast, prove this calculation algorithm is feasible and better.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

470-476

Citation:

Online since:

December 2011

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2012 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] R. H. Ballou: Journal of Marketing Research Vol.5 (1968), pp.271-276.

Google Scholar

[2] A. J. Scott: Environment and Planning Vol.3 (1971), pp.73-82.

Google Scholar

[3] D. Erlenkotter: European Journal of Operational Research Vol.6 (1981), pp.133-143.

Google Scholar

[4] G. O. Wesolowsky: Management Science Vol.19 (1973), pp.1241-1248.

Google Scholar

[5] D. J. Sweeney and R. L. Tatham: Management Science Vol.22 (1976), pp.748-758.

Google Scholar

[6] B. M. Khumawala: Management Science Vol.18 (1972), pp.718-731.

Google Scholar

[7] C. H. Aikens: European Journal of Operational Research Vol.22 (1985), pp.263-279.

Google Scholar

[8] J. Krarup and P. M. Pruzan: European Journal of Operational Research Vol.12 (1983), pp.36-81.

Google Scholar

[9] C. Canel, B. M. Khumawala, J. Law and A. Loh: Computers and Operations Research Vol.28 (2001), pp.411-427.

DOI: 10.1016/s0305-0548(99)00126-4

Google Scholar

[10] B. M. Khumawala: Management Science Vol.18 (1972), pp.718-731.

Google Scholar

[11] G. M. Roodman and L. B. Schwarz: AIIE Transactions Vol.7 (1975), pp.177-184.

Google Scholar