Transportation Science
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


TRANSPORTATION SCIENCE
Vol. 36, No. 4, November 2002, pp. 398-417
DOI: 10.1287/trsc.36.4.398.549
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via HighWire
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Bar-Gera, H.
Right arrow Search for Related Content

Origin-Based Algorithm for the Traffic Assignment Problem

Hillel Bar-Gera

Department of Industrial Engineering and Management, Ben-Gurion University, P.O.B. 653, Be'er-Sheva 84105, Israel
bargera{at}bgumail.bgu.ac.il

We present an origin-based algorithm for the traffic assignment problem, which is similar conceptually to the algorithm proposed by Gallager and Bertsekas for routing in telecommunication networks. Apart from being origin-based, the algorithm is different from other algorithms used so far for the traffic assignment problem by its restriction to acyclic solutions and by the use of approach proportions as solution variables. Projected quasi-Newton search directions are used to shift flows effectively and to eliminate residual flows. Experimental results comparing the proposed algorithm with the state-of-the-practice algorithm of Frankand Wolfe demonstrate the algorithm's excellent convergence performance, especially when highly accurate solutions are needed. Reasonable memory requirements make this algorithm applicable to large-scale networks. The resulting solution has an immediate route flow interpretation, thus providing equivalent detail to route-based solutions.

History: Received: April 2000; revised: April 2001; revised: August 2001; accepted: August 2001.




This article has been cited by other articles:


Home page
Transportation ScienceHome page
F. Babonneau and J.-P. Vial
An Efficient Method to Compute Traffic Assignment Problems with Elastic Demands
Transportation Science, May 1, 2008; 42(2): 249 - 260.
[Abstract] [PDF]


Home page
Transportation ScienceHome page
S. Lu
Sensitivity of Static Traffic User Equilibria with Perturbations in Arc Cost Function and Travel Demand
Transportation Science, February 1, 2008; 42(1): 105 - 123.
[Abstract] [PDF]


Home page
Transportation ScienceHome page
H. Bar-Gera
Primal Method for Determining the Most Likely Route Flows in Large Road Networks
Transportation Science, August 1, 2006; 40(3): 269 - 286.
[Abstract] [PDF]




HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
Copyright © 2002 by INFORMS.