Abstract
The aim of this article is to propose a solution for finding the shortest route for transportation between supply and demand. The problem of supplying car battery from Tehran to the centres of provinces of Iran has been investigated and a graph has been developed. Then, by using the heuristic prim algorithm, the minimum spanning tree of this graph has been obtained, and this tree has shown the shortest route for transportation. The problem has also been solved by meta-heuristic genetic algorithm, and the response has been compared with prim algorithm, and it has been shown that for big problems, the genetic algorithm can be used. In order to reduce the density of freight cars in roads, a scenario has been proposed by which, roads traffic and accidents, fuel consumption and customer delivery time can be reduced.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Logistics Systems and Management
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
