双约束Logit随机交通均衡问题的有效算法  

Efficient algorithm for logit stochastic traffic equilibrium problem with dual constraints

作　　者：刘炳全 潘丽静 度巍 LIU Bingquan;PAN Lijing;DU Wei(School of Mathematics and Physics,Weinan Normal University,Weinan,Shaanxi 714099,China;School of Transportation,Nantong University,Nantong,Jiangsu 226019,China)

机构地区：[1]渭南师范学院数理学院,陕西渭南714099 [2]南通大学交通学院,江苏南通226019

出　　处：《计算机工程与应用》2018年第17期221-224,237,共5页Computer Engineering and Applications

基　　金：国家自然科学基金(No.61402335);陕西省自然科学基金(No.2014JM2_1004);陕西省教育厅科研资助项目(No.16JK1267);渭南师范学院科研基金(No.15ZRRC04;No.17YKS10)

摘　　要：依据现实交通网络中路段容量与出行终点停车容量空间有限性的特征,建立带路段流量和终点需求双约束的Logit随机用户均衡问题的不动点模型,设计了一种有效的Lagrangian乘子法来求解,通过合理调整Lagrangian乘子使算法快速趋于收敛。在算法的迭代过程中,对通常Logit均衡问题则设计改进的自适应相继加权平均法来求解,使路段流量不超过相应路段容量并避免了繁琐的路线枚举,改进了算法的计算效率。数值实验验证了算法的有效性和结果的可行性。According to the characteristic of limited link capacity and demand capacity of travel destination, the paper proposes a Logit stochastic user equilibrium fixed model with dual constraints. The fixed model is solved by Lagrangian multiplier 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.

关 键 词：交通规划 需求管理 Logit随机用户均衡 Lagrangian乘子法 

分 类 号：U491[交通运输工程—交通运输规划与管理]