Vehicle routing in dynamic environments

U ovom radu opisan je problem raspoređivanja vozila. Opisan je algoritam genetskog programiranja te sustav koji demonstrira učinkovitost algoritma genetskog programiranja u pronalaženju kvalitetnog rješenja u dinamičkim uvjetima i proizvoljnom kriteriju optimizacije. Opisane su ostvarene inačice problema raspoređivanja vozila te optimizacijske tehnike koje su korištene s ciljem dobivanja kvalitetnijeg rješenja od strane genetskog programiranja. Prikazani su i komentirani rezultati koji su dobiveni koristeći različite parametre genetskog programiranja i optimizacija.In this thesis the vehicle routing problem is described. The genetic programming algorithm as well as system that demonstrates effectiveness of genetic programming algorithm in finding quality solution in dynamic conditions and using arbitrary optimization criterion are also described. Implemented versions of vehicle routing problem and optimization techniques used in order to obtain quality solutions from genetic programming side are also described. Solutions gotten from using different genetic programming parameters and optimizations are shown and commented