National Repository of Grey Literature 2 records found  Search took 0.00 seconds. 
Optimization of medicaments distribution from Movianto s.r.o. Warehouse
Šimáně, Čestmír ; Kuncová, Martina (advisor) ; Fábry, Jan (referee)
Nowadays, when great emphasis is put on cost savings, transport optimization is necessary part of every company life in which transportation costs produce significant part. There are optimization methods and possibilities presented in this thesis. In the first chapter there are explained methods such as the travelling salesman problem, the vehicle routing problem, the multiple vehicle routing problem and the split delivery vehicle routing problem and then the reader gets to know the heuristics methods in the chapter two where description of the nearest neighbour method, Clarke-Wright method and split delivery heuristic is mentioned. In the last but one chapter author applies previous methods on concrete distribution arranged by Movianto Česká republika s.r.o. on 5th September, 2013. Based on gained outputs, analysis and comparison of results (including the original distribution) are provided in the fourth chapter. Obtained results of analysis lead to recommendation on how the company should plan its future distribution.
Vehicle routing problem with heterogeneous fleet
Künzelová, Barbora ; Pelikán, Jan (advisor) ; Borovička, Adam (referee)
The master's thesis deals with the new modification of vehicle routing problem -- 3PL vehicle routing problem with heterogeneous fleet and split delivery. In addition to classical vehicle routing problem, we consider a heterogeneous suppliers fleet and also external carrier, which charges a fixed value per unit of transported goods. The reader is first introduces to vehicle routing problem, its history and possible solutions. Furthermore, the reader is acquainted with logistics and logistics providers. In the main part of this thesis is described 3PL vehicle routing problem and its mathematical model. At first we try to get optimal solution via CPLEX solver. But since this is an NP-hard task, heuristic method is proposed (in two variants) for solving this problem. The heuristic is then tested on the selected test tasks. Results obtained using the proposed heuristics are compared with the optimal solution. Even larger problems are then solved using this heuristics. In the end other modifications and possible improvements of this heuristic method are proposed.

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