|
Trudy Instituta Matematiki i Mekhaniki UrO RAN, 2013, Volume 19, Number 1, Pages 121–129
(Mi timm905)
|
|
|
|
Truncated dynamic programming method in a closed traveling salesman problem with symmetric value function
E. E. Ivanko Institute of Mathematics and Mechanics
Abstract:
A method for the exact solution of a closed traveling salesman problem with symmetric value function based on the dynamic programming method is presented. The method produces an optimal solution in a smaller number of operations as compared to the classical dynamic programming method. A short experiment, which compares the efficiencies of the classical scheme and of the new scheme in traveling salesman problems of different dimensions, is given in the end of the paper.
Keywords:
dynamic programming method, traveling salesman problem.
Received: 15.09.2012
Citation:
E. E. Ivanko, “Truncated dynamic programming method in a closed traveling salesman problem with symmetric value function”, Trudy Inst. Mat. i Mekh. UrO RAN, 19, no. 1, 2013, 121–129
Linking options:
https://www.mathnet.ru/eng/timm905 https://www.mathnet.ru/eng/timm/v19/i1/p121
|
|