A green vehicle routing problem with time windows considering the heterogeneous fleet of vehicles: two metaheuristic algorithms

2019 ◽  
Vol 13 (4) ◽  
pp. 507 ◽  
Author(s):  
Adel Nikfarjam ◽  
Amirhossein Moosavi ◽  
Neda Rezaei ◽  
Sadoullah Ebrahimnejad
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Time Windows ◽  
Metaheuristic Algorithms ◽  
Routing Problem ◽  
Heterogeneous Fleet

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.

Quantum Inspired Algorithm for a VRP with Heterogeneous Fleet Mixed Backhauls and Time Windows

2016 ◽  
Vol 7 (4) ◽  
pp. 18-38 ◽  
Author(s):  
Meryem Berghida ◽  
Abdelmadjid Boukra
Keyword(s):  
Population Size ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Search Algorithm ◽  
Time Windows ◽  
Harmony Search ◽  
Routing Problem ◽  
Heterogeneous Fleet ◽  
Variable Population ◽  
Variable Population Size

This paper presents a new Quantum Inspired Harmony Search algorithm with Variable Population Size QIHSVPS for a complex variant of vehicle routing problem (VRP), called HVRPMBTW (Vehicle Routing Problem with Heterogeneous fleet, Mixed Backhauls and Time Windows). This variant is characterized by a limited number of vehicles with various capacities and costs. The vehicles serve two types of customers: linehauls customers and backhauls customers. Each customer must be visited in a specific interval of time. The authors propose to use quantum principles to accelerate evolution process and variable population size to decrease the number of solution's evaluation, when the improvement is insignificant. This new approach was tested on benchmarks and produces satisfactory results compared to other approaches.

Sign in / Sign up

Export Citation Format

Share Document