More testing. If you have several, equally long roads to one destination. Which one is picked, seems to be completely at random. The best part is that all subsequent cars use the same road to get there, always.
Imagine a square, with corners A, B, C, D - and you're gonna get from A to C, and they're diagonally opposed. If a car drives ABC or ADC is completely random, but for the same reason, all subsequent cars travel the exact same road. I'm gonna see if I can figure out what sets which one is used (because it's something. If it was random, half the cars would go one way, and the other the other)
Greedy pathfinding algorithms will always pick the same path through a given graph regardless of what we see as several equally valid paths. As long as they use the same ruleset, 1500 found paths A->B through the same graph will always result in the same path.