Front Office
Institut Teknologi Sepuluh Nopember Surabaya

Kampus ITS Sukolilo - Surabaya 60111

Phone : 031-5921733 , 5923623
Fax : 031-5937774
E-mail :
Website :

Support (Customer Service) :


Have a problem with your access?
Please, contact our technical support below:

Davi Wahyuni

Tondo Indra Nyata

Anis Wulandari

Ansi Aflacha

ITS » Undergraduate Theses » Teknik Informatika
Posted by at 20/09/2011 16:42:59  •  5474 Views


Author :
PRASAMYA, SATRIA ( 5106100030 )


Penentuan jalur rute terpendek diperlukan karena dalam kehidupan sering dilakukan perjalanan dari satu tempat ke tempat yang lain dengan mempertimbangkanefisiaensi waktu jarak tempuh dan biaya. secara umum terdapat dua metode yang dapat digunakan untuk menentukan jalur terpendek yaitu metode konvensional dan metode heuristik. untuk menghitung rute yang lebih besar digunakan metode heuristik karena waktu yang dibutukan lebih singkat . Salah satu mtode yang terkenal baik dalam perhitungan rute terpendek yang termasuk dalam metode heuristik adalah metode Ant Colony Optimization yang diambil dari perilaku koloni semut dalam pencarian jalur terpendek antara sarang dan sumber makanan.Terinspirasi dari hal tersebut dalam makalah ini akan diimplementasikan sebuah aplikasi yang berjalan pada mobile system android. Aplikasi ini memanfaatkan metode ant colony optimization dalam pencarian rute terpendek dengan menggunakan teknologi Google Maps. User Google Map dirasa tepat mengingat google menyediakan informasi map yang paling lengkap diantara penyedia map yang lain. Selain itu Google Maps akan menghasilkan sebuah aplikasi pencarian rute terpendek yang memudahkan user karena akan mendapat gambaran yang lebih detail tentang rute yang dicari. User dapat melakukan pencarian rute jalur terpendek yang dituju dengan memasukkan kota asal dan kota-kota tujuan. Uji coba ini di lakukan melalui beberapa skenario yang mencerminkan fitur fitur yang ada di aplikasi. Hasil uji coba pada tugas akhir ini juga menunjukkan adanya efisiensi waktu dengan menggunakan aplikasi karena terdapat perkiraan waktu yang disediakan oleh Google Map sehingga berguna bagi user


Determining the shortest path is frequently necessary in our daily lives since we often take trips from one place to another and take into account the time efficiency distance and how much they cost. Generally there are two methods in determining the shortest paths the conventional method and heuristic method to measure greater paths. The heuristic method is used since it requires less time. One of the well-known methods in determining the shortest paths which is also classified as a heuristic method is the Ant colony optimization. Named based on the similarity behavior with ant colonies that look for the shortest paths between their nests and the sources of foods. Inspired by this phenomenon an application that runs in Android mobile system is to be implemented in this final project. This application uses of the method of Ant Colony Optimization in determining the shortest paths by using the technology of Google Maps. The procedure that uses Google Maps is believed to be acceptable considering the fact that Google provides the most comprehensive map information compared to other map providers. In addition Google Maps would generate an attractive shortest-paths-searching application enables the users to acquire more detailed illustration on the desired paths easier The users would be able to search their shortest routes by entering the place of origin and the destination to the system.The testing of this application is conducted through several scenarios. The test result l also showed a time efficiency by using the application because there are an estimated time provided by Google Map so useful to the user

KeywordsJalur terpendek; metode Ant Colony; Google Map ;Mobile System Android
Subject:  Android (sistem operasi)
  1. Ary Mazharuddin S., S.Kom, M.Comp.Sc
Date Create: 10/02/2011
Type: Text
Format: pdf
Language: Indonesian
Identifier: ITS-Undergraduate-3100011042824
Collection ID: 3100011042824
Call Number: RSIf 005.43 Pra p

Undergraduate Thesis, Informatics Engineering, RSIf 005.43 Pra p, 2011

ITS Community

Copyright @2011 by ITS Library. This publication is protected by copyright and per obtained from the ITS Library prior to any prohibited reproduction, storage in a re transmission in any form or by any means, electronic, mechanical, photocopying, reco For information regarding permission(s), write to ITS Library

[ Download - Open Access ]

  1.  ITS-Undergraduate-15271-Abstract_en-pdf.pdf - 346 KB
  2.  ITS-Undergraduate-15271-Conclusion-pdf.pdf - 344 KB
  3.  ITS-Undergraduate-15271-Paper-pdf.pdf - 375 KB

 Similar Document...


To facilitate the activation process, please fill out the member application form correctly and completely

Registration activation of our members will process up to max 24 hours (confirm by email). Please wait patiently


Bagaimana pendapat Anda tentang layanan repository kami ?

Bagus Sekali

You are connected from
using CCBot/2.0 (

Copyright © ITS Library 2006 - 2021 - All rights reserved.
Dublin Core Metadata Initiative and OpenArchives Compatible
Developed by Hassan