## A faster path-based algorithm for traffic assignment |

### From inside the book

Try this search over all volumes: **ям rst derivative lengths**

Results 1-0 of 0

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Common terms and phrases

Anaheim Network Volume applications Assign the ﬂows assignment algorithms centroid Civil and Environmental Comparison of F-W computational intensity COMPUTATIONAL STORAGE computer communication computer implementation issues constraint comers data structure demand constraints demand level descent direction dynamic assignment frameworks efﬁcient Environmental Engineering equilibrium assignment problem F-W algorithm F-W and GP Faster convergence ﬁeld ﬁnd ﬁnding ﬁrst derivative lengths ﬂow assignment ﬂow pattems Frank-Wolfe algorithm GP algorithm GP and F-W gradient projection algorithm Institute of Transportation Irvine iterations of GP Kaysi larger networks link ﬂows memory requirements microcoding negative gradient direction Network Volume level node network non-shortest path number of iterations O-D pair objective function origin-destination paper PARTAN path ﬂow solutions path-based solutions path-enumeration algorithms predecessor arcs second derivative lengths Shefﬁ(1 shortest path determination shortest path routine shortest path trees signiﬁcant speciﬁc Technion trafﬁc network Traﬂic Equilibrium Transportation Research Board Transportation Science Transportation Studies University of Califomia updated variables