Single User Class with Multiple OD Algorithm (Link-based), Yes, No -…
Single User Class with Multiple OD Algorithm (Link-based)
1. Initialization: Iteration 0
1.1 Find the shortest path w.r.t free flow condition (path-based boolean):
1.2. Perform AON, by assigning all flows to the shortest path (path-based flow):
1.3. Using incidence matrix to convert path-based to link-based flow:
Math notation: x^0*
This is because at the iteration 0, the FW algorithm is not involved. (Please refer to the if condition).
x^0 = x^0*
1.5. Flow-to-cost conversion by using BPR function w.r.t. the current user class. Note that all the parameters are defined in the edges list and stored via class:
1.6. Update the entire network based on
, i.e., the current link-flow. And reload the network via class function.
1.7. Store the link-flow status as x^0, for next iteration:
2. Main Algorithm with FW
Iteration n, n>0
1 more item...