A parallelised large neighbourhood search heuristic for the asymmetric two-echelon vehicle routing problem with swap containers for cargo-bicycles

2021 ◽  
Vol 289 (2) ◽  
pp. 742-757
Author(s):  
Ferdinand Mühlbauer ◽  
Pirmin Fontaine
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Routing Problem ◽  
Search Heuristic ◽  
Neighbourhood Search ◽  
Large Neighbourhood ◽  
Large Neighbourhood Search

A modified adaptive large neighbourhood search for a vehicle routing problem with flexible time window

2021 ◽  
Vol 8 (4) ◽  
pp. 716-725
Author(s):  
F. Labdiad ◽  
◽  
M. Nasri ◽  
I. Hafidi ◽  
H. Khalfi ◽  
...  
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Time Window ◽  
Time Windows ◽  
Routing Problem ◽  
Real World Application ◽  
Neighbourhood Search ◽  
Large Neighbourhood ◽  
Adaptive Large Neighbourhood Search ◽  
Large Neighbourhood Search

Vehicle routing problems are widely available in real world application. In this paper, we tackle the resolution of a specific variant of the problem called in the literature vehicle routing problem with flexible time windows (VRPFlexTW), when the solution has to obey several other constraints, such as the consideration of travel, service, and waiting time together with time-window restrictions. There are proposed two modified versions of the Multi-objective Adaptive Large Neighbourhood Search (MOALNS). The MOALNS approach and its different components are described. Also it is listed a computational comparison between the MOALNS versions and the Ant colony optimiser (ACO) on a few instances of the VRPFlexTW.

Sign in / Sign up

Export Citation Format

Share Document