Algorithms for the traffic assignment problem with fixed demand / Arezki, Yazid (1987)

Algorithms for the traffic assignment problem with fixed demand [texte imprimé] / Arezki, Yazid, Auteur ; D. Van Vliet, Directeur de thèse . - [England] : Leeds: [s.n.], 1987 . - 243 f. : ill. ; 30 cm.
PhD Thesis : Civil Engineering : England, Institute for transport studies : 1987
Bibliogr. f. 235 - 243
Langues : Anglais (eng)

Mots-clés :	Algorithms Traffic Assignment problem Fixed demand
Index. décimale :	D002687
Résumé :	This thesis develops new and improved algorithms for the equilibrium assignment problrm with fixed demand and assesses the performance of these algorithms empirically by carrying out computer tests on realistic networks of varying sizes. Part A deals with the so called 'symmetric case' where the travel cost on a link is a function of the flow on that link only. We studied many different modifications to the standard frank-wolfe algorithm such as partan, heuristic partan, accelerated method and generalisation of algorithms proposed by fukushima and Lupi. In the partan technique an essential substep is the calculation of a lower bound at each iteration; we prove that it can be written as a simple analytical formulae.