| Article ID: | iaor1992728 |
| Country: | United Kingdom |
| Volume: | 29 |
| Start Page Number: | 80 |
| End Page Number: | 84 |
| Publication Date: | Aug 1989 |
| Journal: | USSR Computational Mathematics and Mathematical Physics |
| Authors: | Sigal I.Kh. |
The construction of the best sequence of a bounded number of approximate algorithms for solving the travelling salesman problem with a given initial tour is considered. A rule for reducing the number of applications of the algorithms in the sequence and a rule for eliminating whole subsequences of algorithms are derived. An algorithm based on these rules is proposed.