On uniqueness and proportionality in multi-class equilibrium assignment

• Published in: Transportation research. Part B: methodological Vol. 70; pp. 173 - 185
• Main Authors: Florian, Michael, Morosan, Calin D.
• Format: Journal Article
• Language: English
• Published: Elsevier Ltd 01.12.2014
• Subjects: Algorithms; Approximation; Dials; Mathematical analysis; Mathematical models; Network equilibrium; Networks; Path flows entropy; Proportionality; Transportation; Uniqueness; Uniqueness of path flows; Path flows entropy; Proportionality; Uniqueness of path flows; Network equilibrium
• ISSN: 0191-2615; 1879-2367
• DOI: 10.1016/j.trb.2014.06.011

•Frank-Wolf method yields equilibrium solutions with nearly unique path and class flows.•Bi-conjugate Frank-Wolf method presents this property, as well.•As the relative gap decreases, the fit to flows which satisfy proportionality is better.These findings make the parallel bi-conjugate method attractive when solving for equilibrium. Over the past few years, much attention has been paid to computing flows for multi-class network equilibrium models that exhibit uniqueness of the class flows and proportionality (Bar-Gera et al., 2012). Several new algorithms have been developed such as bush based methods of Bar-Gera (2002), Dial (2006), and Gentile (2012) that are able to obtain very fine solutions of network equilibrium models. These solutions can be post processed (Bar-Gera, 2006) in order to ensure proportionality and class uniqueness of the flows. Recently developed, the TAPAS, algorithm (Bar Gera, 2010) is able to produce solutions that have proportionality embedded, without requiring post processing. It was generally accepted that these methods for solving UE traffic assignment are the only way to obtain unique path and class link flows. The purpose of this paper is to show that the linear approximation method and some of its variants satisfy these conditions as well. In addition, some analytical results regarding the relation between steps of the linear approximation algorithm and the path flows entropy are presented.