Two effective metaheuristic algorithms for solving a stochastic optimization model of a multi-echelon supply chain

Production distribution network (PDN) planning problems in multi echelon status are commonly complex with dynamic relationships that cause several uncertainties in different parameters of the network. In this paper, we formulate a multi echelon PDN to deliver products to customers with uncertain dem...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Applied soft computing Jg. 76; S. 545 - 563
Hauptverfasser: Khalifehzadeh, Sasan, Fakhrzad, M.B., Zare Mehrjerdi, Yahia, Hosseini_Nasab, Hasan
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier B.V 01.03.2019
Schlagworte:
ISSN:1568-4946, 1872-9681
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Production distribution network (PDN) planning problems in multi echelon status are commonly complex with dynamic relationships that cause several uncertainties in different parameters of the network. In this paper, we formulate a multi echelon PDN to deliver products to customers with uncertain demand in the least time with uncertain delivery lead time. The proposed network is including multi supplier, producer, potential depot, retailer and inland and outland customer in multi time period horizon. A stochastic multi objective model with maximizing total profit of the system and minimizing total delivery lead time is designed. We apply chance constraints approach to cover the uncertainty of the model and introduce two heuristic methods named selective firefly algorithm (SFA) and ranking genetic algorithm (RGA) in order to solve several sized especially real world instances. Finally, the performance of two proposed algorithms is examined with solving several sized instances. The results indicate average improvement 6.12% and 8.93% with applying SFA and RGA, respectively. [Display omitted] •A multi echelon supply chain network under uncertain environment is proposed.•The customers’ demands are assumed stochastic with a known normal distribution.•Delivery lead time is assumed stochastic with a known normal distribution.•A MILP model is designed to maximize profit and minimize lead time of the network.•Two novel metaheuristic algorithms based on FA and GA (SFA and RGA) are proposed.
ISSN:1568-4946
1872-9681
DOI:10.1016/j.asoc.2018.12.018