A Full Analytical Implementation of the PARTAN/Frank–Wolfe Algorithm for Equilibrium Assignment

DOI10.1287/trsc.24.1.58zbMath0704.90027OpenAlexW2037498149MaRDI QIDQ3484604

Daniel van Vliet, Y. Arezki

Publication date: 1990

Published in: Transportation Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/trsc.24.1.58

zbMATH Keywords

traffic assignmentFrank-Wolfe algorithmequilibrium assignmentminimal step lengthPartan

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Deterministic network models in operations research (90B10) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (3)

Parametric Computation of Minimum-Cost Flows with Piecewise Quadratic Costs ⋮ Traffic equilibrium with a continuously distributed bound on travel weights: the rise of range anxiety and mental account ⋮ Postoptimizing equilibrium flows on large scale networks

This page was built for publication: A Full Analytical Implementation of the PARTAN/Frank–Wolfe Algorithm for Equilibrium Assignment