کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
475325 | 699286 | 2009 | 11 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A general algorithm for solving two-stage stochastic mixed 0–1 first-stage problems
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
We present an algorithmic approach for solving large-scale two-stage stochastic problems having mixed 0–1 first stage variables. The constraints in the first stage of the deterministic equivalent model have 0–1 variables and continuous variables, while the constraints in the second stage have only continuous. The approach uses the twin node family concept within the algorithmic framework, the so-called branch-and-fix coordination, in order to satisfy the nonanticipativity constraints. At the same time we consider a scenario cluster Benders decomposition scheme for solving large-scale LP submodels given at each TNF integer set. Some computational results are presented to demonstrate the efficiency of the proposed approach.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Operations Research - Volume 36, Issue 9, September 2009, Pages 2590–2600
Journal: Computers & Operations Research - Volume 36, Issue 9, September 2009, Pages 2590–2600
نویسندگان
L.F. Escudero, M.A. Garín, M. Merino, G. Pérez,