|
Lecturer(s)
|
-
Volek Josef, doc. Ing. CSc.
-
Vízner Filip, Ing. Ph.D.
|
|
Course content
|
Basic Definitions, Graphs and their Representation. Undirected and Directed Graphs. Labyrinth. Important Paths in Graphs, the Shortest Path Problem. Algorithm of Dijkstra and Ford. Maximum Capacity Path, Maximum Reliability Path. Transportation/Distribution Problem. Location Analysis, Continuous and Discrete Location, Location in Transportation Networks. Euler and Hamiltonian Cycles. Fleury's and Edmond's algorithms. Travel Salesman's Problem, Little Algorithm.
|
|
Learning activities and teaching methods
|
|
Monologic (reading, lecture, briefing), Dialogic (discussion, interview, brainstorming), Demonstration, Projection
|
|
Learning outcomes
|
The very aim of the course is to help students overcome difficulties in the process of theoretical methods and algorithms of practical application of operation research in transportation systems.
Completing the course will improve basic ability of students of the Applied Informatics in Transport branch of study to solve problems of transportation practice using informatics and operation analysis. It means especially formulation of a problem and aims of its solution, design of data structures, analysis of the problem, choice of the solution method as well as computer implementation and issues verification.
|
|
Prerequisites
|
The prerequisites for the successful completion of the course is knowledge in the area of algorithmization and programming, technology and transport control, logistics and operation analysis.
|
|
Assessment methods and criteria
|
Home assignment evaluation, Work-related product analysis
Awarding course credit confirms that the student fulfilled the required attendance and other qualifying conditions. The conditions for awarding credits are: active work at seminars, min. 75% attendance, independent work in the form of PC programme.
|
|
Recommended literature
|
-
Bertsekas, Dimitri P. Network optimization : continuos and discrete models. Belmont: Athena Scientific, 1998. ISBN 1-886529-02-7.
-
Cenek, Petr. Optimalizace dopravních a spojových procesů. Žilina: Vysoká škola dopravy a spojov, 1994. ISBN 80-7100-197-X.
-
Christofides, N.:. Graph Theory - an Algorithmic Approach.. New York: Academic Press, 1975. ISBN 0-12-174350-0.
-
Jablonský, Josef. Operační výzkum : kvantitativní modely pro ekonomické rozhodování. Praha: Professional Publishing, 2002. ISBN 80-86419-23-1.
-
Plesník, J.:. Grafové algoritmy. Bratislava, Veda 1983..
-
Tutte, W. T. Graph Theory. Addison-Wesley Publishing Company, 1984. ISBN 0-521-30241-2.
|