This article is cited in 1 paper

Developing Systems

Experimental effectiveness study of heuristic algorithms for solution of the traveling salesman problem

V. V. Borodin, S. Y. Lovetskiy, I. I. Melamed, Yu. M. Plotinskii

Moscow

Abstract: Heuristic algorithms are studied for solution of the traveling salesman problem as are algorithms for obtaining the lower bounds of an optimal solution. Results are given from computing experiments and advice is given on choice of most effective algorithms.

UDC: 518.5:519


Received: 10.07.1979

 English version: Automation and Remote Control, 1981, 41:11, 1543–1550

Bibliographic databases:

•