74 views

Uploaded by IJRISE Journal

This paper delivers a manifestation of spanning algorithms by creating a “travel plan”
between 5 places Selam, Kirishnagiri, Vellore, Bangalore, and Mysore. Our objective is
to find the path with minimum cost and having shortest distance. It is found that the
next-door neighbour algorithm (NDNA) does not give us an optimal path all the time.
The Brute force algorithm in which we find out all the possibilities lead to our solution in
our constraints. We involved both the cost of travelling and distance for expressing the
optimal path. By Kruskal’s algorithm we find the reduced path (shortest path) when we
do not have any such constraints.

- Two Yacht Problem
- Algorithms
- Graph of Sines and Cosines
- 2011 Iwymic Team
- Prob and Stocastic Booksol
- Unit -V
- 2015HanoiRegional Problem Sets
- Difference Cordial of Operational Graph
- Discrete Ch1
- 2000-1.pdf
- 428 Euler Lecture
- bk7_7.pdf
- String Search Using Clustering
- Programming Links
- 25planarity
- Apriori Algorithm
- 6 Models of PA
- mattddiiisss
- Achievement 9 FINAL - D
- Estudiante Superior Examen

You are on page 1of 6

ARTERY NET

1

Assistant Professor, Department of Mathematics, Government College of Engineering,

Thanjavur,Tamilnadu, India, rinomathz502@yahoo.com

2

Assistant Professor, Department of Mathematics, A. V. V. M. Sri Pushpam College, Poondi,

Thanjavur, Tamilnadu, india, jagkans@yahoo.com

3

Assistant Professor, Department of Mathematics, Parisutham Institute of Technology,

Thanjavur, Tamilnadu, india, tina.suvakeen@gmail.com

ABSTRACT

This paper delivers a manifestation of spanning algorithms by creating a travel plan

between 5 places Selam, Kirishnagiri, Vellore, Bangalore, and Mysore. Our objective is

to find the path with minimum cost and having shortest distance. It is found that the

next-door neighbour algorithm (NDNA) does not give us an optimal path all the time.

The Brute force algorithm in which we find out all the possibilities lead to our solution in

our constraints. We involved both the cost of travelling and distance for expressing the

optimal path. By Kruskals algorithm we find the reduced path (shortest path) when we

do not have any such constraints.

algorithm.

1. INTRODUCTION

The basic aspire of Graph theory is to solve problems related to a network designed

by interconnecting a set of points by lines. Its most significant application is travel planning.

A graph may direct or undirected. Undirected graph denotes to a network of points where

there is no distinction among two vertices or edges. If a node is joined by more than one edge

then it is known as multi-graph. If a graph has only one edge between any two nodes, then it

is simple graph. Degree of a vertex is the number of edges incident on it. Anyway, taken

down the edges of a graph is a path. A path originating and terminating at the same node is

known as circuit. If a circuit includes every edge in the graph, then the graph is said to be

Eulerian. If a circuit visits each vertex once and ends at the origin, it is called a Hamiltonian

circuit. Even though both Euler circuit and Hamiltonian cycle may seem same, every node is

visited in an Eulerian circuit while in a Hamiltonian cycle each edge is traversed once

Thus, by inheriting the ideas of graph theory, we can determine which city to traverse

first while planning the travel. When we use the brute force method to solve such the travel

planning problem, even if it returns an optimal solution, it is largely time and space

consuming particularly when information to be processed is massive. The process cant be

completed manually as the number of points in large in number.

The next-door neighbour algorithm (NDNA) was one of the first algorithms used to

International Journal of Research In Science & Engineering e-ISSN: 2394-8299

Volume: 3 Issue:2 March-April 2017 p-ISSN: 2394-8280

determine a solution to the travelling salesman problem. For more efficient method for

finding the optimal solution, the next-door neighbour algorithm is implemented. This method

is time critical. However, it does not always return an optimal solution. For finding the

shortest path in travel planning NDNA can be used. The solution is said to be optimal when

the distance to be covered is shortest. However, NDNA being a heuristic algorithm cannot

guarantee an optimal solution. For finding the solution using NDNA, starting from vertex,

we move to the closest vertex and so on till we reach the destination vertex. Thus, by using

NDNA we get a travelling plan which may or may not be optimized.

The Sorted Edges Algorithm (SEA), well known as Travelling Salesman Problem,

is a Hamiltonian Circuit as well as heuristic. The eventual objective of the travelling

salesman problem is to find the least cost for traversing. In SEA, the edges are sorted

according to their weight. First, the smallest edge is selected, then the next smallest and so

on. If edges make a circuit, they should be rejected unless they form a Hamiltonian circuit.

In 1956, one standard algorithm has been developed by Kruskals. Each vertex can be

visited exactly once and no circuits are formed when we implement Kruskals algorithm.

Here, a set of edges which forms a tree by including all the nodes, where the cumulative cost

of edges is kept lowest. Thus, it finds the optimal path.

In section 1.3 of this paper, we find the path with minimum cost and having the

