|
k | Route. |
a | Link. |
o | Origin. |
d | Destination. |
| Total demand for the od pair. |
| Set of all od pairs of the network. |
| Perceived route utility. |
| Deterministic route utility. |
| Uncertainty or error term. |
| Link error term. |
| Route choice set for od pair. |
| Number of routes listed in the route choice set per each od pair. |
| Flow of route k. |
| Link flow. |
| Dummy variable that equals 1 if link a belongs to route k. |
| Set of links that define the graph. |
| Aspiration level defined at the od level. |
| Vector containing all deterministic route utilities. |
| Tolerance or Indifference Band. |
| Dummy variable that equals 1 if route p is listed on the choice set. |
| Dummy variable that equals 1 if route q is listed on the choice set. |
| Set of satisficing routes. |
| User Equilibrium route travel time. |
| Users’ strict preference order for the pair. |
| Number of draws for the error term discretization. |
| Number of violations. |
| Pre-defined path convergence threshold. |
and | Scale and shape parameters of a gamma distribution. |
| Iterative counter of the MSA method. |
| Tolerance for the stopping criterium of the MSWA-I. |
| Maximum number of descent step iterations. |
| Free-flow travel time of link a. |
| Simulation period. |
| Number of assignment repetitions for BR-SUE and indifferent preferences search order. |
|