2017
DOI: 10.3390/logistics1020011
|View full text |Cite
|
Sign up to set email alerts
|

Accelerated Benders’ Decomposition for Integrated Forward/Reverse Logistics Network Design under Uncertainty

Abstract: Abstract:In this paper, a two-stage stochastic programming modelling is proposed, to design a multi-period, multistage, and single-commodity integrated forward/reverse logistics network design problem under uncertainty. The problem involved both strategic and tactical decision levels. The first stage dealt with strategic decisions, which are the number, capacity, and location of forward and reverse facilities. In the second stage, tactical decisions, such as base stock level as an inventory policy, were determ… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
4
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(4 citation statements)
references
References 70 publications
(63 reference statements)
0
4
0
Order By: Relevance
“…The model minimizes the total expected costs. Vahdat and Vahdatzad [30] utilized two-stage stochastic programming to design a multi-period multistage integrated forward/reverse logistics network under uncertainty. They developed Benders' decomposition to solve the problem.…”
Section: Stochastic Reverse Logistics Network Designmentioning
confidence: 99%
See 1 more Smart Citation
“…The model minimizes the total expected costs. Vahdat and Vahdatzad [30] utilized two-stage stochastic programming to design a multi-period multistage integrated forward/reverse logistics network under uncertainty. They developed Benders' decomposition to solve the problem.…”
Section: Stochastic Reverse Logistics Network Designmentioning
confidence: 99%
“…A numerical example was used to analyze the performances of the risk-averse twostage stochastic programming models. 1 MILP Metaheuristics Min and Ko [16] 2 MINLP Metaheuristics Lee et al [18] 1 MILP Metaheuristics Lee et al [19] 1 MILP Metaheuristics Lee et al [20] 2 MINLP GAMS Ko and Evans [5] 2 MINLP Metaheuristics Ghafarimoghadam et al [21] 3 RO GAMS Ayvaz et al [22] 5 TSSP CPLEX Trochu et al [23] 5 TSSP -Yu and Solvang [24] 5 TSSP Lingo Kara and Onut [4] 5 TSSP GAMS Fonseca et al [25] 5 TSSP CPLEX Yu and Solvang [26] 5 TSSP Lingo Roudbari et al [27] 5 TSSP Metaheuristics Fattahi and Govindan [28] 5 TSSP Metaheuristics Pishvaee et al [29] 5 TSSP Lingo Vahdat and Vahdatzad [30] 5 TSSP Exact Algorithm Sugimura and Murakami [31] 1 MILP Linear Programming Kit Govindan and Gholizadeh [32] 4 SBRO Metaheuristics Ghomi-Avili et al [33] 5 TSSP GAMS Yavari and Zaker [34] 5 TSSP -Yavari and Zaker [35] 5 TSSP -Hatefi and Jolai [36] 4 SBRO GAMS Torabi et al [37] 4 SBRO GAMS…”
mentioning
confidence: 99%
“…They utilized over 800 papers between 1994 and 2017 and performed a detailed analysis of ECLO with an emphasis on fuzzy application [45]. Vahdat et al (2017) provided a two-stage stochastic programming modeling to design a multi-period, multistage, and single-commodity CLSC network under uncertainty [46]. Parakash et al (2018) proposed a CLSC network under risks and demand uncertainty [47].…”
Section: Literature Reviewmentioning
confidence: 99%
“…The value of parameters in scenarios could be generated using Eq. (4.73) and (4.74)(Vahdat and Vahdatzad, 2017):105…”
mentioning
confidence: 99%