This article is cited 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.

UDC: 517.977

Received: 05.08.2013

Bibliographic databases:

• 
•