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

Authors: Arash Shahin; Fatemeh Jaferi

Addresses: Department of Management, University of Isfahan, Hezarjarib St., 81746-73441, Isfahan, Iran ' Department of Industrial Engineering, Islamic Azad University, Najafabad Branch, Isfahan, Iran

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.

Keywords: transport shortest route; prim algorithms; genetic algorithms; supply chain management; SCM; minimum spanning tree; Iran; road traffic; traffic accidents; fuel consumption; customer delivery time.

DOI: 10.1504/IJLSM.2015.070893

International Journal of Logistics Systems and Management, 2015 Vol.22 No.1, pp.43 - 54

Received: 11 Jan 2014
Accepted: 08 Jun 2014

Published online: 22 Jul 2015 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article