Quick of way of finding the permutations that generates shortest distance

Question

I have a list of objects that I can combine differently, say three objects in total, and different permutations 3! will generate different pairwise distance.