I'm trying to make an usable one whith js but i suck at coding so i'm really slow and the result will be 100x uglier than yours. I made a working planner prototype using python and he seems to work well but it's really user-unfriendly. There are several ways to find the 'minimum total travel time solution' i digged a little and i think the best one is using the 'Lap-Jv' algorithm. Of course you can change the order of the villages to get the rigth one, but when you are planning lot of nukes on lot of targets it would be really hard to spot and fix manually similar situation. The total travel distance for the nukes will be 4+7.07=11 when the most logical choice would be A-1 B-2 whith a total travel distance of 6. He will see which target is closest to A, create the first 'couple' (A-2, distance 4) and then pair the other two villages(B-1, distance 7.07).
