Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: IEEE Transactions on Intelligent Transportation Systems
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
