双约束Logit随机交通均衡问题的有效算法-计算机工程与应用.PDFVIP

  • 4
  • 0
  • 约2.93万字
  • 约 4页
  • 2019-03-30 发布于天津
  • 举报

双约束Logit随机交通均衡问题的有效算法-计算机工程与应用.PDF

双约束Logit随机交通均衡问题的有效算法-计算机工程与应用

Computer Engineering and Applications 计算机工程与应用 2018 ,54(17) 221 ⦾工程与应用⦾ 用 双约束Logit 随机交通均衡问题的有效算法 应 1 1 2 刘炳全 ,潘丽静 ,度 巍 与 1 1 2 LIU Bingquan , PAN Lijing , DU Wei 程 g 1. 渭南师范学院 数理学院,陕西 渭南 714099 r 工 o 2. 南通大学 交通学院,江苏 南通 226019 . j 1. School of Mathematics and Physics, Weinan Normal University, Weinan, Shaanxi 714099, China 机 a 2. School of Transportation, Nantong University, Nantong, Jiangsu 226019, China 算 e c . LIU Bingquan, PAN Lijing, DU Wei. Efficient algorithm for logit stochastic traffic equilibrium problem with dual 计 constraints. Computer Engineering and Applications, 2018, 54 (17):221-224. ww Abstract :According to the characteristic of limited link capacity and demand capacity of travel destination, the paper pro- w poses a Logit stochastic user equilibrium fixed model with dual constraints. The fixed model is solved by Lagrangian mul- tiplier algorithm which can converge rapidly by mean of regulating the Lagrangian multiplier reasonably. In the iteration process, an improved method of successive weighted averages with self-regulated averaging schemes is designed to solve the general Logit stochastic equilibrium problem and can ensure gradually the links flow lower than corresponding capacity. The method can also improve the service efficiency by avoiding the route numeration. The model and algorithm are then validated by a network example. Key words :transportation planning; demand management; Logit stochastic user

文档评论(0)

1亿VIP精品文档

相关文档