By Topic

Determining route traffic flows for traffic assignment problem with Frank-Wolfe algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Feng Li ; Dept. of Autom., Tsinghua Univ., Beijing, China ; Shuning Wang

In this paper we consider how to determine route traffic flows for traffic assignment problem (TAP). A new approach is proposed for this purpose. It determines the route traffic flows indirectly. It solves the problem based on the solution of the link based model for the user equilibrium TAP given by LeBlanc but without enumerating all routes of the concerned traffic network explicitly. In this approach a modified Frank-Wolfe algorithm is first applied to obtain link traffic flows with different destinations for TAP, which are then used to determine the route traffic flows by a new algorithm. A simple numerical example is given to illustrate the availability of the new approach. A comparison between the new approach and the other algorithms are made.

Published in:

Intelligent Vehicles Symposium, 2005. Proceedings. IEEE

Date of Conference:

6-8 June 2005