Heuristic Algorithm for the Safety Stock Placement Problem - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2021

Heuristic Algorithm for the Safety Stock Placement Problem

Zied Jemai
Abderrahim Bendadou

Résumé

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.
Fichier principal
Vignette du fichier
520762_1_En_50_Chapter.pdf (389.81 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03558836 , version 1 (05-02-2022)

Licence

Paternité

Identifiants

Citer

Zied Jemai, Abderrahim Bendadou, Rim Kalai, Yacine Rekik. Heuristic Algorithm for the Safety Stock Placement Problem. IFIP International Conference on Advances in Production Management Systems (APMS), Sep 2021, Nantes, France. pp.465-473, ⟨10.1007/978-3-030-85914-5_50⟩. ⟨hal-03558836⟩
120 Consultations
4 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More