Urban Transportation Networks: Equilibrium Analysis with Mathematical Programming Methods |
Contents
User Equilibrium | 2 |
TRIP DISTRIBUTION AND TRAFFIC ASSIGNMENT | 7 |
1 | 10 |
Copyright | |
20 other sections not shown
Common terms and phrases
all-or-nothing assignment arrival rate ārs assignment problem assumed automobile bisection method c₁ Chapter choice models choice probability computational congestion constraints convex combinations algorithm convex combinations method convex function curve demand function denote depicts derivative descent direction discussed distribution/assignment dual variables dz(x equations equilibrium flow pattern equivalent minimization feasible region first-order conditions flow conservation formulation given gradient Hessian includes intersection interval reduction Lagrangian linear program link flows link performance functions link travel logit model mathematical program minimization program minimum path modal split mode choice motorists nonnegativity nth iteration number of iterations O-D flow O-D pair r-s objective function optimal path flows paths connecting perceived travel probit random route Section sequence list shown in Figure solution solved stationary point step stochastic network loading strictly convex subproblem supernetwork t₁ tion traffic assignment travel-time trip distribution UE program user equilibrium variable-demand vector Vz(x x₁