This is useful information, Neil. I ended up with this simple, non-optimal, algorithm: 1. Cluster all stops according to their nearest depot 2. Within each cluster, start a route taking the furthest stop and greedily adding the nearest stops...
hi. my name is Herman. I work in the field of design and manufacture of industrial machinery. Visit my blog at http://www.mymachineinfo.com/ to see my machine design. thanks.