Yulius, Yulius (2015) Mobile belitung tourism dengan algoritma genetika dan traveling salesman problem nearest neighbor = Mobile belitung tourism with genetic algorithm and traveling salesman problem nearest neighbour. Bachelor thesis, Universitas Pelita Harapan.
![Text [thumbnail of Text]](http://repository.uph.edu/style/images/fileicons/text.png)
Title.pdf
Restricted to Registered users only
Available under License Creative Commons Attribution Non-commercial Share Alike.
Download (1MB)
![Abstract [thumbnail of Abstract]](http://repository.uph.edu/style/images/fileicons/text.png)
Abstract.pdf
Available under License Creative Commons Attribution Non-commercial Share Alike.
Download (403kB)
![ToC [thumbnail of ToC]](http://repository.uph.edu/style/images/fileicons/text.png)
ToC.pdf
Available under License Creative Commons Attribution Non-commercial Share Alike.
Download (511kB)
![Chapter1 [thumbnail of Chapter1]](http://repository.uph.edu/style/images/fileicons/text.png)
Chapter1.pdf
Available under License Creative Commons Attribution Non-commercial Share Alike.
Download (416kB)
![Chapter2 [thumbnail of Chapter2]](http://repository.uph.edu/style/images/fileicons/text.png)
Chapter2.pdf
Restricted to Registered users only
Available under License Creative Commons Attribution Non-commercial Share Alike.
Download (3MB)
![Chapter3 [thumbnail of Chapter3]](http://repository.uph.edu/style/images/fileicons/text.png)
Chapter3.pdf
Restricted to Registered users only
Available under License Creative Commons Attribution Non-commercial Share Alike.
Download (2MB)
![Chapter4 [thumbnail of Chapter4]](http://repository.uph.edu/style/images/fileicons/text.png)
Chapter4.pdf
Restricted to Registered users only
Available under License Creative Commons Attribution Non-commercial Share Alike.
Download (1MB)
![Chapter5 [thumbnail of Chapter5]](http://repository.uph.edu/style/images/fileicons/other.png)
Chapter5.PDF
Restricted to Registered users only
Available under License Creative Commons Attribution Non-commercial Share Alike.
Download (640kB)
![Bibliography [thumbnail of Bibliography]](http://repository.uph.edu/style/images/fileicons/text.png)
Bibliography.pdf
Available under License Creative Commons Attribution Non-commercial Share Alike.
Download (344kB)
![Appendices [thumbnail of Appendices]](http://repository.uph.edu/style/images/fileicons/text.png)
Appendices.pdf
Restricted to Repository staff only
Available under License Creative Commons Attribution Non-commercial Share Alike.
Download (662kB)
![Publication Agreement [thumbnail of Publication Agreement]](http://repository.uph.edu/style/images/fileicons/text.png)
Publication Agreement.pdf
Available under License Creative Commons Attribution Non-commercial Share Alike.
Download (3MB)
Abstract
Belitung is well known as one of the top destinations in Indonesia. To get information regarding to recommended place in Belitung. The source of information can be implemented to be a online application on mobile device “Belitung Tourism” which might be useful for tourist who looking for the accurate information relate to Belitung tourism. “Belitung Tourism” application has a core feature such as “Trip Planner” which beneficial to tourist to plan their trip. This application accomplished with trip price estimation feature. This feature can be applied by genetic algorithm and using traveling salesman problem. This application was generated by doing twice of experimentals to find out; does the application organize the trip appropriately with budget which already decided and sorted based on destination implementation of traveling salesman problem nearest neighbour algorithm. “Belitung Tourism” application already implement the genetic algorithm successfully to create upright trip planning, further the implementation of traveling salesman problem nearest neighbour algorithm can increase the efficiency of time and distance to go to the destination that already set up. The efficiency can be proven by the result of the first testing which shows 100% accuracy in every trip planning and the second testing which is better in trip planning. Travelling salesman problem algorithm was not implemented in the first testing which caused the improvement in the second testing. The addition of said algorithm leads to the conclusion that second testing is the best test.
Item Type: | Thesis (Bachelor) |
---|---|
Creators: | Creators NIM Email ORCID Yulius, Yulius NIM08220110002 YULIUS.ZHANG@YAHOO.COM UNSPECIFIED |
Contributors: | Contribution Contributors NIDN/NIDK Email Thesis advisor Hareva, David Habsara NIDN0316037206 UNSPECIFIED Thesis advisor Lazarusli, Irene Astuti NIDN0317097501 UNSPECIFIED |
Additional Information: | SK 82-11 YUL m |
Subjects: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science |
Divisions: | University Subject > Current > Faculty/School - UPH Karawaci > School of Information Science and Technology > Informatics Current > Faculty/School - UPH Karawaci > School of Information Science and Technology > Informatics |
Depositing User: | Mr Samuel Noya |
Date Deposited: | 04 Oct 2018 07:27 |
Last Modified: | 06 Aug 2021 07:21 |
URI: | http://repository.uph.edu/id/eprint/1162 |