|
Trudy Instituta Matematiki i Mekhaniki UrO RAN, 2013, Volume 19, Number 4, Pages 125–130
(Mi timm1006)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Dynamic programming in a problem of rearranging single-type objects
E. E. Ivanko Institute of Mathematics and Mechanics, Ural Branch of the Russian Academy of Sciences, Ekaterinburg
Abstract:
We consider the problem of optimizing travels over a nonhomogeneous region in the process of rearranging $n$ single-type objects to $n$ new positions. We discuss possible applications of this problem, obtain a dynamic programming method for the construction of an optimal route combining the collection and placement of objects, and carry out a numerical experiment on a model segment of a map.
Keywords:
rearrangement of objects, dynamic programming, traveling salesman problem.
Received: 05.08.2013
Citation:
E. E. Ivanko, “Dynamic programming in a problem of rearranging single-type objects”, Trudy Inst. Mat. i Mekh. UrO RAN, 19, no. 4, 2013, 125–130
Linking options:
https://www.mathnet.ru/eng/timm1006 https://www.mathnet.ru/eng/timm/v19/i4/p125
|
Statistics & downloads: |
Abstract page: | 388 | Full-text PDF : | 118 | References: | 52 | First page: | 2 |
|