Solving vehicle routing problem using metaheuristics in static and dynamic conditions

U ovom radu opisan je i obrađen problem usmjeravanja vozila i rješavanje tri inačice tog problema metaheurističkim pristupom, konkretno genetskim algoritmom. Navedene su postojeće metode rješavanja problema i ostvarena je vlastita implementacija rješenja u tri oblika zapisa u statičkim uvjetima. Kao dinamička komponenta za različite genotipe i inačice problema ispitana je brzina konvergencije rješenja ka rješenjima dobivenim heurističkim pristupom kao i brzina pronalaska rješenja za fiksni broj evaluacija. Rezultati su uspoređeni međusobno te prikazani grafički.In this thesis, vehicle routing problem and solving three variants of it is described. Problem variants were solved using metaheuristic approach, specifically genetic algorithm. The existing methods of solving the VRP problem were mentioned as well as the solution implementation that was recorded in three forms in static conditions. As a dynamic component for different genotypes and variants of the problem, convergence speed to the solutions obtained by heuristic approach was examined as well as the speed of finding a solution for a fixed number of evaluations. The results were compared and presented graphically