Logo ČVUT
CZECH TECHNICAL UNIVERSITY IN PRAGUE
STUDY PLANS
2019/2020

Optimization on Transportation Networks

The course is not on the list Without time-table
Code Completion Credits Range Language
17ODS Z,ZK 3 2+1 Czech
Lecturer:
Tutor:
Supervisor:
Department of Logistics and Management of Transport
Synopsis:

Introduction to optimization and heuristic methods, metaheristic methods, the history of optimization.Lagrangean approach, assignment problem - Hungarian method, minimum weighted matching, Little´s algorithm, vehicle routing problem - an extension of TSP, heuristic solution approaches to vehicle routing problem, local search techniques, Tabu Search, location problems - heuristic algorithms, genetic algorithms and extensions of genetic algorithms.

Requirements:

basic knowledge of optimization problems and solution approaches - travelling salesman problem, location problems

Syllabus of lectures:
Syllabus of tutorials:
Study Objective:

The student will learn some modern heuristic methods applicable in transportation problems solving.

Study materials:

Mocková D.: Principles of Transportation Theory, Prague, CTU in Prague 2007

Janáček J.: Optimization on Transportation Nets, Žilina, University of Žilina 2002

Note:
Further information:
No time-table has been prepared for this course
The course is a part of the following study plans:
Data valid to 2020-07-05
For updated information see http://bilakniha.cvut.cz/en/predmet1468606.html