Multi-dimensional discrete choice problems are usually estimated by assuming a single-choice hierarchical order for the entire study population or for pre-defined segments representing the behavior of an “average” person and by indicating either limited differences or a variety in choices...

This paper focuses on path-based solution algorithms to the stochastic user equilibrium (SUE) and investigates their convergence properties. Two general optimization methods are adapted to solve the logit SUE problem. First, a method that closely follows the Gradient Projection (GP) algorithm...

The search for the shortest path constitutes the common practice in actual traffic studies, as this simplistic route choice model enables the universal implementation of traffic assignment and simulation procedures to every network configuration. The literature illustrates the large efforts in...

Several route choice models are reviewed in the context of the stochastic user equilibrium problem. The traffic assignment problem has been extensively studied in the literature. Several models were developed focusing mainly on the solution of the link flow pattern for congested urban areas. The...