Skip to main content
SpringerLink
Log in

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

  • Published:
Automation and Remote Control Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

REFERENCES

  1. Chentsov, A.A. and Chentsov, A.G., Reduction of the Problem of Route Optimization, Avtom.Telemekh., 2000, no. 10, pp. 136-150.

  2. Chentsov, A.A. and Chentsov, A.G., On an Approximate Method of Solving the Problem of Route Optimization, Algor.program.sredstva parall.vychisl., 2000, no. 4, pp. 287-302.

  3. Chentsov, A.A. and Chentsov, A.G., Dynamic Programming Method in the Generalized Traveling Salesman Problem: The Inuence of Inexact Calculations, Math.Comput.Modeling, 2001, vol. 33, pp. 801-819.

    Google Scholar 

  4. Chentsov, A.A. and Chentsov, A.G., On Solving the Problem of Route Optimization by the Method of Dynamic Programming, Avtom.Telemekh., 1998, no. 9, pp. 117-129.

  5. Chentsov, A.A. and Chentsov, A.G., On Solving the Problem of Route Optimization by the Method of Dynamic Programming, Izv.Ross.Akad.Nauk, Teor.Sist.Upravlen., 1999, no. 3, pp. 76-87.

  6. Kelley, J.L., General Topology, New York: Van Nostrand, 1957. Translated under the title Obshchaya topologiya, Moscow: Nauka, 1981.

    Google Scholar 

  7. Engelking, R., General Topology, Warszawa: PWN, 1985. Translated under the title Obshchaya topologiya, Moscow: Mir, 1986.

    Google Scholar 

  8. Chentsov, A.A., Method of Iterations in the Traveling Salesman Problem Genetralized to the Bottlenecks, Algor.program.sredstva parall.vychisl., 2001, no. 5.

  9. Aleksandryan, R.A. and Mirzakhanyan, E.A., Obshchaya topologiya (General Topology), Moscow: Vysshaya Shkola, 1979.

    Google Scholar 

  10. Bellman, R., Programming Treatment of the Travelling Salesman Problem, J.Assoc.Compt.Machinery, 1962, vol. 9, no. 1, pp. 61-63.

    Google Scholar 

  11. Held, M. and Karp, R.M., A Dynamic Programming Approach to Sequencing Problems, J.SIAM, 1962, vol. 10, no. 1, pp. 196-210.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics and Mechanics, Ural Branch, Russian Academy of Sciences, Yekaterinburg, Russia

    A. A. Chentsov & A. G. Chentsov

Authors
  1. A. A. Chentsov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. G. Chentsov
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chentsov, A.A., Chentsov, A.G. On Solution of the Problem of Successive Round of Sets by the “Nonclosed” Travelling Salesman Problem. Automation and Remote Control 63, 1832–1845 (2002). https://doi.org/10.1023/A:1020963600708

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1020963600708

Keywords

Search

Navigation