کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
303635 | 512748 | 2012 | 10 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
The QQ-coverage multiple allocation hub covering problem with mandatory dispersion
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
سایر رشته های مهندسی
مهندسی عمران و سازه
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: The QQ-coverage multiple allocation hub covering problem with mandatory dispersion The QQ-coverage multiple allocation hub covering problem with mandatory dispersion](/preview/png/303635.png)
چکیده انگلیسی
This paper addresses the multiple allocation hub set-covering problem considering backup coverage and mandatory dispersion of hubs. In the context of this paper, it has been assumed that a flow is covered if there are at least QQ possible routes to satisfy its demand within a time bound. Moreover, there is a lower limit for the distance between hubs in order to provide a degree of dispersion in the solution. Mathematical formulation of this problem is given, which has O(n2)O(n2) variables and constraints. Computational experiments carried out on the well-known CAB dataset give useful insights concerning model behavior and its sensitivity to parameters.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Scientia Iranica - Volume 19, Issue 3, June 2012, Pages 902–911
Journal: Scientia Iranica - Volume 19, Issue 3, June 2012, Pages 902–911
نویسندگان
M.H. Fazel Zarandi, S. Davari, S.A. Haddad Sisakht,