Minimizing logistic costs in multistage supply chains

✍ Scribed by Luca Bertazzi; Maria Grazia Speranza

• Publisher: John Wiley and Sons
• Year: 1999
• Tongue: English
• Weight: 100 KB
• Volume: 46
• Category: Article
• ISSN: 0894-069X
• DOI: 10.1002/(sici)1520-6750(199906)46:4<399::aid-nav4>3.0.co;2-9

✦ Synopsis

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.