Comparison of neighborhoods for the HFF-AVRP

Vehicle Routing Problems (VRP) are widely studied as they represent challenges for the future. However, most of the routing problems encountered in the literature are quite far from real life problems. Therefore, this work will be dedicated to the Heterogeneous Fixed Fleet Asymmetric Vehicle Routing Problem (HFF-AVRP), a variant of the VRP, which is more common in real life distribution management than the basic VRP. HFF-AVRP is a NP-hard combinatorial optimization problem. Heuristics and in particular meta-heuristics are then candidate methods to solve such problems. As these methods are very sensitive to neighborhoods, we propose in this article to examine two classical neighborhoods associated to this problem in order to analyze their performances.