Below is a description of the format of the text file that defines each problem instance (assuming 100 customers). All constants are integers.
Customer number 0 denotes the depot, where all vehicles must start and finish.
K is the maximum number of vehicles.
Q the capacity of each vehicle.

'Ready time' is the earliest time at which service may start at the given customer/depot.
 'Due date' is the latest time at which service may start at the given customer/depot.
The value of travel time is equal to the value of distance.

_____________________________________________________________________
<Instance name>
<empty line>
VEHICLE
NUMBER     CAPACITY
  K           Q
<empty line>
CUSTOMER
CUST NO.  XCOORD.   YCOORD.    DEMAND   READY TIME  DUE DATE   SERVICE TIME
 <empty line>
    0       x0        y1         q0         e0          l0            s0  
    1       x1        y2         q1         e1          l1            s1  
  ...     ...        ...        ...        ...         ...           ... 
  100     x100      y100       q100       e100        l100          s100
_____________________________________________________________________