Data for: The time-dependent pickup and delivery problem with time windows

Published: 8 Aug 2018 | Version 1 | DOI: 10.17632/t2m8vny25k.1
Contributor(s):

Description of this data

This dataset contains 32 instances of the time dependent pick up and delivery problem with 10 to 45 customer request (20 to 90 nodes).

the first row is number of vehicles
the second row is vehicle's capacity
the third row is planning time horizon

[Depot]
idx; x-coordinate; y-coordinate; 0; 0;

[Pickup]
idx; x-coordinate; y-coordinate; 0; load; profit; earliest time window; latest time window.

[Delivery]
[Pickup]
idx; x-coordinate; y-coordinate; 0; load; 20; earliest time window; latest time window.

[Speed 0]
[Speed 1]
[Speed 2]
[Speed 3]
[Speed 4]
Five different speed profile;

[speed choose matrix]
For each links, it has a speed profile. For instances, the link (0,4) is assigned with speed profile 1, which is given by [Speed 1].

Experiment data files

This data is associated with the following publication:

The time-dependent pickup and delivery problem with time windows

Published in: Transportation Research Part B

Latest version

  • Version 1

    2018-08-08

    Published: 2018-08-08

    DOI: 10.17632/t2m8vny25k.1

    Cite this dataset

    Sun, Peng; Hewitt, Mike; Veelenturf, Lucas; Van Woensel, T. (2018), “Data for: The time-dependent pickup and delivery problem with time windows”, Mendeley Data, v1 http://dx.doi.org/10.17632/t2m8vny25k.1

Statistics

Views: 598
Downloads: 193

Categories

Transport, Operations Research, Smart Transportation, Road Transportation

Licence

CC0 1.0 Learn more

The files associated with this dataset are licensed under a Public Domain Dedication licence.

What does this mean?

You can copy, modify, distribute and perform the work, even for commercial purposes, all without asking permission.

Report