超车
数学优化
光学(聚焦)
班级(哲学)
计算机科学
交通拥挤
路径(计算)
非线性系统
流量网络
运筹学
工程类
数学
运输工程
计算机网络
人工智能
光学
量子力学
物理
作者
Enrique Del Castillo,Aida Calviño,Santos Sánchez‐Cambronero,Hong K. Lo
标识
DOI:10.1109/tits.2013.2247041
摘要
In this paper, we deal with the traffic assignment problem solving a multiclass equilibrium problem. In particular, we focus our analysis on when the overtaking of vehicles is permitted. A new family of link travel time functions is presented, which allows us to reproduce the same asymptotic congestion behavior of several overtaking classes to mimic the fact that high congestion impedes overtaking and that all classes must have identical link travel times. This family is generated based on local linear convex combinations of travel time Bureau of Public Roads (BPR) functions. A nonlinear complementary problem (NCP), which does not require path enumeration, is used to solve the user-optimal traffic assignment. An example is used to show the proposed methods and techniques. In particular, a case in which cars and motorcycles share the network is analyzed under congested and uncongested conditions.
科研通智能强力驱动
Strongly Powered by AbleSci AI