The Heterogeneous Fixed Fleet Asymmetric Vehicle Routing Prob- lem (HFF-AVRP) is a N P-hard optimization problem. Instances analysis and in particular, fitness landscape analysis, may help problem solving. Such anal- ysis require the definition of a distance between feasible solutions. Such a dis- tance does not exist for the HFF-AVRP and this report aims at proposing a new distance measure defined from the exchange operator. In order to compute the exchange-distance between two solutions, four algorithms are suggested and then experimented. One of them is proved to be robust and to give the exact distance whereas others only compute an upper bound.