Performance Analysis of Dijkstra, A* and Ant Algorithm for Finding Optimal Path Case Study : Surabaya City Map

Santoso, Leo Willyanto and Setiawan, Alexander and PRAJOGO, ANDRE KURNIAWAN (2010) Performance Analysis of Dijkstra, A* and Ant Algorithm for Finding Optimal Path Case Study : Surabaya City Map. In: MICEEI 2010, 27-10-2010 - 28-10-2010, Makassar - Indonesia.

[thumbnail of Full Paper]
Preview
 PDF (Full Paper)
Full_Paper.pdf
Download (2MB)
[thumbnail of Plagiarism Check]
Preview
 PDF (Plagiarism Check)
Plagiarism.pdf
Download (1MB)
[thumbnail of peer review]
Preview
 PDF (peer review)
30_peerreview.pdf
Download (1MB)

Abstract

The purpose of this research is to make an application to compare search algorithm routes between the three algorithms used in the search for optimal route so that the results of the third comparison of these algorithms can be determined which algorithms are suitable for searching the optimal route.

Item Type: Conference or Workshop Item (Paper)
Uncontrolled Keywords: Djikstra, A*, Ant algorithm
Subjects: Q Science > QA Mathematics > QA76 Computer software
Divisions: Faculty of Industrial Technology > Informatics Engineering Department
Depositing User: Admin
Date Deposited: 12 Feb 2015 10:41
Last Modified: 07 Sep 2021 06:07
URI: https://repository.petra.ac.id/id/eprint/16969

Actions (login required)

View Item
View Item