Menu: Home :: go to Journal :: switch to Russian :: switch to English
You are here: all Journals and Issues→ Journal→ Issue→ Article

ROUTE PROBLEM IN WHICH COST FUNCTIONS AND «CURRENT» CONSTRAINTS DEPEND FROM TASKS LIST

Annotation

Under conditions when both cost functions and «current» constraints depend from tasks list, the «additive» problem of the sequential circuit of megalopolises is considered (it is possible that tasks are not fulfilled or conversely already fulfilled). The above-mentioned singularities arise under investigation of the following engineering problems: the problem about dismantling of energy block of atomic electric station revealed from exploitation and the problem of the control under leaf cutting of details on machines with numerical programmed control (CNC). In article, algorithmic variant of the dynamic programming procedure is presented; this variant was realized on PC.

Keywords

route; megalopolis; preceding condition

Full-text in one file

Download

UDC

519.6

Pages

1521-1525

References

1. Chentsov A.G. Ekstremal'nye zadachi marshrutizatsii i raspredeleniya zadaniy: voprosy teorii. M.-Izhevsk: NITs .Regulyarnaya i khaoticheskaya dinamika., 2008. 238 s. 2. Chentsov A.G. K voprosu o marshrutizatsii kompleksa rabot // Vestn. Udmurtsk. un-ta. Matem. Mekh. Komp'yut. nauki. 2013. Vyp. 1. C. 59–82. 3. Chentsov A.G., Chentsov A.A. Dinamicheskoe programmirovanie v zadache marshrutizatsii s ogranicheniyami i stoimostyami, zavisyashchimi ot spiska zadaniy // Doklady Akademii nauk. 2013. T. 453. № 1. C. 20–23.

Received

2015-05-19

Section of issue

Scientific articles

Для корректной работы сайта используйте один из современных браузеров. Например, Firefox 55, Chrome 60 или более новые.