Pregledni rad
https://doi.org/10.7307/ptt.v24i4.443
Solving Practical Vehicle Routing Problem with Time Windows Using Metaheuristic Algorithms
Filip Taner
Ante Galić
Tonči Carić
Sažetak
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.
Ključne riječi
vehicle routing problem with time windows; simulated annealing; iterated local search; metaheuristcs
Hrčak ID:
85642
URI
Datum izdavanja:
1.9.2012.
Posjeta: 1.322 *