shortest distance using Kruskals algorithm and the result also discussed. We conclude this

paper in section 3.

1.1 Method

Our aim is to try to optimize the path based on the distance between multiple nodes

which we denote as multiple districts like Selam, Kirishnagiri,Vellore, Bangalore and

Mysore. To trace the shortest possible path between multiple nodes, we tried that by

implementing two algorithms. Time and cost are taken by manual to avoid the discrepancies

for the research.

Origin point Destination point Cost (In Rs) Distance (In Km)

Selam Kirishnagri 205 115

Selam Vellore 392 234

Selam Bangalore 450 238

Selam Mysore 700 256

Kirishnagri Vellore 550 109

Kirishnagri Bangalore 420 94

Kirishnagri Mysore 1602 227

Vellore Bangalore 624 116

Vellore Mysore 924 464

International Journal of Research In Science & Engineering e-ISSN: 2394-8299

Volume: 3 Issue:2 March-April 2017 p-ISSN: 2394-8280

The above scenario can be depicted as:

1.2 Algorithm 1

Considering Selam as starting point of travelling we are going to find out the

minimized shortest path based on distance as well as with cost by brute force method. It

leads to finding all the possibilities of paths and then finally finding the least value path.

So comparing the cost we obtained using this brute force method we find that Selam-

Vellore-Krishnakiri-Bangalore-Mysore gives the shortest path based on distance and Selam-

Vellore-Krishnakiri-Bangalore-Mysore is an economical path on basis of cost.

1.3 Algorithm 2

Apply Kruskals algorithm to find the shortest spanning tree for the given graph.

We perform following steps to trace the path:

1. Listing the edges of the graph from upper to the lowest in uphill or downhill order of

its weight.

2. Selection of edge from that order in such a way that no circuit is formed.

3. If an edge forms a circuit with previously selected ones then we have to neglect that

edge and look for next edge.

4. We have to draw the spanning tree of graph covering all the vertices.

So we obtained following two spanning trees based on their edge distances and cost of

travelling.

International Journal of Research In Science & Engineering e-ISSN: 2394-8299

Volume: 3 Issue:2 March-April 2017 p-ISSN: 2394-8280

1.4 Algorithm 3

Now we will be representing the next-door path algorithm for travelling and finding

the path. So we start from Selam and will try to cover all the Places and come back to Selam.

Now considering the case of distance graph, we start our simulation from Selam. We find

that Vellore is the nearest city closest to it so we move to Vellore Similarly continuing in this

way; the path obtained will be: Selam Kirishnagiri Vellore Bangalore Mysore Selam

International Journal of Research In Science & Engineering e-ISSN: 2394-8299

Volume: 3 Issue:2 March-April 2017 p-ISSN: 2394-8280

International Journal of Research In Science & Engineering e-ISSN: 2394-8299

Volume: 3 Issue:2 March-April 2017 p-ISSN: 2394-8280

The distance, weight of travelling path obtained is 833. To calculate the cost of travelling

using this next-door node algorithm. So starting from Selam, we move to Vellore since the

travel cost is lowest for it. Continuing in this way we obtain following path:- Selam-

Kirishnagiri- Vellore- Bangalore- Mysore- Selam the travel cost obtained is 2379.

2. RESULTS

By using the concepts of graph theory through various graphs obtained by applying

multiple algorithms to find out the optimal path, we found that Selam Kirishnagiri Vellore

Bangalore Mysore Selam is most optimized path with path distance 833 km and cost of

travelling Rs. 2379. We took Omni Bus fare between the cities for the simulation. So

according this we can easily plan our travelling program in most optimized way saving our

money as well as time.

3. CONCLUSION

This paper gave us an idea about how we can engagement concepts of Graph theory in our

day to day life. We find out the most optimized path between five cities in terms of time and

money. It denotes the power of use of Graph theory as it can be obliging to our daily

necessities.

We conclude that NDNA (next-door neighbour algorithm) does not give us optimal

path all the time as we got different values of travel cost and path using that algorithm.

Brute force algorithm in which we tried to find out all the possibilities lead to our solution

in our constraints. We involved both the cost of travelling and distance for expressing the

optimal path. We can use the concepts of Kruskals algorithm to find the minimized path

(shortest path) when we do not have any such constraints.

REFERENCES

[1] Rodriguez, B (1998-2009). Graph Theory. Retrieved July 15, 2009, from Applications of

Graph Theory.

[2] West, D (2005). Graph Theory. Retrieved July 15, 2009, from Douglas B. West's

