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

Decision Making Methods in Transportation


The application of the Dijkstra model

G=(V,E,s,c) denotes the investigated graph, where V=v0, , vN-1 denotes the set of the graph nodes, EV2 denotes the set of the edges of the graph, sV denotes the starting node of the shortest path problem, and c:EN denotes the weight function characterizing the edges. Bn denotes the logical function that is responsible for the representation of the assignment, and it is described as f:0, 1n0, 1. The character i of a binary number x0, 1n is marked as xi, and its value is x=i=0n-1xi2i. According to this approach, G can also be described as the logical function χEB2n, which represents the binary node pairs x, y0,12n if and only if vx,vyE and cvx,vy=d. The algorithm handles the input data in the form of the functions C(x,y,d) and sx (Török 2018).

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