دانشگاه آزاد اسلامی واحد علوم و تحقیقات

 آمار

تعداد نشریات50
تعداد شماره‌ها2,079
تعداد مقالات19,525
تعداد مشاهده مقاله22,864,361
تعداد دریافت فایل اصل مقاله21,108,461
Yousefikhoshbakht, Majid, Chaharmahali, Mohamadreza. (1401). Expansions and algorithms of the fleet and mix vehicle routing problem. , (), -. doi: 10.30495/jnrm.2023.56923.1994
Majid Yousefikhoshbakht; Mohamadreza Chaharmahali. "Expansions and algorithms of the fleet and mix vehicle routing problem". , , , 1401, -. doi: 10.30495/jnrm.2023.56923.1994
Yousefikhoshbakht, Majid, Chaharmahali, Mohamadreza. (1401). 'Expansions and algorithms of the fleet and mix vehicle routing problem', , (), pp. -. doi: 10.30495/jnrm.2023.56923.1994
Yousefikhoshbakht, Majid, Chaharmahali, Mohamadreza. Expansions and algorithms of the fleet and mix vehicle routing problem. , 1401; (): -. doi: 10.30495/jnrm.2023.56923.1994

Expansions and algorithms of the fleet and mix vehicle routing problem

Journal of New Researches in Mathematics
مقالات آماده انتشار، پذیرفته شده، انتشار آنلاین از تاریخ 02 اسفند 1401  XML
نوع مقاله: research paper
شناسه دیجیتال (DOI): 10.30495/jnrm.2023.56923.1994
نویسندگان
Majid Yousefikhoshbakht email 1؛ Mohamadreza Chaharmahali2
1Assistant Professor, Department of Mathematics, Faculty of Science, Bu-Ali Sina University, Hamedan, Iran5
2Department of Mathematics, Faculty of Sciences, Bu-Ali Sina University, Hamedan, Iran
چکیده
The vehicle routing problem (VRP) is one of the most important research issues in operations in industries and services, which is highly regarded today due to the high cost of transportation in the final price of goods. On the other hand, considering that the use of vehicles with different capacities will further reduce this cost, the issue of fleet size and mix vehicle routing (FSMVRP) was introduced and since then significant progress has been made on these issues and their types for use in Real tools were made. In this case, there are different types of vehicles with different capacities available in the unique depot to serve a group of customers with known geographical locations. In addition, in this case, each customer needs a certain amount of goods that must be delivered to them by a fixed fleet of vehicles. The goal is to determine the set of tours for the vehicles with the lowest cost, provided that: each vehicle starts from the depot and returns to it at the end, each customer is visited exactly once by one vehicle and the total customer demand of each tour exceeds the capacity do not exceed any type of vehicle, which is considered Qi. The purpose of this article is to categorize and review issues related to FSMVRP. This paper also provides a comparative analysis of meta-heuristic algorithms for these problems.
کلیدواژه‌ها
Vehicle routing problem؛ Fleet size and mix؛ Hard-NP problems؛ Depot
آمار
تعداد مشاهده مقاله: 16


سامانه مدیریت نشریات علمی. قدرت گرفته از سیناوب