Large-scale Ridesharing DARP Instances Based on Real Travel Demand

Citation Author(s):
David
Fiedler
Czech Technical University in Prague
Jan
Mrkos
Czech Technical University in Prague
Submitted by:
Jan Mrkos
Last updated:
Tue, 12/05/2023 - 03:52
DOI:
10.21227/dadk-s070
Data Format:
Research Article Link:
Links:
License:
0
0 ratings - Please login to submit your rating.

Abstract 

This dataset presents a set of large-scale Dial-a-Ride Problem (DARP) instances. The instances were created as a standardized set of ridesharing DARP problems for the purpose of benchmarking and comparing different solution methods.

The instances are based on real demand and realistic travel time data from 3 different US cities: Chicago, New York City, and Washington, DC. The instances consist of real travel requests from the selected period, positions of vehicles with their capacities, and realistic shortest travel times between all pairs of locations in each city.

The instances and results of two solution methods, the Insertion Heuristic and the optimal Vehicle-group Assignment method, can be found in the dataset. 

Links:

The dataset was presented at the IEEE International Conference on Intelligent Transportation Systems (ITSC 2023) in Bilbao, Bizkaia, Spain, 24-28 September 2023 (Session CON03)

Instructions: 

See the GitHub repository for download and usage instructions.

Dataset Files

    Files have not been uploaded for this dataset