Dynamic programming in the routing problem with complex dependence of costs on the list of jobs / Chentsov A. A.,Chentsov A. G. // JOURNAL OF COMPUTER AND SYSTEMS SCIENCES INTERNATIONAL. - 2014. - V. 53, l. 2. - P. 172-185.

ISSN/EISSN:

1064-2307 / 1555-6530

Type:

Article

Abstract:

The problem of visiting megalopolises complicated by precedence constraints and by the dependence of the cost functions (external moves and internal jobs) on the list of subsequent jobs is considered. A modification of the dynamic programming method is proposed and an algorithm based on this modification is developed; this algorithm is implemented on a personal computer.

Author keywords:

нет данных

DOI:

10.1134/S1064230714020051

Web of Science ID:

ISI:000334499500003

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

—

Другие поля

Поле	Значение
Month	MAR
Publisher	MAIK NAUKA/INTERPERIODICA/SPRINGER
Address	233 SPRING ST, NEW YORK, NY 10013-1578 USA
Language	English
EISSN	1555-6530
Research-Areas	Computer Science
Web-of-Science-Categories	Computer Science, Artificial Intelligence; Computer Science, Cybernetics; Computer Science, Theory \& Methods
Author-Email	chentsov@imm.uran.ru
Funding-Acknowledgement	Presidium of the Russian Academy of Sciences {[}12-P-1-1012, 12-P-1-1019]; Russian Foundation for Basic Research {[}13-01-90414 Ukr\_f\_a, 12-01-0057]
Funding-Text	This work was supported by the Presidium of the Russian Academy of Sciences (project nos. 12-P-1-1012 and 12-P-1-1019) and by the Russian Foundation for Basic Research (project nos. 13-01-90414 Ukr\_f\_a and 12-01-0057).
Number-of-Cited-References	19
Usage-Count-Since-2013	1
Journal-ISO	J. Comput. Syst. Sci. Int.
Doc-Delivery-Number	AF1UN