The following sequence applies to the bicycle assignment:
1. Calculation of the impedance in the network.
2. Route search
- Calculation of one route per origin-destination pair with the shortest path search
- Generation of more routes by varying the impedance (optionally considering the detour test)
3. Route preselection
4. Calculation of the independence, which takes into account the similarity of routes among themselves
5. Calculation of the choice impedance as the sum of the impedance of traversed network objects and the impedance components on the level of the path and correction with independence factor
6. Route choice: Distribution of demand to routes
