Mathematical Model for Bi-objective Maximal Hub Covering Problem with Periodic Variations of Parameters
محل انتشار: ماهنامه بین المللی مهندسی، دوره: 32، شماره: 7
سال انتشار: 1398
نوع سند: مقاله ژورنالی
زبان: انگلیسی
مشاهده: 381
فایل این مقاله در 12 صفحه با فرمت PDF قابل دریافت می باشد
- صدور گواهی نمایه سازی
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
JR_IJE-32-7_009
تاریخ نمایه سازی: 10 آذر 1398
چکیده مقاله:
The problem of maximal hub covering as a challenging problem in operation research. Transportation programming seeks to find an optimal location of a set of hubs to reach maximum flow in a network. Since the main structure s parameters of the problem such as origin-destination flows, costs and travel time, change periodically in the real world applications, new issues arise in handling it. In this paper, to deal with the periodic variations of parameters, a bi-objective mathematical model is proposed for the single allocation multi-period maximal hub covering problem. The ε-constraint approach has been applied to achieve non-dominated solutions. Given that the single-objective problem found in the ε-constraint method is computationally intractable. Benders decomposition algorithm by adding valid inequalities is developed to accelerate the solution process. Finally, the proposed method is carried out by CAB data set, and the results confirm the efficiency of it regarding optimality and running time.
کلیدواژه ها:
نویسندگان
Y. Khosravian
Department of Industrial and Systems Engineering, Isfahan University of Technology, Isfahan, Iran
A. Shahandeh Nookabadi
Department of Industrial and Systems Engineering, Isfahan University of Technology, Isfahan, Iran
G. Moslehi
Department of Industrial and Systems Engineering, Isfahan University of Technology, Isfahan, Iran