Co-Investigators:
Ing. Jakub Brodský; Ing. Adéla Burketová; doc. Ing.
Denisa Mocková, Ph.D.
Annotation:
In the project topic of NP-complete problems with important use in transportation will be discussed and comparison of single methods of their solution, in particular results of application of exact and metaheuristic methods to these problems. In case of exact methods, linear and integer programming are most commonly used, although having important limitations in terms of computational time for large scope problems. On the other hand metaheuristic methods eliminate this issue, but do not ensure finding optimal solution. In the project these methods will be applied on vehicle routing problem, which searches for the solution for service of given locations including certain limiting conditions.
Department:
Year:
2014 - 2015
Program:
Studentská grantová soutěž ČVUT - SGS14/163/OHK2/2T/16
