| Article ID: | iaor19972162 |
| Country: | United States |
| Volume: | 8 |
| Issue: | 2 |
| Start Page Number: | 134 |
| End Page Number: | 143 |
| Publication Date: | Apr 1996 |
| Journal: | INFORMS Journal On Computing |
| Authors: | Laporte Gilbert, Boctor Fayez F., Renaud Jacques |
| Keywords: | heuristics |
This particle describes a new composite heuristic for the symmetric Traveling Salesman Problem. The heuristic consists of three phases: construction of an initial envelope, insertion of the remaining vertices, and improvement procedure. The heuristic is shown to perform very well both on randomly generated instances and on TSPLIB problems.