南加利福尼亚州规划模型应用.pptVIP

  • 2
  • 0
  • 约1.82万字
  • 约 36页
  • 2020-03-31 发布于广东
  • 举报
The solution algorithm is summarized as follows, Step 0: Initialization. Perform all-or-nothing approach to assign trips using free flow travel costs , for each link on the empty network. Initial feasible solutions of link flows and O-D trips in a given peak period are obtained. Step 1: Update. The travel time on link is updated as and inverse demand function value is calculated. Step 2: Find a feasible descent direction. Use the updated travel time {ta} for an all-or-nothing assignment for the trips. It yields a set of auxiliary link flows. Step 3: Find optimal parameter. A linear

文档评论(0)

1亿VIP精品文档

相关文档