Implementation Free And Branch And Bound Algorithm in TSP Programing

Tanaka, Danny Kuraniawan (2010) Implementation Free And Branch And Bound Algorithm in TSP Programing. Other thesis, Fakultas Ilmu Komputer, UNIKA Soegijapranata.

Preview	Text (COVER) 05.02.0024 Danny Kurniawan Tanaka COVER.pdf Download (241kB) | Preview
	Text (BAB I) 05.02.0024 Danny Kurniawan Tanaka BAB I.pdf Restricted to Registered users only Download (67kB)
	Text (BAB II available document only in library of Soegijapranata Catholic University) 05.02.0024 Danny Kurniawan Tanaka BAB II.pdf Restricted to Repository staff only Download (73kB)
	Text (BAB III available document only in library of Soegijapranata Catholic University) 05.02.0024 Danny Kurniawan Tanaka BAB III.pdf Restricted to Repository staff only Download (51kB)
	Text (BAB IV available document only in library of Soegijapranata Catholic University) 05.02.0024 Danny Kurniawan Tanaka BAB IV.pdf Restricted to Repository staff only Download (106kB)
	Text (BAB V available document only in library of Soegijapranata Catholic University) 05.02.0024 Danny Kurniawan Tanaka BAB V.pdf Restricted to Repository staff only Download (224kB)
	Text (BAB VI) 05.02.0024 Danny Kurniawan Tanaka BAB VI.pdf Restricted to Registered users only Download (46kB)
Preview	Text (DAFTAR PUSTAKA) 05.02.0024 Danny Kurniawan Tanaka DAFTAR PUSTAKA.pdf Download (70kB) | Preview

Abstract

This program try to find the shortest path from many cities using branch and bound algorithm. But branch and bound algotithm is not perfect algorithm. In some cases we will see that Branch and bound algorithm doesn't work well. So this program made a solusion to solve that problem. That is with recursive branch and bound. Recursive branch and bound is looking all path using branch and bound to find the destination cities then compare all of path. After that we will find the shortes path from the cities This program was made with Java language programming and using tree for saving the route of cities. Branch and bound algorithm is used to get the shortest path. With branch and bound algorithm we can predicting all possible path then find the shortest path from that

Item Type:	Thesis (Other)
Subjects:	000 Computer Science, Information and General Works > 004 Data processing & computer science
Divisions:	Faculty of Computer Science
Depositing User:	Mr Ign. Setya Dwiana
Date Deposited:	27 Jan 2016 02:15
Last Modified:	27 Jan 2016 02:15
URI:	http://repository.unika.ac.id/id/eprint/7491

Actions (login required)

View Item