A branch-and-price algorithm for the heterogeneous fleet green vehicle routing problem with time windows

2019 ◽  
Vol 122 ◽  
pp. 511-527 ◽  
Author(s):  
Yang Yu ◽  
Sihan Wang ◽  
Junwei Wang ◽  
Min Huang
Networks ◽  
2018 ◽  
Vol 73 (4) ◽  
pp. 401-417 ◽  
Author(s):  
Hamza Ben Ticha ◽  
Nabil Absi ◽  
Dominique Feillet ◽  
Alain Quilliot ◽  
Tom Van Woensel

2010 ◽  
Vol 206 (2) ◽  
pp. 341-349 ◽  
Author(s):  
Gabriel Gutiérrez-Jarpa ◽  
Guy Desaulniers ◽  
Gilbert Laporte ◽  
Vladimir Marianov

2016 ◽  
Vol 7 (4) ◽  
pp. 18-38 ◽  
Author(s):  
Meryem Berghida ◽  
Abdelmadjid Boukra

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