The Minimization of the Logistic Costs on Sequences of Links with Given Shipping Frequencies
- 225 Downloads
In this paper we consider a sequence of links in which a set of products has to be shipped from a common origin to a common destination through one or several intermediate nodes. Our aim is to determine periodic shipping strategies that minimize the sum of inventory and transportation costs when a set of shipping frequencies is given. Prom the theoretical point of view, the main question is to derive a formulation of the total inventory cost on the network. From the computational point of view, given that the simpler single link problem is known to be NP—hard, we present several heuristic algorithms based either on the decomposition of the sequence in links or on the dynamic programming techniques and compare them on a set of randomly generated problem instances.
KeywordsSequences of links Inventory and transportation costs Shipping frequencies Heuristic algorithms
Unable to display preview. Download preview PDF.
- Bertazzi, L./Speranza, M.G. (1996): Minimization of Logistics Costs on Sequences of Links. in: Proceedings of the 4th IFIP WG7.6 Working Conference, Noisy-le-Grand, May 28–30, 1996Google Scholar
- Bertazzi, L./Speranza, M.G./ Ukovieh, W. (1995): Exact and Heuristic Solutions for a Shipment Problem with Given Frequencies. Technical Report 101, Department of Quantitative Methods, University of Brescia (submitted)Google Scholar
- Bertsekas, D.P. (1995): Dynamic Programming and Optimal Control. (Athena Scientific) BelmontGoogle Scholar
- Muckstadt, J.A./Roundy, R.O. (1993): Analysis of Multistage Production Systems. in: Graves, S.C., Rinnooy Kan, A.H.G. and Zipkin, P.H. (eds.) Handbooks in Operations Research and Management Science, Vol. 4: Logistics of Production and Inventory, North-Holland, 59–131Google Scholar