| | | When designing a transportation network, it is crucial to account for crowding, as passengers consider it daily when choosing their routes. However, crowding is typically modeled using fixed-point algorithms that iteratively search for the system equilibrium, which can be computationally impractical.
How can crowding be approximated without relying on such iterative methods?
The goal of this project is to compare an exogenous priority queue approximation with a fixed-point algorithm and to design more sophisticated approximation methods. |