原文传递
DYNAMIC CAPACITATED USER-OPTIMAL ROUTE CHOICE PROBLEM.
| 题名： | DYNAMIC CAPACITATED USER-OPTIMAL ROUTE CHOICE PROBLEM. |
| 作者： | Chen-H-K; Wang-C-Y |
| 关键词： | ALGORITHMS-; LAGRANGIAN-FUNCTIONS; ORIGIN-AND-DESTINATION; ROUTE-CHOICE; TRAVEL-TIME; VALIDATION- |
| 摘要： | Link capacity side constraints are explicitly incorporated into the variational inequality-based dynamic user-optimal route choice problem. The corresponding dynamic capacitated user-optimal conditions for each origin-destination pair and time interval state that the generalized route travel times (composed of route travel times and queuing delays) experienced by travelers are equal and minimal. An augmented Lagrangian dual method that embeds the gradient projection algorithm is then proposed and validated with a numerical example. The computational performance of the gradient projection algorithm is also compared with the disaggregate simplicial decomposition algorithm in a preliminary attempt. |
| 总页数： | Transportation Research Record. 1999. (1667) pp16-24 (1 Fig., 5 Tab., 12 Ref.) |
| 报告类型： | 科技报告 |
相关文献
- COMPARISON OF LINK-BASED VERSUS ROUTE-BASED ALGORITHMS IN THE DYNAMIC USER-OPTIMAL ROUTE CHOICE PROBLEM.
- GAME-THEORETIC FORMULATIONS OF INTERACTION BETWEEN DYNAMIC TRAFFIC CONTROL AND DYNAMIC TRAFFIC ASSIGNMENT.
- COMPARISON OF DISAGGREGATE SIMPLICIAL DECOMPOSITION AND FRANK-WOLFE ALGORITHMS FOR USER-OPTIMAL ROUTE CHOICE.
- MULTICLASS DYNAMIC TRAFFIC ASSIGNMENT MODEL: FORMULATION AND COMPUTATIONAL EXPERIENCES.
- STOCHASTIC USER EQUILIBRIUM FORMULATION FOR GENERALIZED NESTED LOGIT MODEL.
- QUASI-VARIATIONAL INEQUALITY APPROACH TO MULTI-USER-CLASS DYNAMIC TRAFFIC ASSIGNMENT.
检索历史
应用推荐
