Abstract
For one of the basic variants of the dynamic minisum traveling salesman problem, a decomposition scheme is designed, which in general gives a new approximate solution algorithm. This algorithm is exact if certain conditions are imposed on the distance matrix. The problem is solved with the sufficient optimality conditions known in optimal control theory.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Lenstra, J.K., Rinnoy Kan, A.H.G., and Shmoys, D.B., The Traveling Salesman Problem. A Guided Tour of Combinatorial Optimization, Lawler, E.L., Ed., New York: Wiley, 1985.
Melamed, I.I., Sergeev, S.I., and Sigal, I.Kh., The Traveling Salesman Problem. I–III, Avtom. Telemekh., 1989, no. 9, pp. 3–34; no. 10, pp. 3–29; no. 11, pp. 3–26.
Punnen, A.P., The Traveling Salesman Problem and Its Variations, Gutin, G., Ed., London: Kluwer, 2002.
Gouveia, L. and Vob, S., A Classification of Formulations for the (Time-Dependent) Traveling Salesman Problem, Eur. J. Oper. Res., 1995, vol. 83, pp. 69–82.
Korotaeva, L.N., Trukhin, M.P., and Chentsov, A.G., Junction Routing, Avtom. Telemekh., 1997, no. 12, pp. 175–192.
Chentsov, A.A. and Chentsov, A.G., A Solution for Sequential Visiting of a Set in a “Nonclosed” Traveling Salesman Problem, Avtom. Telemekh., 2002, no. 11, pp. 151–166.
Chentsov, A.A. and Chentsov, A.G., Route Optimization via Dynamic Programming, Izv. Akad. Nauk, Teor. Sist. Upravlen., 1999, no. 3, pp. 76–87.
Sikharulidze, G.G., A Generalization of the Traveling Salesman Problem, Avtom. Telemekh., 1971, no. 8, pp. 116–123.
Glushkova, V.V., The Traveling Salesman Problem for Moving Points, in Matematicheskoe obespechenie PPP i metody diskretnoi optimizatsii (Software and Methods for Discrete Optimization), Kiev: Inst. Cybern., 1984, pp. 102–109.
Akhlebininskii, M.Yu. and Konstantinov, M.S., Choice of a Service Strategy for Objects in a Parametric M-Traveling Salesman Problem, Izv. Akad. Nauk SSSR, Tekhn. Kibern., 1989, no. 2, pp. 169–173.
Hellman, O., Vvedenie v teoriyu optimal’nogo poiska (Introduction to Optimal Search Theory), Moscow: Nauka, 1985.
Zaretskii, L.S., The Traveling Salesman and Conveyance Problems: Solution via State Function Correction, Ekonom. Mat. Metody, 1979, vol. 15, no. 1, pp. 194–201.
Balas, E. and Christofides, N., A Restricted Lagrangian Approach to the Traveling Salesman Problem, Math. Program., 1981, vol. 21, no. 1, pp. 19–46.
Krotov, V.F. and Sergeev, S.I., Computational Algorithms for Certain Linear and Linear Integer Programming Problems. I–IV, Avtom. Telemekh., 1980, no. 12, pp. 86–96; 1981, no. 1, pp. 86–96; no. 3, pp. 83–94; no. 4, pp. 103–112.
Krotov, V.F., Computational Algorithms for Solving and Optimization of Controlled Systems of Equations. I, II, Izv. Akad. Nauk SSSR, Tekhn. Kibern., 1975, no. 5, pp. 3–15; no. 6, pp. 3–13.
Sergeev, S.I., Computational Algorithms for the Traveling Salesman Problem. I, II, Avtom. Telemekh., 1994, no. 5, pp. 66–78; no. 6, pp. 106–115.
Sergeev, S.I., Algorithms for the Minimax Traveling Salesman Problem. I, II, Avtom. Telemekh., 1995, no. 7, pp. 144–150; no. 8, pp. 124–140.
Osnovy teorii optimal’nogo upravleniya (Elements of Optimal Control Theory), Krotov, V.F., Ed., Moscow: Vysshaya Shkola, 1990.
Author information
Authors and Affiliations
Additional information
Original Russian Text © S.I. Sergeev, 2006, published in Avtomatika i Telemekhanika, 2006, No. 7, pp. 27–40.
This paper was recommended for publication by B. T. Polyak, a member of the Editorial Board
Rights and permissions
About this article
Cite this article
Sergeev, S.I. Discrete optimization by optimal control methods. III. The dynamic traveling salesman problem. Autom Remote Control 67, 1039–1050 (2006). https://doi.org/10.1134/S0005117906070034
Received:
Issue Date:
DOI: https://doi.org/10.1134/S0005117906070034