Skip to main content
SpringerLink
Log in

Approximate algorithms for the traveling salesman problem. II

  • System Analysis and Operations Research
  • Published:
Automation and Remote Control Aims and scope Submit manuscript

Abstract

We present several approximate algorithms for solving discrete optimization problems. For instance, for the minimum traveling salesman problem we establish bounds on the functionals for the symmetric problem with a value larger than (99.0–99.70) %; for the asymmetric problem, larger than (99.0–99.23) % (experimental estimates). Besides, we propose a different algorithm for the minimum traveling salesman problem that uses both two-index and single-index models.

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. The Traveling Salesman Problem. A Guided Tour of Combinatorial Optimization, Lawler, E.L., Lenstra, J.K., Rinnoy Kan, A.H.G., and Shmoys, D.B., Eds., New Yprk: Wiley, 1985.

    MATH  Google Scholar 

  2. Melamed, I.I., Sergeev, S.I., and Sigal, I.Kh., The Traveling Salesman Problem. I-III, Autom. Remote Control, 1989, no. 9, part 1, pp. 1147–1174; no. 10. part 1, pp. 1303–1325; no. 11, part 1, pp. 1459–1480.

    Google Scholar 

  3. The Traveling Salesman Problem and Its Variations, Gutin, G. and Punnen, A.P., Eds., Dordrecht, London: Kluwer, 2002.

    MATH  Google Scholar 

  4. Krotov, V.F., Approximate Synthesis of Optimal Control, Autom. Remote Control, 1964, vol. 25, no. 11, pp. 1369–1375.

    Google Scholar 

  5. Krotov, V.F. and Gurman, V.I., Metody i zadachi optimal’nogo upravleniya (Optimal Control Methods and Problems), Moscow: Nauka, 1973, pp. 265–271.

    Google Scholar 

  6. Krotov, V.F. and Fel’dman, I.N., An Iterative Method for Solving Optimal Control Problems, Izv. Akad. Nauk SSSR, Tekhn. Kibern., 1983, no. 2, pp. 160–168.

    Google Scholar 

  7. Krotov, V.F., Global Methods in Optimal Control Theory, New York: Marcel Dakker, 1996.

    MATH  Google Scholar 

  8. Krotov, V.F. and Sergeev, S.I., Computing Algorithms for Solving Certain Problems in Linear and Linear Integer Programming. I–IV, Autom. Remote Control, 1980, no. 12, part 1, pp. 1693–1701; 1981, no. 1, part 2, pp. 67–75; no. 4, part 1, pp. 494–501.

    Google Scholar 

  9. Sergeev, S.I., On One Exact Algorithm For Solving the Traveling Salesman Problem, in Modelirovanie ekonomicheskikh protsessov (Modeling Economic Processes), Moscow: MESI, 1983, pp. 3–27.

    Google Scholar 

  10. Balas, E. and Christofides, N., A Restricted Lagrangean Approach to the Traveling Salesman Problem, Math. Program., 1981, no. 1, pp. 19–46.

    Google Scholar 

  11. Sergeev, S.I., Algorithms for Solution of the Traveling Salesman Problem. II. New Lower Bound, Autom. Remote Control, 1994, vol. 55, no. 6, part 2, pp. 861–868.

    MATH  MathSciNet  Google Scholar 

  12. Sergeev, S.I., The Traveling Salesman Problem. Utilization of Nonlinear Solving Functions, Autom. Remote Control, 2013, vol. 74, no. 6, pp. 978–994.

    Article  MATH  MathSciNet  Google Scholar 

  13. Sergeev, S.I., Maximum Travelling Salesman Problem. I, Autom. Remote Control, 2014, vol. 75, no. 12, pp. 2170–2189.

    Article  MathSciNet  Google Scholar 

  14. Kovalev, M.M. and Kotov, V.M., Estimating the Error for Series of Approximate Algorithms, Vestn. BGU, 1986, no. 3 (1), pp. 44–48.

    Google Scholar 

  15. Serdyukov, A.I., An Algorithm with a Bound for the Maximum Traveling Salesman Problem, Upravlyaemye Sist., Novosibirsk, 1984, no. 25, pp. 80–86.

    Google Scholar 

  16. Kostochka, A.V. and Serdyukov, A.I., Polynomial Algorithms with 3/4 and 5/6 Bounds for the Maximum Traveling Salesman Problem, Upravlyaemye Sist., Novosibirsk, 1985, no. 26, pp. 55–59.

    Google Scholar 

  17. Sergeev, S.I., Discrete Optimization by Optimal Control Methods. I. Separable Problems, Autom. Remote Control, 2006, vol. 67, no. 4, pp. 552–561.

    Article  MATH  MathSciNet  Google Scholar 

  18. Gerasimov, V.A., Successive Approximations of Bellman’s Function, Autom. Remote Control, 1987, vol. 48, no. 7, part 1, pp. 887–890.

    MATH  Google Scholar 

  19. Bayard, D.S., Reduced Complexity Dynamic Programming Based on Policy Iterations, J. Math. Anal. App., 1992, vol. 170, no. 1, pp. 75–103.

    Article  MATH  MathSciNet  Google Scholar 

  20. Kovalev, M.M., Matroidy v diskretnoi optimizatsii (Matroids in Discrete Optimization), Minsk: Universitetskoe, 1987.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Moscow State University of Economics, Statistics, and Informatics, Moscow, Russia

    S. I. Sergeev

Authors
  1. S. I. Sergeev
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to S. I. Sergeev.

Additional information

Original Russian Text © S.I. Sergeev, 2015, published in Avtomatika i Telemekhanika, 2015, No. 3, pp. 125–134.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Sergeev, S.I. Approximate algorithms for the traveling salesman problem. II. Autom Remote Control 76, 472–479 (2015). https://doi.org/10.1134/S0005117915030108

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0005117915030108

Keywords

Search

Navigation