| Article ID: | iaor20073132 |
| Country: | United Kingdom |
| Volume: | 58 |
| Issue: | 3 |
| Start Page Number: | 402 |
| End Page Number: | 407 |
| Publication Date: | Mar 2007 |
| Journal: | Journal of the Operational Research Society |
| Authors: | Laporte Gilbert, Babin G., Deneault S. |
| Keywords: | heuristics: local search |
Several variants and generalizations of the Or-opt heuristic for the Symmetric Travelling Salesman Problem are developed and compared on random and planar instances. Some of the proposed algorithms are shown to significantly improve upon the standard 2-opt and Or-opt heuristics.