While public transit network design has a wide literature, the study of line planning and route generation under uncertainty is not so well covered. Such uncertainty is present in planning for emerging transit technologies or operating models in which demand data is largely unavailable to make predictions on. In such circumstances, this paper proposes a sequential route generation process in which an operator periodically expands the route set and receives ridership feedback. Using this sensor loop, a reinforcement learning-based route generation methodology is proposed to support line planning for emerging technologies. The method makes use of contextual bandit problems to explore different routes to invest in while optimizing the operating cost or demand served. Two experiments are conducted. They (1) prove that the algorithm is better than random choice; and (2) show good performance with a gap of 3.7% relative to a heuristic solution to an oracle policy.


    Zugriff

    Download

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Contextual Bandit-Based Sequential Transit Route Design under Demand Uncertainty


    Weitere Titelangaben:

    Transportation Research Record: Journal of the Transportation Research Board


    Beteiligte:


    Erscheinungsdatum :

    05.05.2020




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    Multi-Armed Bandit On-Time Arrival Algorithms for Sequential Reliable Route Selection under Uncertainty

    Zhou, Jinkai / Lai, Xuebo / Chow, Joseph Y. J. | Transportation Research Record | 2019


    Contextual Multi-Armed Bandit based Beam Allocation in mmWave V2X Communication under Blockage

    Cassillas, Arturo Medina / Kose, Abdulkadir / Lee, Haeyoung et al. | IEEE | 2023




    Constrained Contextual Bandit Learning for Adaptive Radar Waveform Selection

    Thornton, Charles E. / Buehrer, R. Michael / Martone, Anthony F. | IEEE | 2022