Perpustakaan Unika
Project Report
Finding Least Cost Route For Joglo Semar Using Branch and Bround Algorithm Fenny 04.02.0013
FACULTY OF COMPUTER SCIENCE SOEGIJAPRANATA CATHOLIC UNIVERSITY Jl. Pawiyatan Luhur IV/1, Bendan Duwur, SEMARANG 50234 Telp. 0248441555 (hunting) Web: http://www.unika.ac.id Email:
[email protected]
2008
Perpustakaan Unika
APPROVAL AND RATIFICATION PAGE
PROJECT REPORT
Finding Least Cost Route For Joglo Semar Using Branch and Bround Algorithm
This Project Report has been approved and ratifed by Dean of Faculty of Computer Science on ........................
With the approval,
Examiner, Examiner,
Suyanto EA, Ir, M.sc Rosita Herawati, ST, MIT Nip : 058.1.1992.116 Nip : 058.1.2004.263
Supervisor, Dean of Faculty of Computer Science,
Daniel Adinugroho,ST, MIT Ridwan Sanjaya, SE, S.Kom, MS.IEC Nip : 058.1.2005.265 Nip : 058.1.2002.252
ii
Perpustakaan Unika
STATEMENT OF ORIGINALITY I, the undersigned: Name : Fenny Nim : 04.02.0013 Hereby certify that the project I made was the result of masterpiece alone and it is not a plagiarism, except those, stated in print that it taken from other writing. If it is proved in later days that the project is the result of rubbing, hence I settle for sanction.
Semarang, 25 January 2008
FENNY Nim : 04.02.0013
iii
Perpustakaan Unika
FOREWORD Thanks for God, for all the bless that given to me so write could finish this final project that have title finding least cost route for Joglo Semar using Branch and Bound algorithm. In this opportunity, writer also say thanks very much for : 1) Ridwan Sanjaya, SE, S.Kom, MS.IEC. Dean of Faculty of Computer Science 2) Daniel Adinugroho, ST, MIT. Counselor Lecturer, thanks for the tuition so the write have a spirit to finish this project 3) All lecture and staff computer science thanks for all knowledge, tuition and advice to writer 4) Mother and father that give me support and love 5) Thanks for my brother John, SE and my sister , and also my beloved boy friend Erwin, BBA that give me support and love 6) And all my friends that always supporting me, help me past through this project Last but not least, i would like to apologize if i made mistake in finishing the project and writing this report therefore, critics and suggestions are expected.
Semarang, January 2008 Fenny
iv
Perpustakaan Unika
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.
v
Perpustakaan Unika
TABLE OF CONTENTS APPROVAL AND RATIFICATION PAGE..........................................................II STATEMENT OF ORIGINALITY.......................................................................III FOREWORD.........................................................................................................IV ABSTRACT............................................................................................................V TABLE OF CONTENTS.......................................................................................VI TABLE OF OBJECTS.........................................................................................VII CHAPTER I INTRODUCTION..............................................................................8 1.1 BACKGROUND...........................................................................................8 1.2 SCOPE...........................................................................................................9 1.3 OBJECTIVES................................................................................................9 CHAPTER II LITERATURE STUDY..................................................................10 2.1 DATA STRUCTURED ..............................................................................10 2.1.1 TREE...................................................................................................10 2.1.2 GRAPH................................................................................................11 2.2 ALGORITMA.............................................................................................12 2.2.1 DJIKSTRA...........................................................................................12 2.2.2 BRANCH AND BOUND....................................................................13 CHAPTER III PLANNING...................................................................................15 3.1 RESEARCH METHODOLOGIES.............................................................15 3.1.1 INCREMENTAL.................................................................................15 3.2 PROJECT MANAJEMENT........................................................................17 CHAPTER IV ANALYSIS AND DESIGN.........................................................18 4.1 ANALYSIS.................................................................................................18 4.2 DECOMPOSITION....................................................................................19 4.3 DESIGN......................................................................................................20 CHAPTER V IMPLEMENTATION AND TESTING..........................................25 5.1 DYNAMIC SIDE OF THE SOFTWARE ..................................................25 5.2 GUI..............................................................................................................25 5.3 IMPLEMENTATION ISSUES...................................................................26 5.4 TESTING....................................................................................................27 CHAPTER VI CONCLUSION..............................................................................31 6.1 CONCLUSION...........................................................................................31 6.2 FURTHER RESEARCH ............................................................................31 REFERENCES.......................................................................................................32 APPENDIX............................................................................................................33
vi
Perpustakaan Unika
TABLE OF OBJECTS Figure 4.1 Use case Diagram ................................................................................19 Figure 4.2 Decomposition......................................................................................20 Figure 4.3 Class Diagram.......................................................................................21 Figure 4.4 ReadingFile, Result...............................................................................22 Figure 4.5 MapMatrix, Djikstra, ShortMatrix........................................................23 Figure 4.6 BranchAndBound, Node.......................................................................24 Figure 4.7 Gui, NodeBNB.....................................................................................25 Figure 5.1 Result Read File....................................................................................28 Figure 5.2 Matrix Init.............................................................................................28 Figure 5.3 Matrix1.................................................................................................28 Figure 5.4 Matrix2.................................................................................................29 Figure 5.5 GUI Layout...........................................................................................29 Figure 5.6 Layout result.........................................................................................30 Figure 5.7 Layout clear..........................................................................................30 Figure 5.8 Layout button exit clicked....................................................................31
vii
