Electric Two-Echelon Vehicle Routing Problem

Benchmark instances

If you find any mistakes or have additional material to add please feel free to contact me at ulrich.breunig@univie.ac.at. Thank you.

Textfiles, extension ".dat"
Lines starting with a "!" are human readable comments and can be disregarded by the reading routine.
First we specify truck characteristics in one line: Number of trucks, capacity, cost per distance, fixcost.
Then we specify city freighter characteristics: Max. number of city freighters per satellite, total number of city freighters available, capacity, cost per distance, fixed cost, maximum charging level, energy consumption per distance
Then we define depot and satellites in one line: x,y coordinates of the depot
Then all x,y coordinates, handling cost per unit, maximum capacity, fixed cost of the satellites.
Then we define all the customers in one line: x,y,demand.
Finally we set the locations for the charging stations. Note that the coordinates of the satellites are doubled also here, as we assume that every satellite also serves as a charging station, plus some additional locations of course.
Distances are calculated Euclidean and rounded to the nearest integer. To avoid rounding errors when comparing with instances from the classic 2EVRP instances (no charging stations) we multiplied the x- and y-coordinates by 10.