Open AccessSolving Practical Vehicle Routing Problem with Time Windows Using Metaheuristic Algorithms
Author(s) -
Filip Taner,
Ante Galić,
Tonči Carić
Publication year - 1970
Publication title -
promet
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.315
H-Index - 19
eISSN - 1848-4069
pISSN - 0353-5320
DOI - 10.7307/ptt.v24i4.443
Subject(s) - vehicle routing problem , iterated local search , simulated annealing , heuristics , benchmark (surveying) , computer science , metaheuristic , mathematical optimization , algorithm , iterated function , process (computing) , routing (electronic design automation) , mathematics , computer network , mathematical analysis , geodesy , geography , operating system
This paper addresses the Vehicle Routing Problem with Time Windows (VRPTW) and shows that implementing algorithms for solving various instances of VRPs can significantly reduce transportation costs that occur during the delivery process. Two metaheuristic algorithms were developed for solving VRPTW: Simulated Annealing and Iterated Local Search. Both algorithms generate initial feasible solution using constructive heuristics and use operators and various strategies for an iterative improvement. The algorithms were tested on Solomon’s benchmark problems and real world vehicle routing problems with time windows. In total, 44 real world problems were optimized in the case study using described algorithms. Obtained results showed that the same distribution task can be accomplished with savings up to 40% in the total travelled distance and that manually constructed routes are very ineffective