| Article ID: | iaor1989663 |
| Country: | Netherlands |
| Volume: | 8 |
| Issue: | 3 |
| Start Page Number: | 125 |
| End Page Number: | 128 |
| Publication Date: | Jun 1989 |
| Journal: | Operations Research Letters |
| Authors: | Shallcross David F., Bland Robert G. |
| Keywords: | programming: travelling salesman |
Determining efficient sequences of X-ray diffraction measurements on a four-circle diffractometer leads to extremely large travelign salesman problems. Simple TSP heuristics give substantial improvements in utilization at small computational expense. Furthermore, the Lin-Kernighan Heuristic consistently produces near-optimal sequences.