Solving Practical Vehicle Routing Problem with Time Windows Using Metaheuristic Algorithms (CROSBI ID 187650)
Prilog u časopisu | izvorni znanstveni rad | međunarodna recenzija
Podaci o odgovornosti
Taner, Filip ; Galić, Ante ; Carić, Tonči
engleski
Solving Practical Vehicle Routing Problem with Time Windows Using Metaheuristic Algorithms
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.
vehicle routing problem ; metaheuristics ; iterated local search ; simulated annealing
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
Podaci o izdanju
Povezanost rada
Tehnologija prometa i transport