Large traveling salesman problems arising from experiments in X-ray crystallography: A preliminary report on computation (Q1118536)

Determining efficient sequences of X-ray diffraction measurements on a four-circle diffractometer leads to extremely large traveling salesman problems. Simple TSP heuristics give substantial improvements in utilization at small computational expense. Furthermore, the Lin- Kernighan heuristic consistently produces near-optimal sequences.