The shortest route for transportation in supply chain by minimum spanning tree
by Arash Shahin; Fatemeh Jaferi
International Journal of Logistics Systems and Management (IJLSM), Vol. 22, No. 1, 2015

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.

Online publication date: Fri, 31-Jul-2015

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Logistics Systems and Management (IJLSM):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com