Urban Transportation Networks: Equilibrium Analysis with Mathematical Programming Methods |
Contents
User Equilibrium | 2 |
FORMULATING THE ASSIGNMENT PROBLEM | 56 |
REVIEW OF SOME OPTIMIZATION ALGORITHMS | 81 |
Copyright | |
20 other sections not shown
Common terms and phrases
all-or-nothing assignment applied ārs assignment problem assumed automobile basic network Chapter choice probability congestion Convergence test convex combinations algorithm convex combinations method convex function demand function denote derivative descent direction discussed distribution/assignment problem dual variables equations equilibrium flow pattern excess-demand feasible region first-order conditions fixed-demand flow conservation flow units formulation given includes Jacobian Lagrangian linear program link flows link performance functions link travel logit model mathematical program minimum path modal split mode mode choice motorists network representation node nth iteration number of trips O-D flows O-D pair r-s O-D travel O-D trip rates objective function parameters path flows paths connecting perceived travel probit random random variable route Section sequence list shown in Figure solution solved stochastic network loading strictly convex subproblem supernetwork t₁ tion traffic assignment transportation travel-time trip distribution UE conditions UE problem UE program user equilibrium variable-demand vector x₁