On an iterative procedure for solving a routing problem with constraints / Chentsov A. A.,Chentsov A. G. // PROCEEDINGS OF THE STEKLOV INSTITUTE OF MATHEMATICS. - 2013. - V. 283, l. 1. - P. 24-45.

ISSN/EISSN:

0081-5438 / 1531-8605

Type:

Article

Abstract:

The generalized precedence constrained traveling salesman problem is considered in the case when travel costs depend explicitly on the list of tasks that have not been performed (by the time of the travel). The original routing problem with dependent variables is represented in terms of an equivalent extremal problem with independent variables. An iterative method based on this representation is proposed for solving the original problem. The algorithm based on this method is implemented as a computer program.

Author keywords:

route; precedence constraints; extremal problem TRAVELING SALESMAN PROBLEM; SETS

DOI:

10.1134/S0081543813090034

Web of Science ID:

ISI:000327079000003

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

—

Другие поля

Поле	Значение
Month	DEC
Publisher	MAIK NAUKA/INTERPERIODICA/SPRINGER
Address	233 SPRING ST, NEW YORK, NY 10013-1578 USA
Language	English
EISSN	1531-8605
Keywords-Plus	TRAVELING SALESMAN PROBLEM; SETS
Research-Areas	Mathematics
Web-of-Science-Categories	Mathematics, Applied; Mathematics
Author-Email	chentsov@imm.uran.ru
Funding-Acknowledgement	Program of the Presidium of the Russian Academy of Sciences ``Mathematical Theory of Control{''} {[}09-P-1-1007, 09-P-1-1014]; Russian Foundation for Basic Research {[}10-01-96020, 10-08-00484, 11-01-90432 ukr\_f\_a]
Funding-Text	This work was supported by the Program of the Presidium of the Russian Academy of Sciences ``Mathematical Theory of Control{''} (project nos. 09-P-1-1007 and 09-P-1-1014) and by the Russian Foundation for Basic Research (project nos. 10-01-96020, 10-08-00484, and 11-01-90432 ukr\_f\_a),
Number-of-Cited-References	24
Usage-Count-Since-2013	8
Journal-ISO	Proc. Steklov Inst. Math.
Doc-Delivery-Number	253IT