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

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].

本数据集共包含32个带时间依赖特性的取送货问题（Time Dependent Pick Up and Delivery Problem）实例，每个实例对应10至45个客户需求，节点总数为20至90个。
数据文件的第一行内容为车辆数量；
第二行内容为车辆的载货容量；
第三行内容为规划时间跨度。

[配送中心（Depot）]
格式为：序号; x坐标; y坐标; 0; 0;

[取货点（Pickup）]
格式为：序号; x坐标; y坐标; 0; 载货量; 收益; 最早时间窗; 最晚时间窗。

[送货点（Delivery）]
[取货点（Pickup）]
格式为：序号; x坐标; y坐标; 0; 载货量; 20; 最早时间窗; 最晚时间窗。

[速度档0（Speed 0）]
[速度档1（Speed 1）]
[速度档2（Speed 2）]
[速度档3（Speed 3）]
[速度档4（Speed 4）]
共包含5种不同的速度剖面（speed profile）。

[速度选择矩阵（speed choose matrix）]
说明：每条链路对应一种速度剖面。例如，链路(0,4)被分配至速度剖面1，其参数由[Speed 1]给出。