پیوندهای مفید
اخبار و اعلانات
آمار
| تعداد نشریات | 161 |
| تعداد شماره‌ها | 6,572 |
| تعداد مقالات | 71,031 |
| تعداد مشاهده مقاله | 125,500,853 |
| تعداد دریافت فایل اصل مقاله | 98,763,912 |
A Memetic Algorithm for Designing a Capacitated Hub Network under Demand Uncertainty and Disruption | ||
| Advances in Industrial Engineering | ||
| مقاله 10، دوره 48، شماره 1، تیر 2014، صفحه 109-123 اصل مقاله (592.23 K) | ||
| نوع مقاله: Research Paper | ||
| شناسه دیجیتال (DOI): 10.22059/jieng.2014.51154 | ||
| نویسندگان | ||
| E. Nikbakhsh؛ S. H. Zegordi* | ||
| چکیده | ||
| Hub location problems are among the extensions of classical location problems that have numerous applications in designing transportation, postal, and telecommunication networks. Despite the evident attention of researchers to these problems, there are few studies on designing hub networks under uncertainty and disruption. In this study, the capacitated single allocation hub location problem under demand uncertainty and disruption is investigated. First, a mathematical model based on budget of uncertainty concept is proposed, then a hybrid solution method based on genetic algorithm and variable neighborhood search is proposed. Computational experiments demonstrate the accuracy of the proposed solution method in solving the test instances. In addition, the results obtained from conducting Monte-Carlo simulation experiments to analyze the effects of uncertainty on the performance of different hub network configurations show the necessity of considering demand uncertainty and disruption while designing hub networks. | ||
| کلیدواژه‌ها | ||
| Hub location؛ uncertainty؛ Disruption؛ Robust optimization؛ Memetic algorithm؛ Variable neighborhood search | ||
|
آمار تعداد مشاهده مقاله: 2,166 تعداد دریافت فایل اصل مقاله: 2,133 |
||
سامانه مدیریت نشریات علمی. قدرت گرفته از سیناوب