کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
6892571 | 1445451 | 2018 | 35 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
An efficient matheuristic for the robust multiple allocation p-hub median problem under polyhedral demand uncertainty
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
This paper addresses the robust multiple allocation p-hub median problem under polyhedral demand uncertainty. Three variants of polyhedral uncertainty models are used in the problem, namely the hose, the hybrid, and the budget uncertainty models. The problems are formulated as linear mixed integer programming problems and a Tabu Search (TS) based matheuristic approach is proposed to solve the three variants of the problem. Extensive computational experiments are conducted based on three well-known data sets in the hub location literature and the results show the capability of the proposed solution algorithm to obtain the optimal solutions in short computational times.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Operations Research - Volume 97, September 2018, Pages 31-47
Journal: Computers & Operations Research - Volume 97, September 2018, Pages 31-47
نویسندگان
Nader Ghaffarinasab,