Metaheuristic algorithms for vehicle routing problems with time windows and pick-up and delivery

Ovaj rad obrađuje problem usmjeravanja vozila, te njegove instance s ograničenim kapacitetom, vremenskim prozorima i mogućnošću preuzimanja tereta i dostave. Dan je detaljan opis problema i korištenih metaheurističkih algoritama: genetskog algoritma turnirske eliminacije i algoritma evolucijske strategije. Implementirana su tri oblika zapisa rješenja, operatori mutacije i križanja i dva lokalna operatora. Istraživana je ovisnost kvalitete rješenja o obliku zapisa, korištenom algoritmu i korištenju lokalnih operatora. Dobiveni rezultati prikazani su grafički i analizirani.This paper deals with vehicle routing problem and its instances with limited capacity, time windows and pick-up and delivery. Detailed description of the problem is given, as well as of the two metaheuristic algorithms that were used: genetic algorithm with tournament selection and evolution strategy algorithm. Three forms of results, mutation and crossover operators and two local operators were implemented. The dependence of the quality of the solution on the form of result, used algorithm and the use of local operators was explored. The obtained results are shown graphically and analyzed