Pourbashir Hir, Hassan, Pirani, Nasim, Ghadimi Hellabad, Rasool. (1403). Cargo fleet routing model with limited timeframe using honey bee algorithm (Case study: Pak Gostar Dairy Products). هنرهای کاربردی, 15(9), 231-238. doi: 10.22075/ijnaa.2023.31407.4626
Hassan Pourbashir Hir; Nasim Pirani; Rasool Ghadimi Hellabad. "Cargo fleet routing model with limited timeframe using honey bee algorithm (Case study: Pak Gostar Dairy Products)". هنرهای کاربردی, 15, 9, 1403, 231-238. doi: 10.22075/ijnaa.2023.31407.4626
Pourbashir Hir, Hassan, Pirani, Nasim, Ghadimi Hellabad, Rasool. (1403). 'Cargo fleet routing model with limited timeframe using honey bee algorithm (Case study: Pak Gostar Dairy Products)', هنرهای کاربردی, 15(9), pp. 231-238. doi: 10.22075/ijnaa.2023.31407.4626
Pourbashir Hir, Hassan, Pirani, Nasim, Ghadimi Hellabad, Rasool. Cargo fleet routing model with limited timeframe using honey bee algorithm (Case study: Pak Gostar Dairy Products). هنرهای کاربردی, 1403; 15(9): 231-238. doi: 10.22075/ijnaa.2023.31407.4626

Cargo fleet routing model with limited timeframe using honey bee algorithm (Case study: Pak Gostar Dairy Products)

International Journal of Nonlinear Analysis and Applications
مقاله 17، دوره 15، شماره 9، آذر 2024، صفحه 231-238    اصل مقاله (986.97 K)
نوع مقاله: Research Paper
شناسه دیجیتال (DOI): 10.22075/ijnaa.2023.31407.4626
نویسندگان
Hassan Pourbashir Hir* 1؛ Nasim Pirani2؛ Rasool Ghadimi Hellabad3
1Department of Industrial Management, North Tehran Branch, Islamic Azad University, Tehran, Iran
2Department of Civil Engineering, Faculty of Engineering, Mohaghegh Ardabil University, Ardabil, Iran
3Department of Electrical Engineering, Ardabil Branch, Islamic Azad University, Ardabil, Iran
چکیده
Cargo fleet routing problem is part of the problems that arise and are used in the transportation industry. In this research, one of the specific types of this issue as the time fleet tracking with a limited time period which is the most common problem in operations research at the present time will be discussed. The aim of solving this problem is to provide service to many customers at different locations and different demands by a sufficient fleet. Considering these limitations each customer should set a period of time in service and delays in service are to a certain extent. In this study, reach sooner at the fleet to each of the destinations has given the delay in the service to a certain amount of the fines in accordance with the early and late is acceptable. In terms, they call it (period of application). According to surveys, in order to achieve the above objectives, the use of Bees Algorithm is used in this thesis. Using the Bee algorithm in this research is due to the evolutionary nature of this algorithm.
کلیدواژه‌ها
Cargo fleet routing؛ honey bee algorithms؛ limited timeframe
مراجع
آمار
تعداد مشاهده مقاله: 1,457
تعداد دریافت فایل اصل مقاله: 1,008
دانشگاه سمنان
پیوندهای مفید
آمار
تعداد نشریات22
تعداد شماره‌ها722
تعداد مقالات10,383
تعداد مشاهده مقاله72,838,579
تعداد دریافت فایل اصل مقاله64,535,123