Benchmark instances for the Dial-a-Ride Problem with meeting points
Published: 20 February 2023| Version 1 | DOI: 10.17632/h5392z6csr.1
Contributor:
Lianne CortenbachDescription
The original instances are retrieved from http://neumann.hec.ca/chairedistributique/data/darp/branch-and-cut/, and adjusted such that they contain vertices to represent the meeting points. The number in the column di indicates the service time duration for all pick up and delivery vertices. For the meeting points this number indicates if the meeting point can be used as a pick up meeting point (0), a delivery meeting point (1) or both (2).
Files
Categories
Vehicle Routing Problem, Mixed Integer Programming