RouteOptima is a Final Year Project (FYP) built by Group 36 at IIMS College. It provides a web-based interface to compute the shortest drivable route between any two points across five districts of Nepal's Bagmati Province: Kathmandu, Bhaktapur, Lalitpur, Nuwakot, and Dhading.
Real road network data is pulled from OpenStreetMap using the osmnx library and stored locally as a GraphML file. The graph is loaded into memory once, and subsequent route queries run in milliseconds.
The core algorithm is Dijkstra's Shortest Path First (SPF), implemented via NetworkX. Users can search any place — a tea shop, a school, a bank — by name and instantly compute the shortest route.