Optimised Routing for Public Transport

This thesis develops algorithms to improve public transport journey planning in cities. The goal is to help passengers find faster, smoother trips with realistic walking times based on their own preferences, and quick responses to service disruptions. The algorithms allow journey planning tools to stay fast and accurate, even when many people use them during busy times. They also help adjust trips in real time when delays occur, guiding passengers to make better decisions on the go. Tested on real transport networks, this work demonstrates how it can support more efficient and user-friendly journey planning using smarter technology.