Minimizing logistic costs in multistage supply chains

Luca Bertazzi and Maria Grazia Speranza

Naval Research Logistics (NRL), 1999, vol. 46, issue 4, 399-417

Abstract: We consider the problem in which a set of products has to be shipped from a common origin to a common destination through one or several intermediate nodes with the objective of minimizing the sum of inventory and transportation costs when a set of possible shipping frequencies is given on each link. From the theoretical point of view, the main issue is the computation of the inventory cost in the intermediate nodes. From the computational point of view, given that the simpler single link problem is known to be NP‐hard, we present four classes of heuristic algorithms. The first two classes are based on the decomposition of the sequence in links, the third class on the adaptation of the EOQ‐type solution known for the continuous case, and the fourth on the optimal solution of a simpler problem through dynamic programming techniques. Finally, we compare them on a set of randomly generated problem instances. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 399–417, 1999

Date: 1999
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
https://doi.org/10.1002/(SICI)1520-6750(199906)46:43.0.CO;2-9

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:wly:navres:v:46:y:1999:i:4:p:399-417

Access Statistics for this article

More articles in Naval Research Logistics (NRL) from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().