Inventory-Transportation Integrated Optimization Problem in Many-to-Many Distribution Network

Article Preview

Abstract:

In order to solve the Inventory-transportation Integrated Optimization problem (ITIO problem) in a distribution network consisting of many warehouses and many retailers, the Lagrange multiplier method, the scenario-based Dynamic Slope Scaling Procedure (DSSP) heuristics and the Lagrangian relaxation-based DSSP heuristics were applied to integrate the system of inventory control and transportation scheduling respectively and in proper sequence. The more efficient Lagrangian relaxation-based DSSP heuristics is found in solving the ITIO problem. And furthermore, the comparative experiments prove the heuristics can get the optimized results in less calculating time and the efficiency of this method is also proved in solving the ITIO problem in a many-to-many distribution network.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

1965-1969

Citation:

Online since:

May 2012

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2012 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] J.H. Hwang, M.C. Chung and D.S. Juang: Optimization and Engineering, Vol. 1-2 (2011) No.12, p.83.

Google Scholar

[2] A. F. Izmailov: Computational Mathematics and Mathematical Physics, Vol. 51 (2011) No.1, p.1.

Google Scholar

[3] K.W. Ahn and K.S. Chan: Statistics and Computing, Vol. 20 (2010) No.4, p.447.

Google Scholar

[4] S. Lawphongpanich: Journal of Global Optimization, Vol. 35 (2006) No.1, p.121.

Google Scholar

[5] E. Althaus and S. Canzar: Journal of Combinatorial Optimization, Vol. 16 (2008) No.2, p.127.

Google Scholar

[6] Y. Nesterov: Mathematical Programming, Vol. 120 (2009) No.1, p.221

Google Scholar