Assignment Tools#

"" helps you to perform the computation of a dynamic user assignment (DUA). It works by alternatingly running the simulation to discover travel times and then assigning alternative routes to some of the vehicles according to these travel times. This is repeated for a defined number of iteration steps. At least two files have to be given as input the script: a SUMO-network and a set of trip definitions. A stochastic user-equilibrium (UE)traffic state is not guaranteed after the assignment. Increasing the number of iteration steps increases the likelyhood of convergence to equilibrium.

Within each iteration step, the script generates a configuration file for the duarouter application and starts it with this configuration file. Then, a configuration file for sumo is built and sumo is started. Both configuration files are completely defined within the script itself. As default, for each time step, SUMO will generate three dump files with edge-dumps aggregated over 150, 300, and 900s, a summary information as well as a trip information output. The names of these outputs are numbered according to the iteration step. If you want to change the outputs, you also have to take a look into the script, but you should not disable the edge-based dump for aggregation over 900s, because this is read by the duarouter in the next iteration steps in order to compute the DUA.

For further options to the script look either at the source code or start it with the "--help" option. -n <PATH_TO_SUMO_NET> -t <PATH_TO_TRIPS>

Furthermore a calibrator option is available in the script to call the Cadyts calibration tool, developed by Gunnar Flötteröd at EPFL, Switzerland. With this option, route choices will be adjusted according to given link counts. The validation work of the calibration between SUMO and Cadyts is work in progress.

The provides a variant of the dynamic user assignment. The assignment method is the same one which SUMO and the use. Given trips will be assigned to respective fastest routes according to their departure times and a given travel-time updating interval. Different travel-time updating intervals can be defined by users, such as 900, i.e. link travel times will be updated every 900 sec. If the travel-time updating interval is set to -1, link travel times will not updated and link trave times at free-flow speeds are used for all trips.

A stochastic user-equilibrium traffic state will not achieved with the use of this script.

An exemplary execution command is shown below. -f <travel-time updating interval> -n <network file> -t <trip file>

 where -f travel-time updating interval (sec); -1 means no travel-time updating (default: -1,1800,300,15)
       -n network file name and the respective path
       -t trip file name and the respective path

Additional setting, such as outputs of summary and trip-information as well as begin time, could be made by adding respective options which can be found in the script.

In comparison to the and the the is applied to execute a macroscopic traffic assignment. Three types of macroscopic traffic assignments are available here: an incremental assignment, a stochastic user equilibrium assignment (SUE) based on the c-logit model by Cacessta (1996) and a logit- based SUE model based on the utility function by Lohse. The c-logit model is set as default. In addition, a k-shortest-paths algorithm has also been implemented in these two SUE models with a default value of 8.

Furthermore the applied route searching algorithms are based on Dijkstra. Three variants are available:

  • Dijkstra plain: travel time penalties for turning movements are not considered.
  • Dijkstra extend: travel time penalties for turning movements are considered.
  • Dijkstra boost: it is used to speed up route searching and travel time penalties for turning movements are considered here.

In oder to use this script the other scripts are required, i.e.,,,,, as well as These scripts should locate in the same directory with the Each of these scripts is briefly described below.

This script is to define the classes and functions for

  • reading network geometric,
  • calculating link characteristics, such as capacity, travel time and link cost function,
  • recording vehicular and path information, and
  • conducting statistic tests.

This script is to retrieve the network data, the district data and the vehicle data, generated by SUMO, from the respective XML files. Besides, the class 'Net' is also defined here.

The Dijkstra algorithm is used for searching the respective shortest paths and is based on the script from David Eppstein, UC Irvine. Moreover, this script is to find the shortest path from the given origin 'start' to the other nodes in the investigated network. The link information about the shortest paths and the corresponding travel times will be stored in the lists P and D respectively. Three variants are available: Dijkstra plain, Dijkstra extend as well as Dijkstra boost.

This script is to retrieve the given incremental assignment parameters, OD districts and the defined matrix from input files. Moreover, the link travel time for district connectors will be estimated.

This script is for generating the outputs from the choosed traffic assignment.

This script is for executing traffic assignment according to the user-defined assignment model. The above-mentioned incremental assignment model, the C-Logit assignment model and the logit assignment model based on the utility function by Lohse are included in this script.

This file defines global tables used to:

  • define the parameters in link cost BPR-functions, proposed by the Bureau of Public Roads (BPR). Link travel times are then calculated based the defined functions.
  • define the capacity and the respective cost function for each link
  • conduct significance tests

The following exemplary command is to show how to execute an assignment with the use of the -e <assignment method> -i 10 -d <districts file> -m <matrix file> -n <network file> -s <traffic singal files> -+ <Dijkstra type>

where: -e: the assignemnt method: incremental, lohse, clogit (default: clogit)
       -i: the number of maximal iterations for the SUE assignments; the number of iterations for an incremental assignment (default: 20)
       -d: district file name and the respective path
       -m: matrix file name and the respective path
       -n: network file name and the respective path
       -s: additional traffic signal timing files (optional)
       -+: the used Dijkstra-method: plain, extend, boost (default: boost)

Changes of parameters setting regarding convergence criteria are possible with the use of respective options in the script.

In addition, the script is to run assignment tests with different assignment methods.

This script is to calculate the global performance indices according to SUMO-based simulation results. The calculation functions are directly defined in this script. Basis statistics are delivered, such as:

  • average travel time (s)
  • average travel length (m)
  • average travel speed (m/s)
  • average departure delay (s)
  • average waiting time (s)

Besides, this script is also to execute a significance test for evaluating the results from different assignment methods. The t test and the Kruskal-Wallis test are available in this script. If not specified, the Kruskal-Wallis test will be applied with the assumption that data are not normally distributed.

In order to execute this script, the other two scripts, i.e. and, are required. They all should be in the same directory.

In the, classes regarding vehicles, their performance measures, t values, H values as well as functions for outputs are defined. The chi-square table and the t table are defined in the

An exemplary command is shown below. -t <tripinfo files> -o <output file> -e

where -t: name of output files containing vehicle information, generated by SUMO
      -0: define the output file name
      -e: set true for applying the t test (default: false)
      -k: set true for applying the Kruskal-Wallis test (default: false)

This script is to generate hourly matrices from a VISUM daily matrix. The traffic demand of the traffic zones, which have the same connection links, will be integrated. The exemplary command is indicated below. -m <matrix file> -z <district file> -t <flow time-series file> -o 

<output directory>

where -m: matrix file name
      -z: district file name
      -t: name of the file containing traffic flow time series (optional); If not specified, the defined 
          daily matrix will be regularly divided into 24 hours.
      -o: output directoy name and the respective path

Run duarouter repeatedly and simulate weight changes via a cost function. (to be continued)

Still under construction!

This script is to add the information of traffic analysis zones, i.e. origin and destination zone, in a given route file. Such information is required in a given route file when applying the calibrator option in the script A trip file, containing traffic zones information, is required when executing this script.

With the use of the following command, required traffic zones information can be added in a given route file. -r <route file> -t <trip file>