The dynamic programming method in the generalized traveling salesman problem

Authors:
A. G. Chentsov;L. N. Korotayeva
Affiliations:
Institute of Mathematics and Mechanics, Urals Scientific Center S. Kovalevskaja str., 16, 620066 Ekaterinburg, Russia;Institute of Mathematics and Mechanics, Urals Scientific Center S. Kovalevskaja str., 16, 620066 Ekaterinburg, Russia
Venue:
Mathematical and Computer Modelling: An International Journal
Year:
1997

Citing 2
Cited 5

A generalization of the travelling-salesman problem at “bottlenecks”

Computational Mathematics and Mathematical Physics
Dynamic Programming Treatment of the Travelling Salesman Problem

Journal of the ACM (JACM)

Dynamic Programming in the Problem of Decomposition Optimization

Automation and Remote Control
A discrete particle swarm optimization algorithm for the generalized traveling salesman problem

Proceedings of the 9th annual conference on Genetic and evolutionary computation
Heuristic algorithms for route-search queries over geographical data

Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
Dynamic programming method in the generalized traveling salesman problem: The influence of inexact calculations

Mathematical and Computer Modelling: An International Journal
Keyword-aware optimal route search

Proceedings of the VLDB Endowment

Quantified Score

Hi-index	0.98

Visualization

Abstract

A procedure of the dynamic programming (DP) for the discrete-continuous problem of a route optimization is considered. It is possible to consider this procedure as a dynamic method of optimization of the towns choice in the well-known traveling salesman problem. In the considered version of DP, elements of a dynamic optimization are used. Two variants of the function of the aggregations of losses are investigated: 1.(1) the additive functions; 2.(2) the function characterizing the aggregation of losses in the bottle-neck problem.