By Topic

A heuristic algorithm for simulation-based dynamic traffic assignment

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

1 Author(s)
Mahut, M. ; Centre for Res. on Transp., Montreal Univ., Que., Canada

ITS technologies that aim to improve, and ideally optimize, the utilization of the transportation network require accurate and efficient traffic models and algorithms. For many applications, these models must solve the dynamic traffic assignment problem - i.e., to find the optimal path choices for all vehicles in the network - within a reasonable margin of error in the shortest possible time. This paper presents an iterative algorithm for the dynamic (time dependent) user-optimal assignment problem. The algorithm produces time-dependent assignments which, when used in a traffic simulation model, result in experienced path travel times that approximately satisfy user-optimal conditions. The model is tested on a small but challenging network, for which convergence (to equilibrium) results are compared with those obtained using a variant of the method of successive averages (MSA). The model results are also examined in detail by comparison with the exact equilibrium queue lengths determined analytically. The proposed model is found to perform very well under these tests, and to converge faster than the MSA.

Published in:

Intelligent Transportation Systems, 2005. Proceedings. 2005 IEEE

Date of Conference:

13-15 Sept. 2005