Filip Taner
Ante Galić
Tonči Carić
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.
Toth, P., Vigo, D.: Vehicle Routing Problem, SIAM Publishing, monographs on discrete mathematics and applications, Philadelphia, 2002
Bräysy, O., Gendreau, M.: Vehicle Routing Problem with Time Windows Part I: Route Construction and Local Search Algorithms, Transportation Science, Vol. 39, No. 1, 2005, pp. 104-118
Bräysy, O., Gendreau, M.: Vehicle Routing Problem with Time Windows, Part II, Metaheuristics, Transportation Science, Vol. 39, No. 1, 2005, pp. 119-139.
Golden, B., Raghavan, S., Wasil, E.: The Vehicle Routing Problem, Latest Advances and New Challenges, Springer, 2008.
Nagata, Y., Bräysy, O., Dullaert, W.: A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows, Computers and Operations Research, Vol. 37, 2010, pp. 724-737.
Cordeau, J.F., Desaulniers G., Desrosiers, J., Solomon, M., Soumis, F.: The VehicleRouting Problem with Time Windows. Toth, P., Vigo, D. (eds.) The Vehicle Routing Problem,. SIAM Publishing, Philadelph
Guest Editor: Eleonora Papadimitriou, PhD
Editors: Marko Matulin, PhD, Dario Babić, PhD, Marko Ševrović, PhD
The mission of our journal is to provide high quality communication of research results, which is crucial for the effectiveness of scientific research, the promotion of scientific information, new ideas, and original research in the field of traffic and transportation engineering.
1848-4069
0353-5320
Proud publisher
Accelerating Discoveries in Traffic Science |
2024 © Promet - Traffic&Transportation journal
