کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4959733 | 1445958 | 2017 | 17 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
The Benders decomposition algorithm: A literature review
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: The Benders decomposition algorithm: A literature review The Benders decomposition algorithm: A literature review](/preview/png/4959733.png)
چکیده انگلیسی
The Benders decomposition algorithm has been successfully applied to a wide range of difficult optimization problems. This paper presents a state-of-the-art survey of this algorithm, emphasizing its use in combinatorial optimization. We discuss the classical algorithm, the impact of the problem formulation on its convergence, and the relationship to other decomposition methods. We introduce a taxonomy of algorithmic enhancements and acceleration strategies based on the main components of the algorithm. The taxonomy provides the framework to synthesize the literature, and to identify shortcomings, trends and potential research directions. We also discuss the use of the Benders Decomposition to develop efficient (meta-)heuristics, describe the limitations of the classical algorithm, and present extensions enabling its application to a broader range of problems.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 259, Issue 3, 16 June 2017, Pages 801-817
Journal: European Journal of Operational Research - Volume 259, Issue 3, 16 June 2017, Pages 801-817
نویسندگان
Ragheb Rahmaniani, Teodor Gabriel Crainic, Michel Gendreau, Walter Rei,