Below is shown the contents of the file showing the optimal
solution to E-22-4.

Each route is shown on a separate line, giving the order of visit
of the customers on the route. For example, the first route is
Depot-10-9-7-5-2-1, so this route ends at customer 1. The length
of this path is 67.600795, and the total demand of the customers
on the route is 58. The last line, "CAP = 60", gives the vehicle
capacity.

Distances are calculated using floating-point arithmetic with
double precision. No rounding is done on the calculated distances.

The "n" and "k" in the usual file naming convention have been 
omitted, e.g., "E-22-4" is used instead of "E-n22-k4".

Optimal solution to COVRP instance E-22-4:
-----------------------------------------------------
Route = 10 9 7 5 2 1, Demand = 58, RLen = 67.600795
Route = 12 15 18 20 17, Demand = 59, RLen = 61.577238
Route = 13 11 8 6 3 4, Demand = 52, RLen = 77.964350
Route = 14 16 19 21, Demand = 56, RLen = 45.471440
Sum of route lengths = 252.613823
CAP = 60
-----------------------------------------------------