2016
DOI: 10.1016/j.ejor.2015.08.028
|View full text |Cite
|
Sign up to set email alerts
|

Hybrid robust and stochastic optimization for closed-loop supply chain network design using accelerated Benders decomposition

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
52
0
2

Year Published

2016
2016
2022
2022

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 226 publications
(56 citation statements)
references
References 54 publications
0
52
0
2
Order By: Relevance
“…Despite popularity of the above three leading paradigms for optimization under uncertainty, these approaches have their own limitations and specific application scopes. To this end, research efforts have been made on "hybrid" methods that leverage the synergy of different optimization approaches to inherit their corresponding strengths and complement respective weaknesses [107][108][109][110][111][112]. For instance, stochastic programming was integrated with robust optimization for supply chain design and operation under multi-scale uncertainties [50].…”
Section: Robust Optimizationmentioning
confidence: 99%
“…Despite popularity of the above three leading paradigms for optimization under uncertainty, these approaches have their own limitations and specific application scopes. To this end, research efforts have been made on "hybrid" methods that leverage the synergy of different optimization approaches to inherit their corresponding strengths and complement respective weaknesses [107][108][109][110][111][112]. For instance, stochastic programming was integrated with robust optimization for supply chain design and operation under multi-scale uncertainties [50].…”
Section: Robust Optimizationmentioning
confidence: 99%
“…The optimization part selects a suitable solution based on the output of the evaluation part and generates a new candidate solution. The optimization part is usually according to the solution techniques, which include the branch-and-cut [24,25], branches-and-bound [25], and Benders' decomposition [14,26] in the standard mathematical optimization techniques of MILP and simulated annealing (SA) algorithm [20,27], genetic algorithm [18,28], and swarm optimization algorithm [29] from the heuristic methods. As the RLN design problem belongs to a class of combinatorial optimization problems that require computational resources at an exponentially growing rate when the number of decision variables increases, hence, heuristic methods are usually adopted when the number of decision variables is large [29][30][31].…”
Section: Introductionmentioning
confidence: 99%
“…Wang et al [22] used prediction sets to solve an expansion planning problem for waste-to-energy (WtE) systems facing future waste supply uncertainty. Keyvanshokooh et al [23] proposed a novel hybrid robust-stochastic programing (HRSP) approach to simultaneously model two different types of uncertainties by using stochastic scenarios for the transportation costs and polyhedral uncertainty sets for the demand and returns. However, the DC and the CC were separate and the collection disposal rate was a certain variable.…”
Section: Introductionmentioning
confidence: 99%
“…Uncertainties exist in both forward and reverse supply chains. However, the uncertainties in the reverse flow are higher than in the forward supply chain [7,24,25] as returned product quantity is generally seen as uncertain [23,26]. Subjective uncertainties such as the decision maker's choices and environmental coefficients can be dealt with using fuzziness, while objective uncertainties such as unit transportation costs, product prices, and the quantity of unusable products can be dealt with using randomness.…”
Section: Introductionmentioning
confidence: 99%