Elements of Dynamic Programming in Local Improvement Constructions for Heuristic Solutions of Routing Problems with Constraints / Petunin A. A.,Chentsov A. A.,Chentsov A. G.,Chentsov P. A. // AUTOMATION AND REMOTE CONTROL. - 2017. - V. 78, l. 4. - P. 666-681.

ISSN/EISSN:

0005-1179 / 1608-3032

Type:

Article

Abstract:

We consider methods for solving routing problems with precedence constraints that use iterative modes based on Bellman insertions while recomputing precedence constraints of the original problem; we assume that the dimension of the latter is sufficiently large, which does not let us, due to complexity of computations, immediately apply dynamic programming in the ``global{''} version.

Author keywords:

dynamic programming; route; precedence constraints TRAVELING SALESMAN PROBLEM

DOI:

10.1134/S0005117917040087

Web of Science ID:

ISI:000399415600008

Соавторы в МНС:

Другие поля

Поле	Значение
Month	APR
Publisher	MAIK NAUKA/INTERPERIODICA/SPRINGER
Address	233 SPRING ST, NEW YORK, NY 10013-1578 USA
Language	English
EISSN	1608-3032
Keywords-Plus	TRAVELING SALESMAN PROBLEM
Research-Areas	Automation \& Control Systems; Instruments \& Instrumentation
Web-of-Science-Categories	Automation \& Control Systems; Instruments \& Instrumentation
Author-Email	aapetunin@gmail.com chentsov.a@binsys.ru chentsov@imm.uran.ru chentsov.p@mail.ru
Funding-Acknowledgement	Program of the Presidium of the Russian Academy of Sciences in Optimal Control; Russian Government {[}02.A03.21.0006]
Funding-Text	This work was supported by the Program of the Presidium of the Russian Academy of Sciences in Optimal Control ``Mathematical Problems of Modern Control Theory,{''} ``Synthesizing Controls with Incomplete Data, the Reachability Problem, and Dynamic Optimization{''}; Proposition 211 of the Russian Government, contract no. 02.A03.21.0006.
Number-of-Cited-References	21
Usage-Count-Last-180-days	4
Usage-Count-Since-2013	4
Journal-ISO	Autom. Remote Control
Doc-Delivery-Number	ES3FX