Optimization for transport planning IS-FM-00098S

Description:
Mathematical models of transport problems. A transportation problem, the issue of allocation (allocation of means of transport and scheduling drivers' working time), minimization of empty runs and methods of solving them using computer applications. Multicriteria decision problems and methods of solving them (SAW, TOPSIS, AHP), with practical examples of application in planning and organizing transport. Application of graph theory in transport planning problems - methods of optimization the network flows by searching for: the shortest paths in the graph (dynamic programming methods, Dijkstra�s algorithm, Danzing�s algorithm, minimum spannig tree),the maximum flow in the network, the solution of problem of flow in a network with minimal cost, the solution of the traveling salesman problem. Application of queue theory in transport problems.

Requirements:
Assumptions and goals of the subject:
To familiarize students with the problems of planning and optimization for transportation and methods used to solve decision problems related to transport. Students will gain knowledge and skills in the field of planning and optimization as well as modeling of problems related to transport, transport processes, networks and transport systems.
discussion and test on classes written exam