|
Trudy Instituta Matematiki i Mekhaniki UrO RAN, 2009, Volume 15, Number 4, Pages 270–289
(Mi timm443)
|
|
|
|
This article is cited in 8 scientific papers (total in 8 papers)
Iteration method in the routing problem with internal losses
A. A. Chentsov, A. G. Chentsov, P. A. Chentsov Institute of Mathematics and Mechanics, Ural Branch of the Russian Academy of Sciences
Abstract:
The problem of a sequential traversal of sets is considered, which is complicated by the necessity of fulfilling (internal) tasks on the sets as well as by restrictions in the form of precedence conditions. It is assumed that the method of aggregating the losses is additive. For the appearing extremal problem with dependent variables, an equivalent transformation is built for the optimization problem on a Cartesian product. Based on this, an iteration method is constructed that uses a reconstructible model of the courier problem (a traveling salesman problem complicated by precedence conditions).
Keywords:
route, path, precedence conditions.
Received: 10.03.2009
Citation:
A. A. Chentsov, A. G. Chentsov, P. A. Chentsov, “Iteration method in the routing problem with internal losses”, Trudy Inst. Mat. i Mekh. UrO RAN, 15, no. 4, 2009, 270–289; Proc. Steklov Inst. Math. (Suppl.), 269, suppl. 1 (2010), S48–S68
Linking options:
https://www.mathnet.ru/eng/timm443 https://www.mathnet.ru/eng/timm/v15/i4/p270
|
Statistics & downloads: |
Abstract page: | 424 | Full-text PDF : | 106 | References: | 74 | First page: | 4 |
|