The shortest route for transportation in supply chain by minimum spanning tree

The shortest route for transportation in supply chain by minimum spanning tree

0.00 Avg rating0 Votes
Article ID: iaor201526731
Volume: 22
Issue: 1
Start Page Number: 43
End Page Number: 54
Publication Date: Jul 2015
Journal: International Journal of Logistics Systems and Management
Authors: ,
Keywords: supply & supply chains, combinatorial optimization, heuristics
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.

Reviews

Required fields are marked *. Your email address will not be published.