Transportation Network Test Problems
Under construction!
If you are working on transportation problems, and especially if you are developing algorithms for such problems, you probably asked yourself more than once: where can I get good data?
The purpose of this site is
to provide an answer for this question!!!
The site currently contains
several examples for the basic traffic assignment problem.
Suggestions and additional
data are always welcome.
DONATIONS
of datasets and other info
ARE
MOST WELCOME
LICENSE AGREEMENT
DATA SETS ARE FOR ACADEMIC RESEARCH PURPOSES ONLY. USERS ARE FULLY RESPONSIBLE FOR ANY RESULTS OR CONCLUSIONS OBTAINED BY USING THESE DATA SETS. USERS MUST INDICATE THE SOURCE OF ANY DATASET THEY ARE USING IN ANY PUBLICATION THAT RELIES ON ANY OF THE DATASETS PROVIDED IN THIS WEB SITE.
THE SITE HOST AND THE SITE MANAGER ARE NOT RESPONSIBLE FOR THE CONTENT OF THE DATA SETS. AGENCIES, ORGANIZATIONS, INSTITUTIONS AND INDIVIDUALS ACKNOWLEDGED IN THIS WEB SITE FOR THEIR CONTRIBUTION TO THE DATASETS ARE NOT RESPONSIBLE FOR THE CONTENT OR THE CORRECTNESS OF THE DATASETS.
The Traffic Assignment Problem is one of the
most basic problems in transportation research. Theoretical background can be
found in “The Traffic Assignment Problem – Models and Methods” by Michael
Patriksson, VSP 1994, as well as in many other references.
The datasets here are all compressed asci text files, using the following format.
First lines are metadata; each item has a description. Comment lines start with ‘~’.
Network files – one line per link; links are directional, going from “init node” to “term node”.
Link travel time = free flow time * ( 1 + B * (flow/capacity)^Power ).
Link generalized cost = Link travel time + toll_factor * toll + distance_factor * distance
Comment: the network files also contain a "speed" value for each link. In some cases the "speed" values are consistent with the free flow times, in other cases they represent posted speed limits, and in some cases there is no clear knowledge about their meaning. All of the results reported below are based only on free flow travel times as described by the functions above, and do not use the speed values.
The standard order of the fields in the network files is:
Init node, Term node, Capacity, Length, Free Flow Time, B, Power, Speed limit, Toll, Link Type;
The files are tab delimited. Each row is terminated by a semicolon.
The files contain several metadata fields. An important one is the <FIRST THRU NODE>. In the some networks (like Sioux-Falls) it is equal to 1, indicating that traffic can move through all nodes, including zones. In other networks when traffic is not allow to go through zones, the zones are numbered 1 to n and the <FIRST THRU NODE> is set to n+1.
Trip tables –
Origin origin#
destination# , OD flow ; …..
Braess Network; Trip Table; This simple example is for the famous Braess paradox network, prepared by Andrew Koh.
Sioux-Falls Network; Node Coordinates; Trip Table. Units: probably minutes and miles. (24 zones; 24 nodes; 76 links; toll factor=0 minutes/cent; distance factor=0 minutes/mile). Best-known link flows solution with Average Excess Cost (normalized gap) of 3.9E-15. Optimal objective function value: 42.31335287107440. A map (Reproduced by Hai Yang and Meng Qiang, Hong Kong University of Science and Technology.)
WARNING: The Sioux-Falls network is not considered as a realistic one. For comparison, see a map of the real city. However, this network was used in many publications. It is good for code debugging. It is also an opportunity to examine the data format.
All network data including the link numbers indicated on the map (but excluding node coordinates), are taken from the following paper: “An efficient approach to solving the road network equilibrium traffic assignment problem” by LeBlanc, L.J., Morlok, E.K., Pierskalla, W.P., Transportation Research Vol. 9, pp. 309-318, 1975. The links in the network file are sorted by their tail node, thus they do not follow the same order as the original publication. The units of free flow travel times are 0.01 hours, but they are often viewed as if they were minutes. Link lengths are set arbitrarily equal to free flow travel times. The parameters in the paper are given in the format of t=a+b*flow^4. The original parameter a is the free flow travel time given here. The original parameter b is equal to (free flow travel time)*B/(capacity^Power) in the format used here. In the data here the “traditional” BPR value of B=0.15 is assumed, and the given capacities are computed accordingly. Node coordinates were generated artificially to reproduce the diagram shown in the paper.
Walter Wong (kiwong@mail.nctu.edu.tw) points out that another version of the Sioux-Falls network appears in a different publication, “An algorithm for the Discrete Network,” LeBlanc, L.J., Transportation Science, Vol 9, pp 183-199, 1975. The difference between the two versions is that the free-flow travel times on links 15-19, 19-15, 15-22 and 22-15 are 4 instead of 3, and the free-flow travel time on links 10-16 and 16-10 are 5 instead of 4.
Andrew Koh (atmkoh@yahoo.co.uk) reports that a third version of the Sioux-Falls network has appeared in “Equilibrium Decomposed Optimization: A Heuristic for the Continuous Equilibrium Network Design Problem,” Suwansirikul, C., Friesz, T.L., Tobin, R.L., Transportation Science, Vol. 21(4), 1987, pp. 254-263. Click here for a list of differences between the two versions.
Gregor Laemmel (laemmel@vsp.tu-berlin.de) reports that the first published version of the Sioux-Falls network appears in "Development and Application of a Highway Network Design Model - Volumes 1 and 2," Morlok, E.K., Schofer, J.L., Pierskalla, Marsten, R.E., W.P., Agarwal, S.K., Stoner, J.W., Edwards, J.L., LeBlanc, L.J., and Spacek, D.T., Final Report to the Federal Highway Administration under contract number DOT-FH-11-7862, Department of Civil Engineering, Northwestern University, Evanston, Illinois, July 1973. Link lengths (in miles) are given the following file: Sioux-Falls Network, which is identical to the first version given here in all other attributes.
David Boyce (d-boyce@northwestern.edu) comments
that yet another slightly different version of the
Winnipeg
Network; Trip Table.
Units: need to check. (154 zones; 1067 nodes; 2975 links; toll factor=0;
distance factor=0). There are various versions of the
Anaheim
Network; Trip Table.
Units: length is in feet; free flow travel time in minutes; speed in feet per
minute. (38 zones; 416 nodes; 914 links; toll factor=0; distance factor=0). The
Barcelona Network; Trip Table. Units: probably minutes and km. (110 zones; 1020 nodes; 2522 links; toll factor=0; distance factor=0). In this network volume delay functions use high powers. Best-known link flows solution with Average Excess Cost of 2E-14. Optimal objective function value: 1265654.92203176.
Chicago
Sketch Network; Node
Coordinates; Trip
Table. Units: minutes, miles and cents. (387 zones; 933 nodes; 2950 links;
toll factor=0.02 minutes/cent; distance factor=0.04 minutes/mile). A fairly
realistic yet aggregated representation of the
Chicago
Regional Network; Node
Coordinates; Trip
Table. Units: minutes, miles and cents. (1,790 zones; 12,982 nodes; 39,018
links; toll factor=0.1 minutes/cent; distance factor=0.25 minutes/mile). A
large-scale, detailed representation of the
Philadelphia
Network (in the standard format, for the original older format click
here) ; Node
Coordinates; Trip
Table; Tolls.
Units: minutes, miles and cents. (1,525 zones; 13,389 nodes; 40,003 links; toll
factor=0.055 minutes/cent; distance factor=0). A large-scale network for the
Delaware Valley Region, provided by Dr. W. Thomas Walker, Manager, Office of
Corridor/Systems Planning,
Delaware Valley Regional Planning Commission,
An additional set of networks from the Berlin
area has been provided by Rolf Möhring (TU Berlin) Andreas Schulz
(MIT), and Nicolas Stier-Moses (
|
Network name |
Number of zones |
Number of nodes |
Number of links |
|
berlin_center |
865 |
12,981 |
28,376 |
|
friedrichshain_center |
23 |
224 |
523 |
|
mitte_center |
36 |
398 |
871 |
|
mitte_prenzlauerberg _friedrichshain_center |
98 |
975 |
2,184 |
|
prenzlauerberg_center |
38 |
352 |
749 |
|
tiergarten_center |
26 |
361 |
766 |
Supplementary Files
To get a simple source code that implements the Frank-Wolfe algorithm and demonstrates how to read these data formats click here Download FW. (This is NOT the source code for the OBA algorithm indicated below.)
Comment: the header file "stdafx.h" is related to the Microsoft Visual C (MSVC) compiler. On Unix and other compilers it can be simply omitted.
The high precision solutions presented here were produced by the Origin-Based Assignment (OBA) algorithm.
OBA executable for research purposes is now available from http://www.openchannelsoftware.org/projects/Origin-Based_Assignment/
For an example of a control file for the origin-based code click here.
You will need to change the input and output directory.
You will also need to change the input file names according to the network you choose to work with.
A script to convert CUBE trip tables to OBA format has been kindly provided by Birat Pandey.
A
vbs script to convert trip tables from OBA format to VISUM format has been
kindly provided by Wolfgang Scherr from PTV America.
Basic
scripts for mapping networks with Matlab
Links:
Test networks for the Asymmetric Network Equilibrium Problem
Comment: users have reported on problems with downloading data files using Netscape. Downloading seems to work fine with other browsers.
This site is managed by: Hillel Bar-Gera
Established: 2001
Last updated on
Updates History
Explanation about <FIRST THRU
NODE>, May 17, 2007.
Add Berlin area networks, May 17, 2007.
Add reference to third version of Sioux-Falls
(Suwansirikul), May 17, 2007.
Comments on the FW code, May 17, 2007.
Add map for Anaheim, April 12, 2007.
Change Philadelphia network file to standard
format, April, 12 2007.
Change file names to uniform convention with
*.txt, April 12, 2007.
Add an example “tui“ control file for the
origin-based assignment code, April 12, 2007.
Change the toll factors in the Chicago
networks, August 27, 2007. (The new toll factors are the ones originally used
in my own papers. For a certain period the toll factors indicated here were
zero, so it there may be publications reporting results with zero toll
factors.)
Add optimal OF values for different networks,
August 27, 2007.
Add link lengths from Morlok’s report to the Sioux
Falls network.
Update