Přístupnostní navigace
E-přihláška
Vyhledávání Vyhledat Zavřít
Detail oboru
FSIZkratka: D-KPIAk. rok: 2017/2018Zaměření: Řízení strojů a procesů
Program: Stroje a zařízení
Délka studia: 4 roky
Akreditace od: Akreditace do: 31.12.2020
Garant
prof. Ing. Václav Píštěk, DrSc.
Vypsaná témata doktorského studijního programu
Optimizing connections in transportation networks is a popular problem that arises in many different scenarios, such as car journeys, public transportation, or logistics optimization. The basic concept of a routing algorithm is to model the specific problem in a suitable graph and to compute a shortest path to solve it. The main task in this thesis will be so called Canadian Traveler Problem (CTP). The CTP is a stochastic shortest paths problem in which one learns the cost of an edge only when arriving at one of its endpoints. The goal is to find an optimal policy that minimizes the expected cost of travel. The problem is known to be #P-hard. The optimization problem will be solved primary by swarm intelligence approaches and by advanced heuristics too. The goal is to develop and to demonstrate techniques that could lead to progress.
Školitel: Matoušek Radomil, prof. Ing., Ph.D.
Studijní plán oboru není zatím pro tento rok vygenerován.