National Repository of Grey Literature 2 records found  Search took 0.01 seconds. 
Application of Heuristics on Vehicle Routing Problem
Gerlich, Michal ; Fábry, Jan (advisor) ; Pelikán, Jan (referee)
This thesis deals with solving a real case from one specific part of Operations Research -- Discrete Models. The case can be classified as Vehicle Routing Problem (VRP) which is a subset of classical Travelling Salesman Problem (TSP). The VRP is modified TSP when requirements of customers and capacities of trucks play role. The data needed for calculations were taken from the real situation of Pivovar Svijany a.s. The problem can be defined as VRP with cars with different capacities and split delivery. Even though the mathematic model of the problem is known and described in the thesis, the size of the problem is too big to be optimized. Therefore heuristic was used to solve it. Because of the good computational results in the past the savings algorithm was chosen. Its model was set using Visual Basic for Applications (VBA). The thesis (among others) analyses the sensitivity of the output on the values of the factors that can be chosen by the analyst. At the end of the thesis the best found solution is presented and the initial and the new scheme of the circles are compared.
Problems with application of supply modelling methods
Gerlich, Michal ; Kořenář, Václav (advisor) ; Flusserová, Lenka (referee)
Práce poukazuje na skutečnost, že deterministické modely zásob vyučované na vysokých školách jsou v praxi často nepoužitelné, a to především kvůli mnoha zjednodušením, např, předpokladu známé konstatní poptávky, neměnné ceně atd. V textu jsou popsány čtyři jiné výhodnější postupy řešení optimalizace zásob, které firmě ušetří velkou část nákladů.

Interested in being notified about new results for this query?
Subscribe to the RSS feed.