Abstract Routing Models and Abstractions in the Context of Vehicle Routing
Authors: René Schönfelder, Martin Leucker
IJCAI 2015 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | The functional and the algebraic routing problem are generalizations of the shortest path problem. This paper shows that both problems are equivalent with respect to the concept of profile searches known from time-dependent routing. Because of this, it is possible to apply various shortest path algorithms to these routing problems. This is demonstrated using contraction hierarchies as an example. Furthermore, we show how to use Cousots concept of abstract interpretation on these routing problems generalizing the idea of routing approximations, which can be used to find approximative solutions and even to improve the performance of exact queries. |
| Researcher Affiliation | Academia | Ren e Sch onfelder and Martin Leucker Institute for Software Engineering and Programming Languages University of L ubeck, Germany |
| Pseudocode | No | The paper discusses algorithms conceptually but does not provide any pseudocode or clearly labeled algorithm blocks. |
| Open Source Code | No | The paper does not provide any concrete access information (link, explicit statement) to open-source code for the methodology described. |
| Open Datasets | No | The paper is theoretical and does not describe its own empirical experiments using a specific dataset, nor does it provide access information for any publicly available or open dataset. |
| Dataset Splits | No | The paper does not describe its own empirical experiments, and therefore does not provide specific dataset split information for validation. |
| Hardware Specification | No | The paper does not describe its own empirical experiments, and therefore does not provide specific hardware details used for running experiments. |
| Software Dependencies | No | The paper does not describe its own empirical experiments, and therefore does not provide specific ancillary software details with version numbers needed to replicate an experiment. |
| Experiment Setup | No | The paper does not describe its own empirical experiments, and therefore does not contain specific experimental setup details like hyperparameter values or training configurations. |