Documents disponibles chez cet éditeur

Optimal fleet size of container vehicles / Djamal Ahmed Touati

Public ISBD Titre : Optimal fleet size of container vehicles Type de document : texte imprimé Auteurs : Djamal Ahmed Touati, Auteur ; J. Brooks, Directeur de thèse Editeur : Southampton : [s.n.] Année de publication : 1983 Importance : 169 f. Présentation : ill. Format : 29 cm. Note générale : Master of science : Mathematics : University of southampton : 1983 Bibliogr. f. 95 Langues : Anglais (eng) Mots-clés : Size Container Vehicles Index. décimale : Ms01483 Résumé : The problem of finding the optimal number of vehicles needed for ACT's trade levels is tackled by developing a relationship between the monthly trade levels converted into numbers of containers, and the monthly numbers of vehicles needed to carry out the various types of operations for these containers within each region. Once these monthly numbers of vehicles are worked out from this relationship, they ought to be optimised by solving an integer linear program formalised by taking account of the various costs of hiring. This dissertation consists of five chapters. The first two chapters are devoted to the introduction of the company and its trades, to the statement of the project objectives and to a background study and description of the various aspects of the inland transport of containers within ACT. The third chapter deals with the collection and analysis of the relevant data to the project whereas the fourth chapter is devoted to the actual solution to the problem by developing the relationship between the trade levels and the number of vehicles needed and then by formulating and solving an integer linear program for each region and each type of operation. The results reached by the resolution of these ILP's are discussed and compared to the present policy of the company, in chapter 4. Optimal fleet size of container vehicles [texte imprimé] / Djamal Ahmed Touati, Auteur ; J. Brooks, Directeur de thèse . - Southampton : [s.n.], 1983 . - 169 f. : ill. ; 29 cm. Master of science : Mathematics : University of southampton : 1983 Bibliogr. f. 95 Langues : Anglais (eng) Mots-clés : Size Container Vehicles Index. décimale : Ms01483 Résumé : The problem of finding the optimal number of vehicles needed for ACT's trade levels is tackled by developing a relationship between the monthly trade levels converted into numbers of containers, and the monthly numbers of vehicles needed to carry out the various types of operations for these containers within each region. Once these monthly numbers of vehicles are worked out from this relationship, they ought to be optimised by solving an integer linear program formalised by taking account of the various costs of hiring. This dissertation consists of five chapters. The first two chapters are devoted to the introduction of the company and its trades, to the statement of the project objectives and to a background study and description of the various aspects of the inland transport of containers within ACT. The third chapter deals with the collection and analysis of the relevant data to the project whereas the fourth chapter is devoted to the actual solution to the problem by developing the relationship between the trade levels and the number of vehicles needed and then by formulating and solving an integer linear program for each region and each type of operation. The results reached by the resolution of these ILP's are discussed and compared to the present policy of the company, in chapter 4.

Exemplaires

Code-barres	Cote	Support	Localisation	Section	Disponibilité	Spécialité	Etat_Exemplaire
Ms01483	Ms01483	Papier	Bibliothèque centrale	Mémoire de Master	Disponible

The conversion of linear programmes to network flow problems / Mustapha Kemal Rahmouni

Public ISBD Titre : The conversion of linear programmes to network flow problems Type de document : texte imprimé Auteurs : Mustapha Kemal Rahmouni, Auteur ; H. P. Williams, Directeur de thèse Editeur : Southampton : [s.n.] Année de publication : 1987 Importance : 152 f. Présentation : ill. Format : 30 cm Note générale : PhD Thesis : Mathematics : University of Southampton : 1987 Bibliogr. f. 126 - 134 Langues : Anglais (eng) Mots-clés : Conversion Linear  programmes Network Flow  problems Index. décimale : D002387 Résumé : The research carried out throughout this thesis is concerned with the conversion of linear programmes to network flow problems. Although a network flow problem can always be expressed as a linear programme, the converse is not always true. Many people have found that some classes of linear programmes were in fact 'hidden' network flow problems, but few have actually put forward a systematic way of testing if any linear programme can be successfully converted to a network flow problem. The algorithm proposed in this thesis directly attempts to contruct the graph associated with the constraint matrix of the original LP programme. If a graph can be produced, then row operations and column scaling are carried out to actually yield, if possible, the equivalent network flow model. If a graph cannot be constructed, then the LP is not convertible to a NFP. The conversion of linear programmes to network flow problems [texte imprimé] / Mustapha Kemal Rahmouni, Auteur ; H. P. Williams, Directeur de thèse . - Southampton : [s.n.], 1987 . - 152 f. : ill. ; 30 cm. PhD Thesis : Mathematics : University of Southampton : 1987 Bibliogr. f. 126 - 134 Langues : Anglais (eng) Mots-clés : Conversion Linear  programmes Network Flow  problems Index. décimale : D002387 Résumé : The research carried out throughout this thesis is concerned with the conversion of linear programmes to network flow problems. Although a network flow problem can always be expressed as a linear programme, the converse is not always true. Many people have found that some classes of linear programmes were in fact 'hidden' network flow problems, but few have actually put forward a systematic way of testing if any linear programme can be successfully converted to a network flow problem. The algorithm proposed in this thesis directly attempts to contruct the graph associated with the constraint matrix of the original LP programme. If a graph can be produced, then row operations and column scaling are carried out to actually yield, if possible, the equivalent network flow model. If a graph cannot be constructed, then the LP is not convertible to a NFP.

Exemplaires

Code-barres	Cote	Support	Localisation	Section	Disponibilité	Spécialité	Etat_Exemplaire
D002387	D002387	Papier	Bibliothèque centrale	Thèse de Doctorat	Disponible