Original title:
Optimalizace procesů v logistice s podporou vizualizace
Translated title:
Optimization of Processes in Logistics with Visualization Support
Authors:
Kršák, Martin ; Bidlo, Michal (referee) ; Křivka, Zbyněk (advisor) Document type: Master’s theses
Year:
2019
Language:
cze Publisher:
Vysoké učení technické v Brně. Fakulta informačních technologií Abstract:
[cze][eng]
Cielom diplomovej prace je navrh, implementacia a porovnanie algoritmov, ktore optimalizuju procesy v logistike, prevazne v planovacej casti. Algoritmy pomocou heuristik a aproximacneho genetickeho algoritmu najdu takmer optimalne riesenie NP-tazkeho problemu, podobneho problemu obchodneho cestujuceho s oneskorenim niekolkych hodin. Ulohou tychto algoritmov je planovanie efektivnej trasy smetiarskym vozidlam, ktore zvazaju a rozvazaju velkoobjemny odpad do zbernych stredisk v konkretnom meste. Cielom optimalizacie je minimalizacia nakladov na dopravu.
The master thesis aims to design, implement, and compare algorithms that optimize processes in logistics, mainly in the planning phase. Heuristics and approximation genetic algorithms will find an near-optimal solution to NP-hard problem, such as the traveling salesman problem, with a delay less than several hours. The role of this algorithm is to plan an efficient route for garbage trucks that collect and distribute large-scale waste to waste yards in a specific city. The goal of the optimization is to minimize the shipping costs.
Keywords:
chromosome; crossover; fitness function; Gantt chart; genetic algorithm; individual; logistics; mutation; NSGA-2; Optimization; population; selection method; smart city.; chromozom; Ganttov diagram; geneticky algoritmus; hodnotiaca funkcia; jedinec; krizenie; logistika; metoda vyberu; mutacia; NSGA-2; Optimalizacia; populacia; smart city.
Institution: Brno University of Technology
(web)
Document availability information: Fulltext is available in the Brno University of Technology Digital Library. Original record: http://hdl.handle.net/11012/180376