On Solution of the Problem of Successive Round of Sets by the “Nonclosed” Travelling Salesman Problem

Authors:
A. A. Chentsov;A. G. Chentsov
Affiliations:
Institute of Mathematics and Mechanics, Ural Branch, Russian Academy of Sciences, Yekaterinburg, Russia;Institute of Mathematics and Mechanics, Ural Branch, Russian Academy of Sciences, Yekaterinburg, Russia
Venue:
Automation and Remote Control
Year:
2002

Citing 2
Cited 0

Dynamic Programming Treatment of the Travelling Salesman Problem

Journal of the ACM (JACM)
Dynamic programming method in the generalized traveling salesman problem: The influence of inexact calculations

Mathematical and Computer Modelling: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

Consideration was given to an iterative method of solution of the problem of successive round of a set using a model of the auxiliary travelling salesman problem with a reconstructible system of “towns.” A possible deviation from the global extremum was estimated at each step of iterations which were assumed to cease as soon as the desired—in terms of this estimate—accuracy was attained. Computer experiment demonstrated, however, that the iterative procedure stabilized after several steps, although the global extremum was not necessarily attained. Yet, stabilization of the iterative procedure itself is related with very interesting modes of solving the route problem that deserve independent study.