A Schedule-Based Transit Assignment Model Addressing the Passengers’ Choice Among Competing Connections

Abstract

Transit assignment procedures need to reflect the constraints imposed by line routes and timetables. They require specific search algorithms considering transfers between transit lines with their precise transfer time. The paper will present such an assignment procedure for transit networks using a schedule-based search algorithm. In contrast to existing schedule-based search methods employing a shortest-path algorithm, the described procedure constructs connections using branch & bound techniques. This approach produces better results in cases where slow but cheap or direct connections compete with fast alternatives which are more expensive or require transfers. At the same time it significantly reduces computing time, thus facilitating the use of timetable-based assignment for big networks.