Study on Capacity Expansion Model and Arithmetic of Transportation Network with Distribution Centers

Article Preview

Abstract:

We consider a type of transportation problem with distribution centers. Solving this question by using auxiliary network: every distribution center in the transportation network is split into two nodes which are linked to form new arcs in the new network, enduing every arc with parameter vector, and turning this transportation problem into minimum cost flow problem. Basing on this point, the capacity expansion problem of the distribution centers and the paths in the transportation network are also considered in the article.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

2288-2292

Citation:

Online since:

October 2011

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2012 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] F.L. Hitchcock: Journal of Mathematical Physics Vol. 20(1941), p.224–230.

Google Scholar

[2] G.B. Dantzig: Application of the simplex method to a transportation problem, in activity of production and application(John Wiley & Sons Inc, New york 1951).

Google Scholar

[3] T.C. Koopmans: Econometrica Vol. 17(1949), p.3–4.

Google Scholar

[4] A. Charnes, and W.W. Cooper: Management Science Vol. 1(1954), p.49–69.

Google Scholar

[5] H. Arsham, and A.B. Khan: Journal of Operation Research Society Vol. 40(1989), p.581–590.

Google Scholar

[6] J.B. Orlin, S.A. Plotkin, and E. Tardos: Mathematical Programming Vol. 60(1993), p.255–276.

Google Scholar