52 pages matching network representation in this book
Results 1-3 of 52
What people are saying - Write a review
We haven't found any reviews in the usual places.
FORMULATING THE ASSIGNMENT PROBLEM
REVIEW OF SOME OPTIMIZATION ALGORITHMS
12 other sections not shown
all-or-nothing assignment alternative applied assignment problem assumed automobile Chapter choice probability computational congestion constraints convex combinations algorithm convex combinations method convex function demand function denote depicts derivative descent direction diagonalization algorithm discrete choice models discussed dual variables equations equilibrium flow pattern equivalent minimization feasible region first-order conditions flow conservation formulation given gradient Hessian includes intersection Lagrangian linear program link flows link performance functions link travel logit model mathematical program minimization program minimum path modal split mode mode choice motorists network loading models network representation nonnegativity nth iteration O-D flow O-D pair r-s O-D travel O-D trip rates objective function parameters path flows paths connecting perceived travel probit model random variable route Section shown in Figure solution solved stationary point stochastic network loading strictly convex subproblem supernetwork tion transit network transportation travel-time trip distribution UE conditions UE program urban user equilibrium utility variable-demand vector