TSP SEMARANG MARKETS ROUTE USING DFS ALGORITHM

Setyawan, Fredy (2010) TSP SEMARANG MARKETS ROUTE USING DFS ALGORITHM. Other thesis, Fakultas Ilmu Komputer, UNIKA Soegijapranata.

Preview	Text (COVER) 04.02.0054 Fredy Setyawan COVER.pdf Download (158kB) | Preview
	Text (BAB I) 04.02.0054 Fredy Setyawan BAB I.pdf Restricted to Registered users only Download (99kB)
	Text (BAB II available document only in library of Soegijapranata Catholic University) 04.02.0054 Fredy Setyawan BAB II.pdf Restricted to Repository staff only Download (143kB)
	Text (BAB III available document only in library of Soegijapranata Catholic University) 04.02.0054 Fredy Setyawan BAB III.pdf Restricted to Repository staff only Download (110kB)
	Text (BAB IV available document only in library of Soegijapranata Catholic University) 04.02.0054 Fredy Setyawan BAB IV.pdf Restricted to Repository staff only Download (626kB)
	Text (BAB V available document only in library of Soegijapranata Catholic University) 04.02.0054 Fredy Setyawan BAB V.pdf Restricted to Repository staff only Download (686kB)
	Text (BAB VI) 04.02.0054 Fredy Setyawan BAB VI.pdf Restricted to Registered users only Download (95kB)
Preview	Text (DAFTAR PUSTAKA) 04.02.0054 Fredy Setyawan DAFTAR PUSTAKA.pdf Download (115kB) | Preview

Abstract

Travelling Salesman Problem [TSP] is one of the most intensively studied problems in computational mathematics. A salesman spends his time visiting nlocation from the starting point to the destination point. In one tour, salesman must visit each point just once and finish in destination point with lowest mileage possible to save the cost and energy This Project will create TSP software to help the salesman. The software is using Tree as data structures. Tree is needed to store the data used in this project. The data contain detail such as marketplace name and distance to reach another marketplace. DFS is used as algorithm. The concept of DFS is simple. The searching progress will start from the left child first until hit the bottom of the tree. When the progress hit the bottom tree, it will bounce up one level to search to the right node. If the searching progress go up one level but cannot find any other branch, then it will bounce up one more level or more until find another branch to be explored and so the rest. This software is work quite well. All the possible routes can be displayed in the GUI and there’s a notification on the shortest route. Also, user have the ability to update the markets data from the GUI.

Item Type:	Thesis (Other)
Subjects:	000 Computer Science, Information and General Works > 005 Computer programming, programs & data
Divisions:	Faculty of Computer Science
Depositing User:	Mr Ign. Setya Dwiana
Date Deposited:	27 Jan 2016 02:17
Last Modified:	27 Jan 2016 02:17
URI:	http://repository.unika.ac.id/id/eprint/7474

Actions (login required)

View Item