Choice set generation with BFS-LE

Download
Full text (PDF, 330.9Kb)
Thumbnail
Open access
Autor(in)
Felder, Matteocc
Datum
2022-08
Typ
    Working Paper
Rechte / Lizenz
In Copyright - Non-Commercial Use Permitted
Abstract
The Breadth First Search on Link Elimination (BFS-LE) algorithm is a deterministic route choice set generation algorithm developed by Michael Balmer. In this brief note we describe a MATSim compatible pipeline to generate and analyse non-chosen alternatives in the context of route choice modelling Mehr anzeigen
Persistenter Link
https://doi.org/10.3929/ethz-b-000563401
Publikationsstatus
published
Zeitschrift / Serie
Arbeitsberichte Verkehrs- und Raumplanung
Band
1772
Verlag
IVT, ETH Zurich
Thema
Choice set generation; BFS algorithm; MATSim
Organisationseinheit
03521 - Axhausen, Kay W. (emeritus) / Axhausen, Kay W. (emeritus)  
02655 - Netzwerk Stadt u. Landschaft ARCH u BAUG / Network City and Landscape ARCH and BAUG
Mehr
Alle Metadaten anzeigen
ETH Bibliographie
yes
Altmetrics