This repository contains python implementation of the modified breadth first search link elimination algorithm used for generating route choice sets in a network. The algorithm was originally proposed by Rieser-Schussler et al. (2013). The modified version, which generates unique routes instead of just routes, was used in my master's thesis and can be accessed here. An augmented version of my thesis is now out as a paper and can be accessed here.
The main code used for the choice set generation can be found in code.py file. An example network (created using a random graph generation algorithm), and the output from the code for this network are presented in the data and generated_files folders, respectively.
If you find an error in the code, feel free to open an issue here on github and I will try to resolve it at the earliest. Alternatively, feel free to write to me at dtahlyan [@] u [.] northwestern [.] edu
If you find BFS_LE useful, please cite the paper and/or thesis. Thank you!
@article{tahlyanperformance,
title={Performance Evaluation of Choice Set Generation Algorithms for Analyzing Truck Route Choice: Insights from Spatial Aggregation for the Breadth First Search Link Elimination (BFS-LE) Algorithm},
author={Tahlyan, Divyakant and Pinjari, Abdul Rawoof}
year={2020},
journal={Transportmetrica A: Transport Science},
publisher={Taylor \& Francis}
}
@article{tahlyan2018performance,
title={Performance Evaluation of Choice Set Generation Algorithms for Modeling Truck Route
Choice: Insights from Large Streams of Truck-GPS Data},
author={Tahlyan, Divyakant},
year={2018}
}
Please also cite the original paper that proposed the BFS_LE algorithm.
@article{rieser2013route,
title={Route choice sets for very high-resolution data},
author={Rieser-Sch{\"u}ssler, Nadine and Balmer, Michael and Axhausen, Kay W},
journal={Transportmetrica A: Transport Science},
volume={9},
number={9},
pages={825--845},
year={2013},
publisher={Taylor \& Francis}
}