This page is a support for the course Transport Optimization. The page contains two things at the moment, slides from the lecture on the VIPS system (from the year 2000), and information about the computer exercise on traffic equlibria, including ascii files of some small scale network examples. For general information about the course, see the official course page.
In the below files you find data for some small networks. Data is arranged as follows:
Row 1: Number of links, number of nodes, number of OD pairs
Paragraph 1: The number of rows equals the number of OD pairs. For each OD pair, three constants are given: origin node (p), destination node (q), demand (d_{pq})
Paragraph 2: The number of rows equals the number of links in the network. The first two constants are the starting node (i) och ending node (j) for the link (i,j).
A link (i,j) is supposed to have a cost function which is a polynom. The information which is provided in the rest of the line is three constants defining the integrated cost term, that is, the terms in the objective function of the user equilibrium model. The integrated function is for the link (i,j) of the form:
a_{ij}f_{ij} + b_{ij}f_{ij}^{c_{ij}}
The three last numbers on each line is: a_{ij}, b_{ij}, c_{ij}.
At the end of the file you can find some information about the optimal objective value (the case of the user equilibrium model), in the sense that we provide the best upper and lower bounds known. This can be used to check that your coding of the problem is correct. Also, the origin of some of the networks in the literature is given. Copies can be made of the networks so that you can see what they look like..