原文传递
COMPARISON OF DISAGGREGATE SIMPLICIAL DECOMPOSITION AND FRANK-WOLFE ALGORITHMS FOR USER-OPTIMAL ROUTE CHOICE.
| 题名： | COMPARISON OF DISAGGREGATE SIMPLICIAL DECOMPOSITION AND FRANK-WOLFE ALGORITHMS FOR USER-OPTIMAL ROUTE CHOICE. |
| 作者： | Tatineni-M; Edwards-H; Boyce-D |
| 关键词： | TRANSPORTATION-PLANNING; COMPARISONS-; ALGORITHMS-; ROUTE-CHOICE; CHICAGO-ILLINOIS; ORIGIN-DESTINATION; TRAVEL-TIME; OPTIMIZATION- |
| 摘要： | The disaggregate simplicial decomposition (DSD) method has been posed as a better alternative to existing algorithms for solving the deterministic user-optimal route choice model. The application of the DSD algorithm is compared and evaluated with the commonly used Frank-Wolfe (FW) algorithm on a large network in the Chicago area. The results indicate that the DSD algorithm performs much better than the FW with respect to reaching the optimality conditions specified by the model. |
| 总页数： | Transportation Research Record. 1998. (1617) pp157-162 (3 Fig., 2 Tab., 12 Ref.) |
| 报告类型： | 科技报告 |
相关文献
- LINK- AND PATH-BASED TRAFFIC ASSIGNMENT ALGORITHMS: COMPUTATIONAL AND STATISTICAL STUDY.
- ACCELERATING STRATEGIES AND COMPUTATIONAL STUDIES OF THE FRANK-WOLFE ALGORITHM FOR THE TRAFFIC ASSIGNMENT PROBLEM.
- Large-Scale Network Design Using Composite Variables: An Application to Air Mobility Command's 30-Day Channel Route Network
- COMBINED MODEL FOR TIME-DEPENDENT TRIP DISTRIBUTION AND TRAFFIC ASSIGNMENT.
- SOLUTION ALGORITHM FOR COMBINED INTERREGIONAL COMMODITY FLOW AND TRANSPORTATION NETWORK MODEL WITH LINK CAPACITY CONSTRAINTS.
检索历史
应用推荐
