Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 2018, Volume 28, Issue 4, Pages 513–530
This article is cited in 1 scientific paper (total in 1 paper)
Optimizing multi-inserts in routing problems with constraints
A. G. Chentsovab, A. M. Grigor'eva
a Krasovskii Institute of Mathematics and Mechanics, Ural Branch of the Russian Academy of
Sciences, ul. S. Kovalevskoi, 16, Yekaterinburg, 620219, Russia
b Ural Federal University, ul. Mira, 19, Yekaterinburg, 620002, Russia
We consider a problem of sequential traversal of megalopolises (nonempty finite sets) with travel cost functions depending on the set of pending tasks and precedence constraints. Its formulation is aimed at engineering problems in fission power generation connected with minimizing the exposure of staff to radiation and in machine engineering (routing of a CNC sheet cutting machine's tool). This discrete optimization problem is assumed to be sufficiently large-scale to necessitate the use of heuristics. We consider a procedure of local improvement for heuristics through a successive application of optimizing multi-inserts-finite disjoint sets of inserts. Each insert is assumed to be optimized by means of a broadly understood dynamic programming procedure. We show that in an “additive” routing problem of this kind (with precedence constraints and complex travel cost functions) the result's improvements are also aggregated additively. The proposed construction admits a parallel implementation for multiprocessor systems; in this case, the inserts are distributed to computational nodes and formed in an independent way.
dynamic programming, multi-inserts, parallel algorithm.
|Russian Science Foundation
|This work was supported by the Russian Science Foundation (project no. 14-11-00109).
PDF file (427 kB)
MSC: 49L20, 90C39
A. G. Chentsov, A. M. Grigor'ev, “Optimizing multi-inserts in routing problems with constraints”, Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 28:4 (2018), 513–530
Citation in format AMSBIB
\by A.~G.~Chentsov, A.~M.~Grigor'ev
\paper Optimizing multi-inserts in routing problems with constraints
\jour Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki
Citing articles on Google Scholar:
Related articles on Google Scholar:
This publication is cited in the following articles:
A. G. Chentsov, A. A. Chentsov, “K voprosu o marshrutizatsii peremeschenii v zadache s dinamicheskimi ogranicheniyami”, Vestn. Udmurtsk. un-ta. Matem. Mekh. Kompyut. nauki, 29:3 (2019), 363–381
|Number of views:|