An Exact Algorithm for the Heterogeneous Fleet Vehicle Routing Problem with Time Windows and Three-Dimensional Loading Constraints

2017 ◽  
pp. 91-101
Author(s):  
Vicky Mak-Hau ◽  
I. Moser ◽  
Aldeida Aleti
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Time Windows ◽  
Three Dimensional ◽  
Exact Algorithm ◽  
Routing Problem ◽  
Heterogeneous Fleet ◽  
Loading Constraints

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