Kahfi, Atefeh, Seyed Hosseini, Seyed Mohammad, Tavakkoli-Moghaddam, Reza. (1400). A robust optimization approach for a multi-period location-arc routing problem with time windows: A case study of a bank. هنرهای کاربردی, 12(1), 157-173. doi: 10.22075/ijnaa.2019.16392.1868
Atefeh Kahfi; Seyed Mohammad Seyed Hosseini; Reza Tavakkoli-Moghaddam. "A robust optimization approach for a multi-period location-arc routing problem with time windows: A case study of a bank". هنرهای کاربردی, 12, 1, 1400, 157-173. doi: 10.22075/ijnaa.2019.16392.1868
Kahfi, Atefeh, Seyed Hosseini, Seyed Mohammad, Tavakkoli-Moghaddam, Reza. (1400). 'A robust optimization approach for a multi-period location-arc routing problem with time windows: A case study of a bank', هنرهای کاربردی, 12(1), pp. 157-173. doi: 10.22075/ijnaa.2019.16392.1868
Kahfi, Atefeh, Seyed Hosseini, Seyed Mohammad, Tavakkoli-Moghaddam, Reza. A robust optimization approach for a multi-period location-arc routing problem with time windows: A case study of a bank. هنرهای کاربردی, 1400; 12(1): 157-173. doi: 10.22075/ijnaa.2019.16392.1868

A robust optimization approach for a multi-period location-arc routing problem with time windows: A case study of a bank

International Journal of Nonlinear Analysis and Applications
مقاله 13، دوره 12، شماره 1، مرداد 2021، صفحه 157-173    اصل مقاله (2.34 M)
نوع مقاله: Research Paper
شناسه دیجیتال (DOI): 10.22075/ijnaa.2019.16392.1868
نویسندگان
Atefeh Kahfi1؛ Seyed Mohammad Seyed Hosseini2؛ Reza Tavakkoli-Moghaddam* 3
1Department of Industrial Engineering, College of Engineering, University of Payame Noor, Tehran, Iran
2School of Industrial Engineering, Iran University of Science and Technology, Tehran, Iran
3School of Industrial Engineering, College of Engineering, University of Tehran, P.O. Box: 11155-4563, Tehran, Iran
چکیده
A Location-Arc Routing Problem (LARP) is a practical problem, while a few mathematical programming models have been considered for this problem. In this paper, a mixed non-linear programming model is presented for a multi-period LARP with the time windows under demand uncertainty. The time windows modeling in the arc routing problem is rarely. To the best our knowledge, it is the first time that the robust LARP model is verified and an optimal solution is presented for it. For this purpose, the CPLEX solver is used for solving the treasury location problems of a bank as a case study. These problems are node-based with close nods and can be transformed into arc-based. Therefore, the method LRP and LARP models can be used to solve these problems. The comparing results of the LRP and LARP models prove that the LARP has a better performance regarding timing and optimal solution. Furthermore, comparing the results of deterministic and robust LARP models for this case study shows the validity of the robust optimization approach.
کلیدواژه‌ها
Location-arc routing problem؛ Time windows؛ Multi-periods؛ Robust optimization؛ Demand Uncertainty
مراجع
آمار
تعداد مشاهده مقاله: 16,820
تعداد دریافت فایل اصل مقاله: 10,131
دانشگاه سمنان
پیوندهای مفید
آمار
تعداد نشریات22
تعداد شماره‌ها717
تعداد مقالات10,316
تعداد مشاهده مقاله72,310,292
تعداد دریافت فایل اصل مقاله64,034,636