- Two Yacht ProblemUploaded byMukti Palapa
- AlgorithmsUploaded byManish Kaushal
- Graph of Sines and CosinesUploaded bylpuelearning
- 2011 Iwymic TeamUploaded byEng Rit
- Prob and Stocastic BooksolUploaded byjonjones666
- Unit -VUploaded byRobertBellarmine
- 2015HanoiRegional Problem SetsUploaded byLê Trần Bảo Cương
- Difference Cordial of Operational GraphUploaded byIJAERS JOURNAL
- Discrete Ch1Uploaded bygopinathbl71
- 2000-1.pdfUploaded byMuhammad Al Kahfi
- 428 Euler LectureUploaded bySunit Jain
- bk7_7.pdfUploaded byAnonymous O7NI8R3gFA
- String Search Using ClusteringUploaded byijsret
- Programming LinksUploaded byKrishna Prasad
- 25planarityUploaded byirshad84
- Apriori AlgorithmUploaded byJeremy Montgomery
- 6 Models of PAUploaded bygodwsky
- mattddiiisssUploaded byAzkaa Khoiruddin
- Achievement 9 FINAL - DUploaded byJaeha Cruz
- Estudiante Superior ExamenUploaded byFaustino Hernandez Santiago
- Febmarch 2012 NSC Mathematics P1 Feb-March 2012 Memo Eng.pdfUploaded byBalkis
- Template CamUploaded byeff666
- Calculator Technique 2.0.pptxUploaded byKristine Rose Vergara
- Computer Systems OrganizationUploaded byxbabax
- Homework 3Uploaded bygedeus8072
- Lect_24Uploaded bywin alfalah
- CSE330 Quiz SolutionsUploaded bynehal hasnain refath
- Uction of MIMO System Using Supervised Clustering Algorithm.docxUploaded bysuneel Tummapudi
- Minimal Realizations Lecture Notes Linear System and ControlUploaded byBHAVNA AGARWAL
- RF Power Control and Handover Algorithm_ handover due to uplink_downlink quality.pdfUploaded byBang Ben

- SENTIMENT ANALYSIS ON TWITTERUploaded byIJRISE Journal
- PARTICLE SWARM OPTIMIZATION ALGORITHM FOR ROUTING NETWORKUploaded byIJRISE Journal
- MODIFICATION AFFINE CIPHERS ALGORITHM FOR CRYPTOGRAPHY PASSWORDUploaded byIJRISE Journal
- EXPERT SYSTEMS WITH GENETICS PROBABILITYUploaded byIJRISE Journal
- SECURITY MODEL FOR SECURE STORAGE IN CLOUD ENVIRONMENTUploaded byIJRISE Journal
- SMART E-HEALTHCARE MANAGEMENT SYSTEMUploaded byIJRISE Journal
- ZIGBEE LIVE ELECTRICITY METER MONITORING WITH TEMPERING PROOFUploaded byIJRISE Journal
- IMPACT OF WORMHOLE ATTACK IN WIRELESS SENSOR NETWORKS: A SURVEYUploaded byIJRISE Journal
- REVIEW ON WIND-SOLAR HYBRID POWER SYSTEMUploaded byIJRISE Journal

- Performance Tuning Fundementals Version 1Uploaded byj2pablo
- Apps_Integration_CookbookUploaded byneedhamc1147
- Ademco Vista 10 1Uploaded byJason Troxclair
- Davis Langdon Middle East Handbook 2012Uploaded byAngelo Sanghoon HAN
- Oracle® Integrated Lights Out .. Supplement for the Sun Netra T5220 Server (2)Uploaded byrebin1988
- 355mav TroubleshootingUploaded bybdscanlan
- florida trend top companies list 2018Uploaded byJay Steele
- FULLTEXT01.pdfUploaded byammu
- Risk Management pptUploaded byShamoil Shaikh
- GBC 10120 PostGrad Viewbook WEBUploaded bykaushikloves
- InSpectres.pdfUploaded byRyan Martinez
- TUC-2_01_USE_EN_R2Uploaded byMuhammad Tahir
- Sample 1- GIS MapsUploaded byJustKorn
- 2005 CAT Engine ProgrrammingUploaded bytoan
- abstrak_487637_tpjuaUploaded byAggita Cahyani
- AC_VCR_IOMUploaded byAkram Ashmawy
- linksealchart.pdfUploaded bygemotorres
- Pip Elegl02 Arc Flash GuidlinesUploaded byger80
- Sight ReadingUploaded byDouglas Brito
- sony_cdx-600_cdx-606_cdx-626Uploaded byu4rishi
- How to Make a Ring With Bezel SettingUploaded bymobsivac
- 3608 B2B in the Context of SAP NetWeaver Process Integration - Roadmap and StrategyUploaded byLokesh Grc
- Proceedings of the Fifteenth Meeting of the GMS Subregional Transport ForumUploaded byAsian Development Bank Conferences
- PowerWizard 2-0(GB)1006Uploaded byJaffer Hussain
- FBI FOIA Anti-Sec DocumentsUploaded bySmiley Hill
- Global Al Saqib Recruitment Group ISO 9001-2008 Certified CompanyUploaded byAl Saqib Recruitment Group
- Buffer 2Uploaded bymordidomi
- IEEE 802.21 - Wikipedia.orgUploaded byMohtiPearl
- 2016-Nissan-Versa-Note.pdfUploaded byThor Acho Torres
- Beam DesignUploaded byMaged Mohammed