Heuristic Algorithm for the Safety Stock Placement Problem
Abstract
In this paper, we develop an iterative heuristic algorithm for the NP-hard optimization problem encountered when managing the stock under the Guaranteed Service Model in a multi-echelon supply chain to determine a good solution in a short time. Compared to the Baron solver that was restricted with a maximum time equal to 20000 seconds, we achieved on average more than 88% reduction in calculation time and about 0.3% cost reduction.
| Origin | Files produced by the author(s) |
|---|
