I use a brute force approach but a little different way. First I sort the street number then I assume the 1^st street number as optimal number and find the distance. Then assume the second,  then the third and so on�.. till the optimum path become decrease.