Purnomo, Adi Cahyo and Yuliana, Mieke and Prasetyaningrum, Ira (2011) Implementasi algoritma Greedy pada layanan call center taksi wisata berbasis web. EEPIS Final Project.
|PDF - Published Version |
Download (220Kb) | Preview
Information and telecommunication technology growth now make us easy to access some information over internet, for accessing news, information and transaction. This service gives an easy to use interface to make the user easily accessing the information faster and reliable, anytime and also every where. Such as this system for online booking for vacation. This final project is building and designing a taxi service that use greedy algorithm inside to find the best path of TSP problem. This final project proposes informations about vacations place, such as a ticket, how to get there, and how long you spend time to visit it. This system will give you a time management table, so you?ll have a fix vacations time. The result of this final project is a web booking taxi system service, which allowed users to choose any vacation places all over Yogyakarta and know information of every place. We hope this system can help everyone who never visit some place. Thay can get information about how much they paid and how long their vacation time. Using greedy algorithm is faster in time to compute, it need 0,075 second to count 6 node. And average time to count for every node is 0,005 second. Greedy algorithm is high availability in time computing but not optimal in optimization.
|Subjects:||Q Science > QA Mathematics > QA75 Electronic computers. Computer science|
Q Science > QA Mathematics > QA76 Computer software
|Divisions:||Faculty of Engineering, Science and Mathematics > School of Electronics and Computer Science|
|Depositing User:||Mrs fariny masna|
|Date Deposited:||15 Apr 2011 21:09|
|Last Modified:||15 Apr 2011 21:09|
Actions (login required)