Graph-Based Analysis and Optimization of Public Transport Headways

Read the full article See related articles

Discuss this preprint

Start a discussion What are Sciety discussions?

Listed in

This article is not in any list yet, why not save it to one of your lists.
Log in to save this article

Abstract

Public transport reliability is strongly influenced by the regularity of vehicle headways, defined as the time intervals between consecutive vehicles serving the same route. Irregular headways increase passenger waiting times, cause vehicle bunching, and reduce overall system efficiency. This paper presents a graph-based approach to the analysis and optimization of public transport headways, using the city of Bishkek, Kyrgyzstan, as a case study. The public transport network is modeled as a weighted graph, where stops are represented as vertices and route segments as edges. Headways are incorporated as temporal attributes associated with routes and vehicle movements. An optimization objective is formulated to minimize headway variability across selected routes. Using simulated operational data, the proposed approach demonstrates that graph-based modeling provides a flexible and effective framework for analyzing headway irregularities and evaluating optimization strategies. The results highlight the potential of graph-based methods to support planning and operational decision-making in urban public transport systems.

Article activity feed