Efficient Algorithms for Solving Elastic Demand Traffic Assignment Problems and Mode Split-Assignment Problems

Larry J. LeBlanc and Keyvan Farhangian
Additional contact information
Larry J. LeBlanc: Vanderbilt University, Nashville, Tennessee
Keyvan Farhangian: Southern Methodist University, Dallas, Texas

Transportation Science, 1981, vol. 15, issue 4, 306-317

Abstract: Different algorithms for solving elastic demand traffic assignment problems and mode split-assignment problems are discussed. We note that there are different ways to implement the Frank-Wolfe technique to solve these problems and give the most efficient implementation. We then discuss Evans' procedure and compare it with the Frank-Wolfe technique. Computational results indicate that the Frank-Wolfe algorithm is unstable for the elastic assignment problem---its rate of convergence is very sensitive to values used for upper bounds on trips, which are purely artificial “tuning parameters.” Evans' algorithm is found to be more robust and to converge consistently faster than the Frank-Wolfe technique for both classes of problems studied.

Date: 1981
References: Add references at CitEc
Citations: View citations in EconPapers (14)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.15.4.306 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:15:y:1981:i:4:p:306-317

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().