Path search and path selection

In the dynamic assignment, several paths are mostly found for an OD pair that a vehicle can take. The decision for one of the paths found via path selection is based on the generalized costs of the paths. The generalized costs consist of the travel time, distance, and link costs (General cost, travel distances and financial cost in the path selection).

The distribution of demand data to the paths can be done according to the following distribution models:

Choose whether you want path selection to be based on the travel time measured on paths or on the total of travel times on edges. In doing so, you define the calculation of generalized costs. The desired method of cost calculation can be selected in the parameters of dynamic assignment Cost for path distribution with Kirchhoff: (Attributes for calculating costs as a basis for path selection).

Superordinate topic:

Using the dynamic assignment add-on module

Related topics:

Calculation of paths and costs

Path search finds only the best possible path in each interval

Method of path selection with or without path search

Performing an alternative path search

Displaying paths in the network

Attributes of paths