Instance data for "A Branch-and-Cut algorithm for an urban dial-a-ride problem" and "Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems"
- Link:
- Autor/in:
- Verlag/Körperschaft:
- Universität Hamburg
- Erscheinungsjahr:
- 2022
- Medientyp:
- Datensatz
- Beschreibung:
-
This data set includes the instances used in the paper "Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems" and the corresponding preprint "A Branch-and-Cut algorithm for an urban dial-a-ride problem".
The data set "DARP_TW_data.zip" contains the instances for the final calculations whereas the data set "DARP_TW_components_data.zip" includes the instances used in the preliminary test for the components.
- Lizenzen:
-
- https://creativecommons.org/licenses/by/4.0/legalcode
- info:eu-repo/semantics/openAccess
- Quellsystem:
- Forschungsdatenrepositorium der UHH
Interne Metadaten
- Quelldatensatz
- oai:fdr.uni-hamburg.de:10389