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"

Schulz, Arne; Pfeiffer, Christian

doi:10.25592/uhhfdm.10027

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"

Publication date

2022-08-01

Document type

Forschungsdaten

Author

Schulz, Arne

Pfeiffer, Christian

Organisational unit

Institute of Operations Management, Universität Hamburg

DOI

10.25592/uhhfdm.10027

URI

https://openhsu.ub.hsu-hh.de/handle/10.24405/22232

Publisher

Zentrum für nachhaltiges Forschungsdatenmanagement, Universität Hamburg

Is supplement to

https://openhsu.ub.hsu-hh.de/handle/10.24405/22183

Part of the university bibliography

Nein

Language

English

Description

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.

Version

Published version

Access right on openHSU

Metadata only access