|
Equilibrium model: |
| OD pairs, subset of origin destination nodes, . |
| Set of user classes. |
| Set of paths for OD pair in departure time . |
| Set of shortest paths for OD pair and class in departure time interval . |
| Index of user class, . |
| Index of departure time interval, . |
| Index of origin-destination (OD) pair, . |
| Index of path, . |
| Index of shortest path for class , . |
| Number of users in class from OD pair , assigned to path in departure time . |
. | Optimal number of users in class from OD pair , assigned to path in departure time . |
| Generalized cost of path for user class in departure time . |
| Minimum generalized cost of OD pair for user class in departure time . |
|
Optimization algorithms: |
| Outer-loop iteration index. |
| Inner-loop iteration index. |
| Maximum number of outer-loop iterations. |
| Maximum number of inner-loop iterations. |
| The number of users in class on path in iteration . |
| The set of shortest paths in iteration for class . |
| The path flow distribution of the outer-loop iteration . |
| The path flow distribution of the inner-loop iteration . |
| The travel cost gap per user of the path flow distribution . |
| The total travel cost gap of the path flow distribution . |
| The total travel cost gap of the path flow distribution of OD pair in solution . |
| The threshold for the exploration rate of the inner loop. |
| The threshold for the convergence rate of the outer loop. |
|