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

Public ISBD Titre : Algorithms for the traffic assignment problem with fixed demand Type de document : texte imprimé Auteurs : Arezki, Yazid, Auteur ; D. Van Vliet, Directeur de thèse Editeur : [England] : Leeds: [s.n.] Année de publication : 1987 Importance : 243 f. Présentation : ill. Format : 30 cm. Note générale : 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. 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.

Réservation

Réserver ce document

Exemplaires (1)

Code-barres	Cote	Support	Localisation	Section	Disponibilité	Spécialité	Etat_Exemplaire
D002687	D002687	Papier	Bibliothèque Annexe	Thèse de Doctorat	Disponible	Autre	Consultation sur place

Branch and bound for the mixed integer linear program / Arezki, Yazid (1983)

Public ISBD Titre : Branch and bound for the mixed integer linear program Type de document : texte imprimé Auteurs : Arezki, Yazid, Auteur ; Corner, Lewis J., Directeur de thèse Editeur : University of Sussex Année de publication : 1983 Importance : 83 f. Présentation : ill. Format : 30 cm. Note générale : Mémoire de Magister : Informatique : Leeds, Univrsity of Sussex : 1983 Annexe f. 83 - 130. Bibliogr. [2] f Langues : Anglais (eng) Mots-clés : Mixed  Integer -- linear Index. décimale : M005983 Résumé : The aim of this project is to reviex the theory and practice of the branch and bound techniques employed for solving mixed (pure) integer problems. A computer program has been developed on the pet to solve restricted set of problems by the branch and bound method. the user is required to load the program and specify its problem coefficients. the program will follow an automatic excution if wanted. If not the user has to input the node and the branching variable wanted. Branch and bound for the mixed integer linear program [texte imprimé] / Arezki, Yazid, Auteur ; Corner, Lewis J., Directeur de thèse . - University of Sussex, 1983 . - 83 f. : ill. ; 30 cm. Mémoire de Magister : Informatique : Leeds, Univrsity of Sussex : 1983 Annexe f. 83 - 130. Bibliogr. [2] f Langues : Anglais (eng) Mots-clés : Mixed  Integer -- linear Index. décimale : M005983 Résumé : The aim of this project is to reviex the theory and practice of the branch and bound techniques employed for solving mixed (pure) integer problems. A computer program has been developed on the pet to solve restricted set of problems by the branch and bound method. the user is required to load the program and specify its problem coefficients. the program will follow an automatic excution if wanted. If not the user has to input the node and the branching variable wanted.

Réservation

Réserver ce document

Exemplaires (1)

Code-barres	Cote	Support	Localisation	Section	Disponibilité	Spécialité	Etat_Exemplaire
M005983	M005983	Papier + ressource électronique	Bibliothèque Annexe	Mémoire de Magister	Disponible	Autre	Consultation sur place/Téléchargeable