Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
A PROJECT REPORT
Submitted by
M. ANUSUYA (111613205005)
V. KALAIVANI (111613205018)
of
BACHELOR OF TECHNOLOGY
in
INFORMATION TECHNOLOGY
PUDUVOYAL
APRIL 2017
ANNA UNIVERSITY :: CHENNAI 600 025
BONAFIDE CERTIFICATE
supervision.
SIGNATURE SIGNATURE
Dr. D. PAULRAJ B.E., M.E., Ph.D Mr. A. MADHU M.E.,
R.M.K College of Engg. and Technology, R.M.K College of Engg. and Technology,
Our sincere thanks to Dr. D. Paulraj, the Head of the Department for
his continuous support and motivation throughout our project.
Last, but not the least, we take this opportunity to thank all the staff
members of the Department of Information Technology. Regards to our
family, classmates and friends who offered an unflinching moral
support for completion of this project.
ABSTRACT
Today, the increased traffic and complex modern road network have
made finding a good route from one location to another a non-trivial task.
There are many search algorithms that have been proposed to solve this
Johnson’s algorithm and A*. While these algorithms are effective for path
which uses better evaluation criteria and the notion of cumulative proximity
score. This proposed technique will reduce the time and space requirements
a sample application to find the shortest path between any two places in
Chennai city.