Abstract
In this paper, dynamic congestion pricing methods are proposed. based on a bilevel programming formulation. The pricing methods take users' reaction into account to compute the prices and adopt a second-best link-based approach that sets upper bounds on the link prices. A gradient expression, for the change in total travel time as a function of the change in prices. is derived and utilized in a descent gradient-based solution algorithm, which aims at determining a solution with lower total travel time from one iteration to another. The pricing methods have been applied to a small network example. It is shown that pricing leads to savings in total travel time compared to the no-toll situation.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
