شماره ركورد :
170386
عنوان مقاله :
VRSP چگونگي حل مسايل حمل و نقل با الگوريتم
عنوان به زبان ديگر :
How to Solve Transportation Problems by Using VRSP Algorithm
رتبه نشريه :
-
تعداد صفحه :
14
از صفحه :
105
تا صفحه :
118
كليدواژه :
Route Finding Problem , Transportation Routes , Vehicles , مساله مسيريابي , Artificial Intelligence Algorithms , مسيرهاي حمل و نقل , راه و ترابري , الگوريتم هاي هوش مصنوعي , وسايط نقليه
چكيده لاتين :
The main goal of this article is studying the importance of route finding problem for finding the shortest goods or human distribution routes from the center. It is required that through the shortest route, and shortest traveling time, with the fewest vehicles, the most number of customers give services. Transportation companies, with regard to their type of activities, send raw material and purchased goods to warehouses and after processing, distribute them between customers. Therefore, defining routes between centers and customers has essential importance. This issue is the determining factor for specifying the number of vehicles, time consumed, and prioritizing customersʹ routes, along with calculating the cost of trips. This article attempts to explain methods for decreasing forenamed elements (routes, number of vehicles, time consumed, and cost of trip). Furthermore, mathematical problems, heuristic problems and artificial intelligence and their role in solving transportation problems are under discussion.
كلمات كليدي :
#تست#آزمون###امتحان
لينک به اين مدرک :
بازگشت