A Multi-objective Imperialist Competitive Algorithm for a Capacitated Singleallocation Hub Location Problem
محل انتشار: ماهنامه بین المللی مهندسی، دوره: 26، شماره: 6
سال انتشار: 1392
نوع سند: مقاله ژورنالی
زبان: انگلیسی
مشاهده: 963
فایل این مقاله در 16 صفحه با فرمت PDF قابل دریافت می باشد
- صدور گواهی نمایه سازی
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
JR_IJE-26-6_009
تاریخ نمایه سازی: 17 خرداد 1393
چکیده مقاله:
This paper presents a novel multi-objective mathematical model for a capacitated single-allocation hub location problem. There is a vehicle capacity constraint considered in this model. Additionally, ourmodel balances the amount of the incoming flow to the hubs. Moreover, there is a set of available capacities for each potential hub, among which one can be chosen. The multiple objectives are to minimize the total cost of the networks regarding minimizing the maximum travel time between nodes. Due to the NP-hard property of this problem, the model is solved by a multi-objective imperialistcompetitive algorithm (MOICA). To prove its efficiency, the related results are compared with the results obtained by the well-known multi-objective evolutionary algorithm, namely NSGA-II. The results confirm the efficiency and the effectiveness of our proposed MOICA to provide good solutions,especially for medium and large-sized problems. Finally, we conclude that the proposed MOICA finds quality solutions rather than the solutions obtained by the NSGA-II algorithm
کلیدواژه ها:
نویسندگان
r Tavakkoli-Moghaddam
Department of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran
y Gholipour-Kanani
Department of Management, Qaemshahr Branch, Islamic Azad University, Qaemshahr, Iran
m Shahramifar
Department of Industrial Engineering, Mazandaran University of Science & Technology, Babol, Iran