J E Beasley

OR-Library is a collection of test data sets for a variety of OR problems.

A full list of the test data sets available in OR-Library can be found here.

Vehicle routing: spare feasibility graph

There are currently 8 data files.

These data files are the problems solved in J.E.Beasley 
and N.Christofides "Vehicle routing with a sparse
feasibility graph", European Journal of Operational Research 98
(1997) pp499-511.

Test problems 1, 2, ..., 8 from that paper are available
in files vrpfeas1, vrpfeas2, ..., vrpfeas8 respectively.

The format of these data files is:
number of customers, vehicle load capacity, vehicle distance limit
x-coordinate, y-coordinate for the depot
for each customer in turn: 
     x-coordinate, y-coordinate, delivery quantity, drop allowance
then the edges in the feasibility graph is the format:
customer number (i), customer number (j)
where the depot is denoted by customer number 0 and each
edge in the feasibility graph appears twice, once as
i,j and once as j,i

The files are of size 150Kb (approximately).

Click here to access these files