News Updates Monday 25th Nov 2024 :
  • Welcome to INPRESSCO, world's leading publishers, We have served more than 10000+ authors
  • Articles are invited in engineering, science, technology, management, industrial engg, biotechnology etc.
  • Paper submission is open. Submit online or at editor.ijcet@inpressco.com
  • Our journals are indexed in NAAS, University of Regensburg Germany, Google Scholar, Cross Ref etc.
  • DOI is given to all articles

Application of Graph Theory to find Optimal Paths for the Transportation Problem


Author : Ramë Likaj, Ahmet Shala and Mirlind Bruqi

Pages : 1099-1103
Download PDF
Abstract

Graph theory is used for finding communities in networks. Graphs are used as device for modeling and description of real world network systems such are: transport, water, electricity, internet, work operations schemes in the process of production, construction, etc. Although the content of these schemes differ among themselves, but they have also common features and reflect certain items that are in the relation between each other. So in the scheme of transport network might be considered manufacturing centers, and roads and rail links connected directly to those centers. In this paper is designed the solution for an practical problem to find a Minimum Spanning Tree by using Kruskal algorithm and graph search Dijkstra’s Algorithm to find the shortest path between two points, Also, for this case was developed a network model of the transportation problem which is analyzed in detail to minimize shipment costs.

Keywords: Graph, Transport, Algorithm, Minimum Spanning Tree, Node, Arcs

Article published in International Journal of Current  Engineering  and Technology, Vol.3,No.3(Aug- 2013)

 

 

 

Call for Papers
  1. IJCET- Current Issue
  2. Issues are published in Feb, April, June, Aug, Oct and Dec
  3. DOI is given to all articles
  • Inpressco Google Scholar
  • Inpressco Science Central
  • Inpressco Global impact factor
  • Inpressco aap

International Press corporation is licensed under a Creative Commons Attribution-Non Commercial NoDerivs 3.0 Unported License
©2010-2023 INPRESSCO® All Rights Reserved