کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
473862 | 698818 | 2010 | 7 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A local branching heuristic for the capacitated fixed-charge network design problem
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: A local branching heuristic for the capacitated fixed-charge network design problem A local branching heuristic for the capacitated fixed-charge network design problem](/preview/png/473862.png)
چکیده انگلیسی
We describe in this article a new heuristic approach for the capacitated fixed-charge network design problem. This is a well known NPNP-hard problem that has been extensively studied. We propose to use local branching to tackle it. Local branching is a novel metaheuristic technique presented by Fischetti and Lodi [Local branching. Mathematical Programming Series B 2003;98:23–47] that utilizes a general MIP solver to explore neighborhoods. Our implementation is tested on a large set of benchmark instances. The results show that the method outperforms the best heuristic approaches found in the literature.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Operations Research - Volume 37, Issue 3, March 2010, Pages 575–581
Journal: Computers & Operations Research - Volume 37, Issue 3, March 2010, Pages 575–581
نویسندگان
Inmaculada Rodríguez-Martín, Juan José Salazar-González,