Finding Least Cost Route For Joglo Semar Using Branch and Bround Algorithm

Fenny, (2008) Finding Least Cost Route For Joglo Semar Using Branch and Bround Algorithm. Other thesis, Fakultas Ilmu Komputer, UNIKA Soegijapranata.

Preview	Text (COVER) 04.02.0013 Fenny COVER.pdf Download (513kB) | Preview
	Text (BAB I) 04.02.0013 Fenny BAB I.pdf Restricted to Registered users only Download (328kB)
	Text (BAB II available document only in library of Soegijapranata Catholic University) 04.02.0013 Fenny BAB II.pdf Restricted to Repository staff only Download (336kB)
	Text (BAB III available document only in library of Soegijapranata Catholic University) 04.02.0013 Fenny BAB III.pdf Restricted to Repository staff only Download (336kB)
	Text (BAB IV available document only in library of Soegijapranata Catholic University) 04.02.0013 Fenny BAB IV.pdf Restricted to Repository staff only Download (337kB)
	Text (BAB V available document only in library of Soegijapranata Catholic University) 04.02.0013 Fenny BAB V.pdf Restricted to Repository staff only Download (411kB)
	Text (BAB VI) 04.02.0013 Fenny BAB VI.pdf Restricted to Registered users only Download (327kB)
Preview	Text (DAFTAR PUSTAKA) 04.02.0013 Fenny DAFTAR PUSTAKA.pdf Download (327kB) | Preview
Preview	Text (LAMPIRAN) 04.02.0013 Fenny LAMPIRAN.pdf Download (345kB) | Preview

Abstract

JogloSemar is short of Jogja, Solo and Semarang. It’s like shuttle service but only picked up points in a certain rute in Semarang, Jogja and Solo. At the moment, JogloSemar only pick up in one route, but they are planning to find the route dynamically. In this research, we will try to simulate it using 8 pick up points, that is Hotel Novotel, Hotel Graha Santika, Hotel Queen, Hotel Telomoyo, Hotel Ciputra, Hotel Siranda, Hotel Patra Jasa, Hotel Candi and the last point is Gombel street. The scopes of this research, pick up passengers will be done in 8 pick up points in semarang, but if one of the pick up point does’t have any passenger, that point would be passed routes will be looked for the shortest path visiting each pick up points that passenger to pick up. Based on the problem, Branch and Bound algorithm and tree data structure are used. Branch and Bound is method for searching systematic solution, in this case the solution would be organize to tree. Tree from at Branch and Bound algorithm build with scheme searching widely (BFS). Branch searching by see depend on smallest value or shortest path and then will explore to another branch from the point. This strategy called least cost searching. In conclusion, using Branch and Bound could give us the shortest path using all picked up points that has passengers. The route will have the least cost path.

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:18
Last Modified:	27 Jan 2016 02:18
URI:	http://repository.unika.ac.id/id/eprint/7450

Actions (login required)

View Item