Choice set generation with BFS-LE

Download
Full text (PDF, 330.9Kb)
Thumbnail
Open access
Author
Felder, Matteocc
Date
2022-08
Type
    Working Paper
Rights / license
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 Show more
Permanent link
https://doi.org/10.3929/ethz-b-000563401
Publication status
published
Journal / series
Arbeitsberichte Verkehrs- und Raumplanung
Volume
1772
Publisher
IVT, ETH Zurich
Subject
Choice set generation; BFS algorithm; MATSim
Organisational unit
03521 - Axhausen, Kay W. (emeritus) / Axhausen, Kay W. (emeritus)  
02655 - Netzwerk Stadt u. Landschaft ARCH u BAUG / Network City and Landscape ARCH and BAUG
More
Show all metadata
ETH Bibliography
yes
Altmetrics