More information about the structures of problems is given in Holmberg and Yuan (2000) (although there are some small differences between the data used in that article and the data given here).
Any use of these problem data should be accompanied with a reference to the two articles above. You might also want to send me an email.
Data is given in two lists, one for the links and one for the demands, each ending with a row of zeros.
For each demand pair of nodes:
Demand number, origin, destination, demand amount.
The list ends with four zeros.
1 2 10000 50 0 2 3 10 0 1 400 60 0 0 0 0 0 1 1 3 13 0 0 0 0The link from node 1 to node 2 has high linear cost (10000), free capacity 50 and no fixed cost. The link from node 2 to node 3 has linear cost coefficient 10, no free capacity and one capacity step, with fixed cost 400 and capacity 60. Commodity 1 has origin at node 1, destination at node 3 and demand of 13 units.
In file 00index1 characteristics of each problem is given. On each line: Problem name, number of nodes, number of links, number of demand pairs, maximal number of capacity steps, number of links with nonzero fixed cost, total number of capacity steps, sum of all fixed costs, average fixed cost, sum of all linear cost coefficients, average linear cost coefficient, total demand, average demand.
Download all problem data in a zip-file.
Kaj Holmberg,
email: kaj.holmberg@liu.se,
homepage: http://www.kajh.se.
Division of Optimization,
Department of Mathematics,
Linköping Institute of Technology,
SE-581 83 Linköping,
SWEDEN.