欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
依据局部近视的用户均衡原则建立了有边约束的网络交通流分配模型。新模型将一般的边约束和放松了的节点流量守恒条件分别转换为两个变分不等式,并将这些变分不等式与一般的基于路段交通流分配模型相结合简化了问题的约束集和求解。利用一般边约束概念,定义了广义的路段和路径行程费用。提出了＂优先出牌＂与＂在途调整弹性＂两个择路行为假设,并利用两种假设解释了现实网络中路径流量唯一的原因。依据出行者的择路行为设计了模型的求解算法。数值算例验证了模型及算法的有效性。研究表明,设计的算法可避免迭代求解起讫点对间最短路径,同时体现不同出行者择路行为的灵活性;从拥挤收费和路段排队延误的角度对有边约束的流量分配模型的计算结果进行了有效解释。
英文摘要：
This paper built one side constrained traffic assignment model based on local nearsighted user equilibrium principle.It transformed the generic side constraints and relaxed flow conservation conditions at nodes to two variational inequalities.Combining these inequalities with the common used traffic assignment model that based on links simplified the constraint set and the solution of the model.By using the side constraints,defined the generalized link and path travel costs.Two behavior assumptions of choosing paths,that was,priority of playing cards and elasticity of route adjusting on route,were given to explain why a unique path flow pattern exists in real network.According to the behavior assumptions,proposed one solution algorithm.Gave several numeral examples to prove the validity and efficiency of the model and related algorithm.Results show that the algorithm avoids solving the shortest paths connecting origins with destinations and embodies the flexibility of different travelers＇ behaviors of choosing paths.At the same time,the results for the side constrained model can be explained effectively by congestion pricing and queuing delay on links.
同期刊论文项目
同项目期刊论文
期刊信息
位置：