Thesis Details
Optimalizační algoritmy v logistických kombinatorických úlohách
This thesis deals with optimization problems with main focus on logistic Vehicle Routing Problem (VRP). In the first part term optimization is established and most important optimization problems are presented. Next section deals with methods, which are capable of solving those problems. Furthermore it is explored how to apply those methods to specific VRP, along with presenting some enhancement of those algorithms. This thesis also introduces learning method capable of using knowledge of previous solutions. At the end of the paper, experiments are performed to tune the parameters of used algorithms and to discuss benefit of suggested improvements.
VRP, logistic, distribution, Vehicle Routing Problem, optimization, combinatoric optimization, heuristic, metaheuristic, learning, learning algorithm
Češka Milan, prof. RNDr., CSc. (DITS FIT BUT), člen
Matoušek Radomil, doc. Ing., Ph.D. (IACS FME BUT), člen
Očenášek Pavel, Mgr. Ing., Ph.D. (DIFS FIT BUT), člen
Peringer Petr, Dr. Ing. (DITS FIT BUT), člen
Španěl Michal, Ing., Ph.D. (DCGM FIT BUT), člen
@mastersthesis{FITMT17553,
author = "Daniel Boki\v{s}",
type = "Master's thesis",
title = "Optimaliza\v{c}n\'{i} algoritmy v logistick\'{y}ch kombinatorick\'{y}ch \'{u}loh\'{a}ch",
school = "Brno University of Technology, Faculty of Information Technology",
year = 2015,
location = "Brno, CZ",
language = "czech",
url = "https://www.fit.vut.cz/study/thesis/17553/"
}