Choice set generation with BFS-LE

Authors :: Felder, Matteo
Source :: Arbeitsberichte Verkehrs-und Raumplanung, 1772
Publication Year :: 2022
Publisher :: ETH Zurich, 2022.
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 using BFS-LE.<br />Arbeitsberichte Verkehrs- und Raumplanung, 1772