پیوندهای مفید
آمار
| تعداد نشریات | 21 |
| تعداد شماره‌ها | 654 |
| تعداد مقالات | 9,577 |
| تعداد مشاهده مقاله | 68,495,108 |
| تعداد دریافت فایل اصل مقاله | 47,950,809 |
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 | ||
| تاریخ دریافت: 23 تیر 1402، تاریخ بازنگری: 09 مرداد 1402، تاریخ پذیرش: 20 شهریور 1402 | ||
| چکیده | ||
| 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] N. Aras, D. Aksen, and A.G. Tanugur, Locating collection centers for incentive-dependent returns under a pick-up policy with capacitated vehicles, Eur. J. Oper. Res. 191 (2008), no. 12, 23–40. [2] A. Azadeh, S.F. Ghaderi, and A. Maghsoudi, Location optimization of solar plants by an integrated hierarchical DEA PCA approach, Energy Policy 36 (2008), no. 10, 3993–4004. [3] M.A. Badri, Combining the analytic hierarchy process and goal programming for global facility location-allocation problem, Int. J. Product. Econ. 62 (1999), no. 3, 237–248. [4] Y. Chan, Location theory and decision analysis, South-Western College Pub. 2001. [5] S. Cheng, C.W. Chan, and G.H. Huang, An integrated multi-criteria decision analysis and inexact mixed integer linear programming approach for solid waste management, Eng. Appl. Artif. Intell. 16 (2003), no. 5, 543–554. [6] C.C. Chou, A fuzzy MCDM method for solving marine transhipment container port selection problems, Appl. Math. Comput. 186 (2007), no. 1, 435–444. [7] S.Y. Chou, Y.H. Chang, and C.Y. Shen, A fuzzy simple additive weighting system under group decision-making for facility location selection with objective/subjective attributes, Eur. J. Oper. Res. 189 (2008), no. 1, 132–145. [8] M.S. Daskin, Network and discrete location: models, algorithms and applications, J. Oper. Res. Soc. 48 (1997), no. 7, 763–764. [9] M.S. Daskin, Network and discrete location: models, algorithms, and applications, John Wiley & Sons, 2011. [10] M. Moshref-Javadi, A. Hemmati, and M. Winkenbach, A truck and drones model for last-mile delivery: A mathematical model and heuristic approach, Appl. Math. Modell. 80 (2020), 290–318. [11] P. Tat and D. Vigo, Vehicle routing, Translated by: M. Setak and A. Tavakolnia, Commercial Publishing, 2012. | ||
|
آمار تعداد مشاهده مقاله: 965 تعداد دریافت فایل اصل مقاله: 693 |
||