Abstract
The computational resolution of multi-echelon safety stock placement problems has attracted ample attention in recent years. Practitioners can obtain good solutions for large supply networks with general structure using the guaranteed service model. The mainstream assumption in this model is that a stock point quotes identical service times to its successors. In business, it is common to assign customers to different customer- and service classes, as it can yield significant cost improvements. Nevertheless, differentiated service times have rarely been considered in computational methods of safety stock placement. We relax the assumption of identical service times in the guaranteed service approach and allow stock points to prioritize between their successors. This increases the complexity of the problem considerably, so that meta-heuristics become the methods of choice. Meta-heuristics need a mapping between safety stock levels in the supply network (from which they compute the holding cost) and an internal representation of stocking decisions (from which they generate new solutions). The design of a representation is non-trivial because of complex interactions between stocking decisions and stock levels. We propose a representation for the safety stock allocation problem with differentiated service times that can be used in general-acyclic supply networks. We apply a local search, a simple genetic algorithm and a problem-adjusted simulated annealing to 38 general-acyclic real-world instances. Results suggest that service time differentiation indeed decreases total holding cost in the network. Simulated annealing outperforms the other meta-heuristics within the set of tested methods with respect to speed and solution quality.
Similar content being viewed by others
References
Axsäter, S. (2003). Supply chain operations: Serial and distribution inventory systems. In A. G. de Kok & S. C. Graves (Eds.), Supply chain management: Design, coordination and operation. Handbooks in operations research and management science (pp. 525–559). North-Holland, Amsterdam: Elsevier.
Eruguz, A. S., Jemai, Z., Sahin, E., & Dallery, Y. (2009). Optimising reorder intervals and order-up-to levels in guaranteed service supply chains. International Journal of Production Research, 52, 149–164.
Funaki, K. (2010). Strategic safety stock placement in supply chain design with due-date based demand. International Journal of Production Economics, 153, 4–13.
Goldberg, D. E. (1989). Genetic algorithms in search, optimization, and machine learning. Reading, Massachusetts: Addison-Wesley.
Grahl, J. (2008). Estimation of distribution algorithms in logistics: Analysis, Design, and Application. Doctoral Dissertation, University of Mannheim.
Graves, S. C., & Willems, S. P. (2000). Optimizing strategic safety stock placement in supply chains. Manufacturing and Service Operations Management, 2, 68–83.
Graves, S. C., & Willems, S. P. (2003). Supply chain design: Safety stock placement and supply chain configuration. In A. G. de Kok & S. C. Graves (Eds.), Supply chain management: Design, coordination and operation. Handbooks in operations research and management science (pp. 95–132). North-Holland, Amsterdam: Elsevier.
Humair, S., & Willems, S. P. (2006). Optimizing strategic safety stock placement in supply chains with clusters of commonality. Operations Research, 54, 725–742.
Humair, S., & Willems, S. P. (2011). Optimizing strategic safety stock placement in general acyclic networks. Operations Research, 59, 781–787.
Humair, S., Ruark, J., Tomlin, B., & Willems, S. P. (2013). Incorporating stochastic leadtimes into the guaranteed service model of safety stock optimization. Interfaces, 43(5), 421–434.
Inderfurth, K. (1992). Mehrstufige sicherheitsbestandsplanung mit dynamischer programmierung. OR Spektrum, 14, 19–32.
Inderfurth, K., & Minner, S. (1998). Safety stocks in multi-stage inventory systems under different service measures. European Journal of Operational Research, 106, 57–73.
Johnson, D. S., Aragon, C. R., McGoech, L. A., & Schevon, C. (1989). Optimization by simulated annealing: An experimental evaluation; Part I, graph partitioning. Operations Research, 37, 865–892.
Johnson, D. S., Aragon, C. R., McGoech, L. A., & Schevon, C. (1991). Optimization by simulated annealing: An experimental evaluation; Part II, graph coloring and number partitioning. Operations Research, 39, 378–406.
Kirkpatrick, S., Gelatt, C. D., & Vecci, M. P. (1983). Optimization by simulated annealing. Science, 220, 671–680.
Klosterhalfen, S. T., Dittmar, D., & Minner, S. (2013). An integrated guaranteed- and stochastic-service approach to inventory optimization in supply chains. European Journal of Operational Research, 231, 109–119.
Klosterhalfen, S. T., Minner, S., Willems, S. P. (2014). Strategy inventory placement in assembly systems with dual sourcing. Manufacturing and Service Operations Management.
Lesnaia, E. (2004). Optimizing safety stock placement in general supply chains. Ph.D. thesis, Massachusetts Institute of Technology.
Magnanti, T. L., Shen, Z.-J. M., Shu, J., Simchi-Levi, D., & Teo, C.-P. (2006). Inventory placement in acyclic supply chain networks. Operations Research Letters, 34, 228–238.
Minner, S. (1997). Dynamic programming algorithms for multi-stage safety stock optimization. OR Spektrum, 19, 261–271.
Minner, S. (2000). Strategic safety stocks in supply chains. Berlin, Heidelberg, New York: Springer.
Li, P., Chen, H., & Che, A. (2013). Optimal batch ordering policies for assembly systems with guaranteed service. International Journal of Production Research, 51, 6275–6293.
Li, H., & Jiang, D. (2012). New model and heuristics for safety stock placement in general acyclic supply chain networks. Computers and Operations Research, 39, 1333–1344.
Moncayo-Martínez, L. A., & Zhang, D. Z. (2013). Optimising safety stock placement and lead time in an assembly supply chain using bi-objective MAX-MIN ant system. International Journal of Production Economics, 141, 18–28.
Rechenberg, I. (1973). Evolutionsstrategie: Optimierung technischer systeme nach prinzipien der biologischen evolution. Stuttgart: Frommann-Holzboog.
Rothlauf, F. (2006). Representations for genetic and evolutionary algorithms (2nd ed.). Heidelberg, New York: Studies in Fuzziness and Soft Computing, Springer.
Shu, J., & Karimi, I. A. (2009). Efficient heuristics for inventory placement in acyclic networks. Computers and Operations Research, 36, 2899–2904.
Willems, S. P. (2008). Real-world multi-echelon supply chains used for inventory optimization. Manufacturing and Service Operations Management, 10, 19–23.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Grahl, J., Minner, S. & Dittmar, D. Meta-heuristics for placing strategic safety stock in multi-echelon inventory with differentiated service times. Ann Oper Res 242, 489–504 (2016). https://doi.org/10.1007/s10479-014-1635-1
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-014-1635-1