|
|
International Journal of Engineering، جلد ۲۶، شماره ۶، صفحات ۶۰۵-۶۲۰
|
|
|
| عنوان فارسی |
|
|
| چکیده فارسی مقاله |
|
|
| کلیدواژه‌های فارسی مقاله |
|
|
| عنوان انگلیسی |
A Multi-objective Imperialist Competitive Algorithm for a Capacitated Single-allocation Hub Location Problem |
|
| چکیده انگلیسی مقاله |
In this paper, we present a novel multi-objective mathematical model for capacitated single allocation hub location problem. There are the vehicle capacity constraint and capacity restrictions amount of the incoming flow to the hub while the balancing requirements of incoming quantities of flow to the each hub is considered. Moreover, there is a set of available capacities for each potential hub, among which one can be chosen. The multiple objectives are to minimize total cost of the networks regarding minimizing maximum travel time between nodes. Due to NP-Hard property of our problem, this model is solved by a multi-objective imperialist competitive algorithm (MOICA) and finally, to prove its efficiency, the related results are compared with the results obtained by the well-known multi-objective evolutionary algorithm, called NSGA-II. The associated results confirm the efficiency and the effectiveness of our proposed MOICA to provide good solutions, especially for medium and large-sized problems. |
|
| کلیدواژه‌های انگلیسی مقاله |
|
|
| نویسندگان مقاله |
Y. Gholipour-Kanani |
Department of Industrial Engineering, Islamic Azad University
Reza Tavakkoli-Moghaddam |
Industrial Engineering, University of Tehran
Maedeh Shahramifar |
Department of Industrial Engineering, Mazandaran University of Science & Technology
|
|
| نشانی اینترنتی |
http://www.ije.ir/article_72131_0c129e7eddb95cba6ebb7045c4bb37e5.pdf |
| فایل مقاله |
اشکال در دسترسی به فایل - ./files/site1/rds_journals/409/article-409-2062902.pdf |
| کد مقاله (doi) |
|
| زبان مقاله منتشر شده |
en |
| موضوعات مقاله منتشر شده |
|
| نوع مقاله منتشر شده |
|
|
|
|
برگشت به:
صفحه اول پایگاه |
نسخه مرتبط |
نشریه مرتبط |
فهرست نشریات
|