342-3344/01 – Theory and modeling of transport 1 (TaMD1)
| Gurantor department | Institute of Transport | Credits | 5 |
| Subject guarantor | doc. Ing. Michal Dorda, Ph.D. | Subject version guarantor | doc. Ing. Michal Dorda, Ph.D. |
| Study level | undergraduate or graduate | Requirement | Compulsory |
| Year | 2 | Semester | winter |
| | Study language | Czech |
| Year of introduction | 2018/2019 | Year of cancellation | |
| Intended for the faculties | FS | Intended for study types | Bachelor |
Subject aims expressed by acquired skills and competences
In transport, there are a number of decision-making tasks that can be effectively addressed using operational analysis tools. The course aims to acquaint students with selected tools that can be used to solve these decision-making tasks. These are tools based on graph theory, linear programming and queing theory.
Teaching methods
Lectures
Tutorials
Summary
Graduates of the course will get acquainted with the importance of optimization methods from operational analysis for solving problems of technical and transport practice, with basic optimization tasks and algorithms related to the transport network, with basic types of tasks and algorithms related to traffic planning on transport networks. service systems, the possibilities of their mathematical modeling and determination of their basic operating characteristics.
Compulsory literature:
Recommended literature:
Way of continuous check of knowledge in the course of semester
Credit - 2 written tests.
Exam - written part (2 examples) and oral part (2 theoretical questions).
E-learning
lms.vsb.cz
Other requirements
No other requirements are defined.
Prerequisities
Subject has no prerequisities.
Co-requisities
Subject has no co-requisities.
Subject syllabus:
1) Introduction to graph theory, basic concepts.
2) Eulerian trail, minimal spanning trees, Hamiltonian paths.
3) Distances in graphs - Floyd's algorithm.
4) Project management - Critical path method.
5) Planning the service of traffic network from one center - Little's algorithm.
6) Localization of emergency centers - Hakimi algorithm.
7) Introduction to linear programming - transport problem.
8) Mathematical model of a transport problem.
9) Algorithm for solving a transport problem.
10) Basic knowledge of probability theory.
11) Introduction to queueing theory, M/M/n/n queueing system.
12) M/M/n/∞ queueing system.
13) M/M/n/m queueing system.
14) Reserve.
Conditions for subject completion
Occurrence in study plans
Occurrence in special blocks
Assessment of instruction