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

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.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 77 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.