Application of optimization algorithms to vehicle routing problems

Ovaj rad obrađuje problem usmjeravanja vozila, te je fokusiran na njegovo rješavanje pomoću metaheurističkih algoritama. Implementirani su i uspoređeni sljedeći algoritmi: genetski algoritam, simulirano kaljenje, tabu pretraživanje, te algoritam uštede. Pokušala se istražiti ovisnost parametara algoritama i operatora, te njihov utjecaj na kvalitetu rješenja.This paper deals with vehicle routing problem and is focused on it's solving by using metaheuristic approaches. The following algorithms have been implemented and compared: genetic algorithm, simulated annealing, tabu search and savings algorithm. It tried to explore the dependence of algorithms, operator parameters and their impact on quality of the solution