Example PhD

Graph theoretical models for bus routing and scheduling

Supervisor: Dr C.L. Mumford

Keywords: Bus routing and scheduling, metaheuristic algorithms, graph algorithms.

We have noted that bus routing and scheduling, despite its importance, is not a well studied problem in the academic literature. Most work seems to focus on specific urban areas and bespoke solutions. There is a shortage of generic models and benchmark data. We have undertaken some successful preliminary work on bus routing, which was the subject of a recently completed PhD study. We now plan to establish good graph theoretical models and suitable measurement parameters, to obtain a better understanding of both bus routing and scheduling. Furthermore, we intend to develop new heuristic and metaheuristic techniques that will solve large problems and tackle real world constraints.

Key Skills/Background: Open to computing or mathematics graduates and postgraduates.

Contact: Dr C.L. Mumford to discuss this research topic.