Application Of Graph Theory To Find Optimal Path And Minimized Cost For The Transportation Problem

Priyadharshini.T; Manikandan.K.M

doi:https://doi.org/10.14445/22315373/IJMTT-V65I10P509

International Journal of Mathematics Trends and Technology

Research Article | Open Access | Download PDF

Volume 65 | Issue 10 | Year 2019 | Article Id. IJMTT-V65I10P509 | DOI : https://doi.org/10.14445/22315373/IJMTT-V65I10P509

Application Of Graph Theory To Find Optimal Path And Minimized Cost For The Transportation Problem

Priyadharshini.T, Manikandan.K.M

Citation :

Priyadharshini.T, Manikandan.K.M, "Application Of Graph Theory To Find Optimal Path And Minimized Cost For The Transportation Problem," International Journal of Mathematics Trends and Technology (IJMTT), vol. 65, no. 10, pp. 61-69, 2019. Crossref, https://doi.org/10.14445/22315373/IJMTT-V65I10P509

Abstract

Graph theory is used to model many types of relations and process in real world network systems such as internet, power grids, telephone, transportation, affiliation networks, food webs, electricity, water and so on. Many practical problems can be represented by graphs. In this paper we study about finding minimum spanning tree and the shortest distance between two place using algorithms. We have developed a network model to find the minimum distance and the minimum cost of transporting a product from place A to place B through a truck.

Keywords

Spanning tree, vertices, edges, algorithms, place, distance, cost.

References

[1] RameLikaj, AhmetShala and MirlindBruqi, (2013), Application of Graph Theory to find optimal paths for the transportation problem, Pages 1099-1103, University of Prishtina, Prishtina, Kosovo.
[2] Wen-Chih Chang, Mao-Fan Li, (2008), Learning Kruskal‟s Algorithm, Prim‟s Algorithm and Dijkstra‟s Algorithm by Board Game,Pages 275-284, Springer-Verlag Berlin, Heidelberg.
[3] John Clark and Derek Allan Holton (1995)“A First Look At Graph Theory”, published by Allied Publishers Limited, 1995.
[4] San San Maw, Khin Saw Lin, Lin LinNaing (2019) ,“Dijkstra‟s Algorithm for Effective Travelling to the Most Famous Destinations in Mynamar” Pages 4-12.
[5] M.Muthulakshmi, M.M.Shanmugapriya(2016), “Shortest Path Algorithm and its Implementation”, IJMTT V3692) pages 82-85.
[6]https://www.hackerearth.com/blog/developers/kruskals-minimum-spanning-tree-algorithm-example/
[7]https://www.statisticshowto.datasciencecentral.com/minimum-spanning-tree/