Find best circular permutation that minimizes average distance between 2 ordered lists of points

Question

Given 2 ordered sets of n points each, A and B, how do I find the best circular permutation which minimizes the average pairwise-distance (using the distance of your choice)