Structure of instances

For each problem instance a .txt file is provided.
All coordinates and distance values are indicated in 1/100 kilometers. All time value are indicated in 1/100 minutes.
The length of the planning period 480min and time to pickup or drop off a container is 10min.
Each file contains the following information (in this order):

General problem information:

X-coordinate for the vehicle depot
Y-coordinate for the vehicle depot
number of container terminals/depots
number of loaded container pickup requests (shippers)
number of loaded container delivery requests (consignees)
number of empty container demand locations (shippers)
number of empty container supply locations (consignees)

Information on the final am-TSPTW network:
- For each node (vehicle depot is node 0):
- Distance matrix (infeasible links have a distance of 100000)
- Travel time matrix (infeasible links have a travel time of 100000)
Detailed problem information (used to construct the final network):

For the vehicle depot and each loaded container transport task:
- X-coordinate origin
- Y-coordinate origin
- X-coordinate destination
- Y-coordinate destination
- start of time window at origin
- end of time window at origin
- task distance
- task duration (=distance+service time)
- a dummy variable (0 for all requests)
For each empty container demand location:

X-coordinate
Y-coordinate
start of time window
end of time window

For each empty container supply location:

X-coordinate
Y-coordinate
start of time window
end of time window

For each container terminals:

X-coordinate
Y-coordinate
Opening time
Closing time