Basemap
Digital Mapping & Transport Data Solutions

The Task

Calculating movement in complex networks is one of the most resource-intensive tasks in computer science. After relying on the battle-tested Dijkstra algorithm for a couple of years, Basemap decided to improve its core algorithm and add several new features.
This new algorithm was to be faster than Dijkstra and provide additional arrival and departure times.These times were to be exact, with zero approximate or stochastic outputs.

Communere's Approach

After understanding all of the project's business requirements, we did our research and developed an inventive modified version of the Round-Based Public Transit Routing algorithm. We then synergized with Basemap to come up with rigorous research and development sprints.
Through these sprints, the algorithm was successfully implemented and integrated into TRACC, a performance management platform. It was an incredibly elaborate algorithm, so we made sure the final implemented architecture was as clean as possible to facilitate further improvement and bug resolution.

The Results

By exploiting the internal structure of public transportation timetables, the algorithm significantly outperformed the previous methods regarding speed and optimality. The speed-up in such a core factor of the software dramatically improved user experience at Basemap.