A bi-objective hierarchical hub location model with facility failure

Message:
Article Type:
Research/Original Article (دارای رتبه معتبر)
Abstract:

In the most past hub location problem (HLP) studies, failure probability is limited to a constant value; while in reality, it depends on various factors including natural disasters such as floods and earthquakes, commodity flow, institutional elements such as strikes, and etc. This paper looks into the problem of hub network design through a new model. The problem is to maximize the network reliability and to minimize the total routing cost simultaneously. In order to provide a more realistic model, the hub’s failure probabilities were considered as a function of the hub’s incoming traffic. Reserve hub elements are also taken into account in the model with the aim of increasing network reliability. To solve the model, a non-dominated sorting genetic algorithm (NSGA-II) is presented. The parameters of the algorithm are tuned using Taguchi method. The proposed solution is then carried out in a case study where the results confirm the acceptable performance of the model and also sensitivity analysis is performed in order to describe the effects of critical parameters into objective functions.

Language:
English
Published:
Pages:
2009 to 2020
magiran.com/p2163224  
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یک‌ساله به مبلغ 1,390,000ريال می‌توانید 70 عنوان مطلب دانلود کنید!
اشتراک سازمانی
به کتابخانه دانشگاه یا محل کار خود پیشنهاد کنید تا اشتراک سازمانی این پایگاه را برای دسترسی نامحدود همه کاربران به متن مطالب تهیه نمایند!
توجه!
  • حق عضویت دریافتی صرف حمایت از نشریات عضو و نگهداری، تکمیل و توسعه مگیران می‌شود.
  • پرداخت حق اشتراک و دانلود مقالات اجازه بازنشر آن در سایر رسانه‌های چاپی و دیجیتال را به کاربر نمی‌دهد.
In order to view content subscription is required

Personal subscription
Subscribe magiran.com for 70 € euros via PayPal and download 70 articles during a year.
Organization subscription
Please contact us to subscribe your university or library for unlimited access!