TY - DATA
T1 - Data underlying the publication: Graph Coarsening for Fugitive Interception
PY - 2024/11/25
AU - Irene van Droffelaar
UR - 
DO - 10.4121/07643762-6038-4ccc-bf94-4bf56b5abeae.v1
KW - Graph coarsening
KW - Network topology
KW - Fugitive interception
KW - Search problem
KW - Real-time optimization
N2 - <p>This repository is part of the Ph.D. thesis of Irene S. van Droffelaar, Delft University of Technology.</p><p><br></p><p><em>coarseningFIP.zip </em>contains all algorithms and data accompanying the paper "Graph Coarsening for Fugitive Interception":</p><ul><li>Directories <em>pruning</em>, <em>consolidate_nodes</em>, <em>heuristic</em>, and <em>onthefly</em> contain the algorithms for graph coarsening. The <em>heuristic</em> coarsening algorithm is the Python implementation of the algorithm proposed by Krishnakumari et al. (2020) and can also be found in <em>heuristic_coarsening.zip</em> and <a href="https://github.com/irene-sophia/HeuristicCoarsening" target="_blank">https://github.com/irene-sophia/HeuristicCoarsening</a>.</li><li>The directory <em>HPC_results</em> contains the results of the experiments for all five road networks for all algorithms.</li><li>The directory <em>analysis</em> contains the notebooks that analyze the experiments, also including the cross-evaluation, counting the numbers of nodes in each network, and the timing experiments. Most plots in the paper are generated in the <em>compare_methods.ipynb</em> notebook.</li><li>The directory <em>data</em> contains the coarsened networks resulting from each algorithm, and the simulated routes.</li><li>The directory <em>route_simulation</em> contains the route generation code.</li></ul><p><br></p><p><em>platypus-fork.zip</em> contains the optimization algorithm.</p><p><br></p>
ER -