Theory of Transport

Course guarantor:

Lecturer:

Tutor:

Supervisor:

Department of Smart Cities and Regions

Synopsis:

Paths in undirected graphs

Paths in directed graphs

Minimum spanning trees, Eulerian and Hamiltonian graphs

Traveling salesman problem, Vehicle routing problem, heuristic methods

Network flow

Graph planarity

Graph coloring

Trees

Assignment problem

Location and allocation problems

Discrete location problems

Continuous location problems

Discrete optimization problems and their solution

Application of genetic algorithms to discrete optimization problems

Selected topics from mathematical optimization of transportation problems

Requirements:

Syllabus of lectures:

Syllabus of tutorials:

Study Objective:

Study materials:

Note:

Further information:

No time-table has been prepared for this course

The course is a part of the following study plans: