|
Avtomatika i Telemekhanika, 1988, Issue 11, Pages 153–160
(Mi at6802)
|
|
|
|
Developing Systems
On efficiency of one local algorithm for solving the traveling salesman problem
G. M. Gutin Gomel
Abstract:
The well-known local steepest descent algorithms for solution of the traveling salesman problem are compared with what Sarvanov and Doroshko propose [1]. With random choice of the original Hamiltonian loop the latter algorithm finds in the vicinity of that loop a shorter Hamiltonian loop than do the conventional local steepest descent algorithms for nearly all complete symmetrical digraphs with some discrete weights of arcs.
Received: 21.09.1987
Citation:
G. M. Gutin, “On efficiency of one local algorithm for solving the traveling salesman problem”, Avtomat. i Telemekh., 1988, no. 11, 153–160; Autom. Remote Control, 49:11 (1988), 1514–1519
Linking options:
https://www.mathnet.ru/eng/at6802 https://www.mathnet.ru/eng/at/y1988/i11/p153
|
Statistics & downloads: |
Abstract page: | 101 | Full-text PDF : | 50 | First page: | 2 |
|