|
Lecturer(s)
|
|
|
|
Course content
|
Overview of often exploited mathematical models in transport and telecommunications. Linear deterministic models. Non-linear and dynamic deterministic models. Probabilistic models. Discrete mathematical structures. Combinatory structures. Location into finite set of position and linkage. Combinatory structure massiveness. Combinatory equals and recursion relations. Graphs. Modelling of transport network by valued graphs. Controlling of location tasks, trips and flows, setting up significant subgraphs. Algorithm. Schedules. Types of assignment problems. Transport applications, space, time and circulatory schedules. Decision making problems. Game theory methods, their utilisation in solving of conflict situations. Decision models with risks and indeterminations. Probability and math statistic. The most important types of stochastic quantity in term of application in transport and telecommunications. Stochastic vectors and sequences. Limitary properties. Markov's processes. Utilization on queuing theory systems. Chosen problems of subject according to graduate orientation and dissertation thesis.
|
|
Learning activities and teaching methods
|
|
Monologic (reading, lecture, briefing)
|
|
Learning outcomes
|
The aim of the subject is to inform students about often utilised systems in transport and communications.
Student is able to utilize of knowledge from the subject in dissertation work.
|
|
Prerequisites
|
unspecified
|
|
Assessment methods and criteria
|
Oral examination
The examination (form, content, duration) is set in accordance with the Educational and Examinational Code of the University of Pardubice.
|
|
Recommended literature
|
-
Cenek, Petr. Optimalizace dopravních a spojových procesů. Žilina: Vysoká škola dopravy a spojov, 1994. ISBN 80-7100-197-X.
|