کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
10523850 | 957103 | 2005 | 16 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Near-optimal solutions to large-scale facility location problems
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
کنترل و بهینه سازی
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Near-optimal solutions to large-scale facility location problems Near-optimal solutions to large-scale facility location problems](/preview/png/10523850.png)
چکیده انگلیسی
We investigate the solution of large-scale instances of the capacitated and uncapacitated facility location problems. Let n be the number of customers and m the number of potential facility sites. For the uncapacitated case we solved instances of size mÃn=3000Ã3000; for the capacitated case the largest instances were 1000Ã1000. We use heuristics that produce a feasible integer solution and use a Lagrangian relaxation to obtain a lower bound on the optimal value. In particular, we present new heuristics whose gap from optimality was generally below 1%. The heuristics combine the volume algorithm and randomized rounding. For the uncapacitated facility location problem, our computational experiments show that our heuristic compares favorably against DUALOC.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Optimization - Volume 2, Issue 1, 30 March 2005, Pages 35-50
Journal: Discrete Optimization - Volume 2, Issue 1, 30 March 2005, Pages 35-50
نویسندگان
Francisco Barahona, Fabián A. Chudak,