> There are also all sorts of other algorithms for solving the travelling > salesman problem Yes, I have use used one such library for composing call-change sequences, which is much closer to the TSP than composing peals is. Full details are online: http://www-users.cs.york.ac.uk/~ianb/cgi-bin/callcompose Ian -- Ian Broster