Here you find pointers to instance definitions and  best known solutions for the 25 and 50 customer instances of Solomon's VRPTW benchmark problems from 1987. For the 100 customer instances you will find a table of the best known results, as reported to us. The version reported here has a hierarchical objective: 1) Minimize number of vehicles 2) Minimize total distance. Distance is Euclidean, and the value of travel time is equal to the value of distance between two nodes. Distance and time should be calculated with double precision, total distance results are rounded to two decimals in the tables below. Exact methods typically use a monolithic total distance objective and use integral or low precision distance and time calculations. Hence, results are not directly comparable.