Tánczos Katalin, Török Árpád, Szabó Zsombor, Pauer Gábor, Ghadi Maen

Decision Making Methods in Transportation


The basic problem

To present the minimum cost flow problem, two types of matrices have to be introduced. Variable matrix X contains the flow values ( xij) between all i and j nodes. Matrix C contains the unit costs (cij) of flows between all nodes i and j. All of the edges in the network have a capacity (uij), which represents the maximum feasible flow on the edge. Value bi represents the net flow going through node i. If bi>0, then the node is a supply node (source); if bi<0, then the node is a demand node (sink). In this case, the LP problem discussed here can be described by the system of equations and inequalities presented in equation 167.

Decision Making Methods in Transportation

Tartalomjegyzék


Kiadó: Akadémiai Kiadó

Online megjelenés éve: 2018

ISBN: 978 963 059 939 9

The content of the book fits to the teaching program of the subject titled ‘Decision making methods’ taught at Budapest University of Technology and Economics (BME) Faculty of Transportation Engineering and Vehicle Engineering. The book firstly introduces the most frequently applied general approaches of solving linear optimisation problems and then discusses a few special decision support models. In the course of the investigation the book discusses the models from theory to practice, especially considering transportation related problems and models. The introduced models can efficiently support transportation related decision making processes. Therefore, it can fructify for its readers in the field of transportation management, transportation process coordination and transportation system operation.

Hivatkozás: https://mersz.hu/tanczos-torok-szabo-pauer-ghadi-decision-making-methods-in-transportation//

BibTeXEndNoteMendeleyZotero

Kivonat
fullscreenclose
printsave