A Branch-and-Cut algorithm for the dial-a-ride problem with incompatible customer types - instance data

Link:

https://doi.org/10.25592/uhhfdm.11183

Autor/in:

Verlag/Körperschaft:

Universität Hamburg

Erscheinungsjahr:

2023

Medientyp:

Datensatz

Beschreibung:

This data set includes the instances used in the paper "A Branch-and-Cut algorithm for the dial-a-ride problem with incompatible customer types". The data set "DARP_incomp_data.zip" contains the instances for the final calculations whereas the data set "DARP_incomp_components_data.zip" includes the instances used in the preliminary test for the components.

Beziehungen:

DOI 10.25592/uhhfdm.11182

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:11183