|
|
||||||||
Department of Industrial Engineering and Management, Ben-Gurion University, P.O.B. 653, Be'er-Sheva 84105, Israel
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.
bargera{at}bgumail.bgu.ac.il
This article has been cited by other articles:
![]() |
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] |
||||
![]() |
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] |
||||
![]() |
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 |