Artikel
Benders decomposition with special purpose method for the sub problem in lot sizing problem under uncertain demand
We propose herein the application of Benders decomposition with stochastic linear programming instead of the mix integer linear programming (MILP) approach to solve a lot sizing problem under uncertain demand, particularly in the case of a large-scale problem involving a large number of simulated scenarios. In addition, a special purpose method is introduced to solve the sub problem of Benders decomposition and reduce the processing time. Our experiments show that Benders decomposition combined with the special purpose method (BCS) requires shorter processing times compared to the simple MILP approach in the case of large-scale problems. Furthermore, our BCS approach shows a linear relationship between the processing time and the number of scenarios, whereas the MILP approach shows a quadratic relationship between those variables, indicating that our approach is suitable in solving such problems.
- Sprache
-
Englisch
- Erschienen in
-
Journal: Operations Research Perspectives ; ISSN: 2214-7160 ; Volume: 6 ; Year: 2019 ; Pages: 1-9 ; Amsterdam: Elsevier
- Klassifikation
-
Wirtschaft
- Thema
-
Benders decomposition
Stochastic linear programming
Large-scale problem
Lot sizing problem
Uncertain demand
- Ereignis
-
Geistige Schöpfung
- (wer)
-
Witthayapraphakorn, Aphisak
Charnsethikul, Peerayuth
- Ereignis
-
Veröffentlichung
- (wer)
-
Elsevier
- (wo)
-
Amsterdam
- (wann)
-
2019
- DOI
-
doi:10.1016/j.orp.2018.100096
- Handle
- Letzte Aktualisierung
-
10.03.2025, 11:44 MEZ
Datenpartner
ZBW - Deutsche Zentralbibliothek für Wirtschaftswissenschaften - Leibniz-Informationszentrum Wirtschaft. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Objekttyp
- Artikel
Beteiligte
- Witthayapraphakorn, Aphisak
- Charnsethikul, Peerayuth
- Elsevier
Entstanden
- 2019
Ähnliche Objekte (12)
A robust model for the lot-sizing problem with uncertain demands
The capacitated lot sizing problem with linked lot sizes
Cyclic lot-sizing problems with sequencing costs
Parameter controlled instance generation for lot sizing problems
Comparison of different approaches to multistage lot sizing with uncertain demand
Economic lot-sizing problem with remanufacturing option: complexity and algorithms
Improved lower bounds for the proportional lot sizing and scheduling problem
Novel variants and applications of the single-item lot-sizing problem
The economic lot-sizing problem with remanufacturing: Analysis and an improved algorithm
A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem
Automated generation of heuristic methods for the multi-level capacitated lot-sizing problem
A fix-and-optimize approach for the multi-level capacitated lot sizing problem
A robust model for the lot-sizing problem with uncertain demands
The capacitated lot sizing problem with linked lot sizes
Cyclic lot-sizing problems with sequencing costs
Parameter controlled instance generation for lot sizing problems
Comparison of different approaches to multistage lot sizing with uncertain demand
Economic lot-sizing problem with remanufacturing option: complexity and algorithms
Improved lower bounds for the proportional lot sizing and scheduling problem
Novel variants and applications of the single-item lot-sizing problem
The economic lot-sizing problem with remanufacturing: Analysis and an improved algorithm
A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem
Automated generation of heuristic methods for the multi-level capacitated lot-sizing problem
A fix-and-optimize approach for the multi-level capacitated lot sizing problem
A robust model for the lot-sizing problem with uncertain demands
The capacitated lot sizing problem with linked lot sizes
Cyclic lot-sizing problems with sequencing costs
Parameter controlled instance generation for lot sizing problems
Comparison of different approaches to multistage lot sizing with uncertain demand
Economic lot-sizing problem with remanufacturing option: complexity and algorithms
Improved lower bounds for the proportional lot sizing and scheduling problem
Novel variants and applications of the single-item lot-sizing problem
The economic lot-sizing problem with remanufacturing: Analysis and an improved algorithm
A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem
Automated generation of heuristic methods for the multi-level capacitated lot-sizing problem