Curring the computational difficulty of the logit equilibrium assignment model
Type de document
ARTICLE DE PERIODIQUE
Résumé / Abstract
In the past, research in traffic assignment modeling has been directed primarily towards improving the deterministic model. This paper presents two mathematical contributions that enable one to solve a logit assignment model with flow-dependent travel times at a reduced cost. First, a convergence test for fisk's minimization program is introduced. Second, a new definition of dial's stoch fixed-time logit assignment procedure is given. A numerical experiment indicates that these tools make the logit assignment model very competitive compared to the procedures conventionally used for solving the deterministic model.