Elements of dynamic programming in extremal routing problems / Chentsov A. A.,Chentsov A. G.,Chentsov P. A. // AUTOMATION AND REMOTE CONTROL. - 2014. - V. 75, l. 3. - P. 537-550.

ISSN/EISSN:

0005-1179 / 1608-3032

Type:

Article

Abstract:

This paper considers the routing problem of visiting megalopolises, which is complicated by constraints in the form of the precedence conditions and jobs within megalopolises. By assumption, the cost functions may depend on the list of pending jobs. We demonstrate that the developed theory can be applied to the dismantlement problem of a decommissioned power-generating unit in a nuclear plant. In this problem, the cost of moving depends on the list of pending jobs, viz., any still mounted components of the equipment have emission. Finally, we show that the computational difficulty of the constructed algorithms requires involving parallel structure elements.

Author keywords:

TRAVELING SALESMAN PROBLEM

DOI:

10.1134/S0005117914030102

Web of Science ID:

ISI:000332738300010

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

—

Другие поля

Поле	Значение
Month	MAR
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	chtntsov\_a\_@mail.ru chentsov@imm.uran.ru chentsov.p@mail.ru
Funding-Acknowledgement	Russian Foundation for Basic Research {[}10-01-96020, 12-01-00537, 11-01-90432-ukr\_f\_a]
Funding-Text	This work was supported by the Russian Foundation for Basic Research, projects nos. 10-01-96020, 12-01-00537, 11-01-90432-ukr\_f\_a).
Number-of-Cited-References	29
Usage-Count-Last-180-days	1
Usage-Count-Since-2013	9
Journal-ISO	Autom. Remote Control
Doc-Delivery-Number	AC7US