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


    Access

    Download

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Timetable-Based Transit Assignment Using Branch and Bound Techniques


    Additional title:

    Transportation Research Record: Journal of the Transportation Research Board


    Contributors:


    Publication date :

    2001-01-01




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English




    Optimisation of timetable-based, stochastic transit assignment models based on MSA

    Nielsen, O. A. / Frederiksen, R. D. | British Library Conference Proceedings | 2006


    XML-Based Transit Timetable System

    Sun, W. / Bernstein, D. / Transportation Research Board | British Library Conference Proceedings | 2002


    XML-Based Transit Timetable System

    Sun, Wu / Bernstein, David | Transportation Research Record | 2002


    XML-Based Transit Timetable System

    Sun, Wu | Online Contents | 2002