|
|
International Journal of Engineering، جلد ۲۹، شماره ۶، صفحات ۷۹۷-۸۰۸
|
|
|
| عنوان فارسی |
|
|
| چکیده فارسی مقاله |
|
|
| کلیدواژه‌های فارسی مقاله |
|
|
| عنوان انگلیسی |
Capacitated Single Allocation P-Hub Covering Problem in Multi-modal Network Using Tabu Search |
|
| چکیده انگلیسی مقاله |
The goals of hub location problems are finding the location of hub facilities and determining the allocation of non-hub nodes to these located hubs. In this work, we discuss the multi-modal single allocation capacitated p-hub covering problem over fully interconnected hub networks. Therefore, we provide a formulation to this end. The purpose of our model is to find the location of hubs and the hub links between them at a selected combination of modes for each origin-destination. Furthermore, it determines the allocation of non-hub nodes to the located hubs at the best mode for each allocation such that the travel time between any origin–destination pair is not greater than a given time bound. In addition, the capacity of hub nodes is considered. Six valid inequalities are presented to tight the linear programming lower bound. We present a heuristic based on tabu search algorithm and test the performance of it on the Australian Post (AP) data set. |
|
| کلیدواژه‌های انگلیسی مقاله |
|
|
| نویسندگان مقاله |
Stefan Nickel |
Institute for Operations Research, Karlsruhe Institute of Technology (KIT),
Hossein Karimi |
Industrial Engineering, University of Bojnord
Mahdi Bashiri |
Industrial Engineering, Shahed University
|
|
| نشانی اینترنتی |
http://www.ije.ir/article_72737_c52d588067eaf95413ee40432476237b.pdf |
| فایل مقاله |
اشکال در دسترسی به فایل - ./files/site1/rds_journals/409/article-409-2062297.pdf |
| کد مقاله (doi) |
|
| زبان مقاله منتشر شده |
en |
| موضوعات مقاله منتشر شده |
|
| نوع مقاله منتشر شده |
|
|
|
|
برگشت به:
صفحه اول پایگاه |
نسخه مرتبط |
نشریه مرتبط |
فهرست نشریات
|