Solving the time dependent vehicle routing problem by metaheuristic algorithms

2015 ◽  
Author(s):  
Farhana Johar ◽  
Chris Potts ◽  
Julia Bennell
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Metaheuristic Algorithms ◽  
Time Dependent ◽  
Routing Problem

scholarly journals The secure time-dependent vehicle routing problem with uncertain demands

2021 ◽  
Vol 131 ◽  
pp. 105253
Author(s):  
Somayeh Allahyari ◽  
Saeed Yaghoubi ◽  
Tom Van Woensel
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Time Dependent ◽  
Routing Problem

scholarly journals Solving Practical Vehicle Routing Problem with Time Windows Using Metaheuristic Algorithms

1970 ◽  
Vol 24 (4) ◽  
pp. 343-351 ◽  
Author(s):  
Filip Taner ◽  
Ante Galić ◽  
Tonči Carić
Keyword(s):  
Vehicle Routing ◽  
Real World ◽  
Vehicle Routing Problem ◽  
Time Windows ◽  
Iterated Local Search ◽  
Metaheuristic Algorithms ◽  
Benchmark Problems ◽  
Routing Problem ◽  
Constructive Heuristics ◽  
Initial Feasible Solution

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.

Sign in / Sign up

Export Citation Format

Share Document