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

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.

[1]  Ronald L. Rivest,et al.  Introduction to Algorithms, Second Edition , 2001 .

[2]  Lin Zhang,et al.  The research and improvement of AntNet algorithm , 2010, 2010 2nd International Asia Conference on Informatics in Control, Automation and Robotics (CAR 2010).

[3]  Dariusz Król,et al.  Modelling Shortest Path Search Techniques by Colonies of Cooperating Agents , 2009, ICCCI.

[4]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[5]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[6]  Peter Norvig,et al.  Artificial Intelligence: A Modern Approach , 1995 .

[7]  Nils J. Nilsson,et al.  Artificial Intelligence: A New Synthesis , 1997 .