| Article ID: | iaor19931585 |
| Country: | United States |
| Volume: | 40 |
| Issue: | 6 |
| Start Page Number: | 1086 |
| End Page Number: | 1094 |
| Publication Date: | Nov 1992 |
| Journal: | Operations Research |
| Authors: | Laporte Gilbert, Hertz Alain, Gendreau Michel |
| Keywords: | networks |
This paper describes a new insertion procedure and a new postoptimization routine for the traveling salesman problem. The combination of the two methods results in an efficient algorithm (GENIUS) which outperforms known alternative heuristics in terms of solution quality and computing time.