Please use this identifier to cite or link to this item:
http://elar.urfu.ru/handle/10995/27272
Title: | On an iterative procedure for solving a routing problem with constraints |
Authors: | Chentsov, A. A. Chentsov, A. G. |
Issue Date: | 2013 |
Citation: | Chentsov A. A. On an iterative procedure for solving a routing problem with constraints / A. A. Chentsov, A. G. Chentsov // Proceedings of the Steklov Institute of Mathematics. — 2013. — Vol. 283. — № 1. — P. 24-45. |
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. © 2013 Pleiades Publishing, Ltd. |
Keywords: | EXTREMAL PROBLEM PRECEDENCE CONSTRAINTS ROUTE |
URI: | http://elar.urfu.ru/handle/10995/27272 |
RSCI ID: | 21889415 |
SCOPUS ID: | 84887580435 |
WOS ID: | 000327079000003 |
PURE ID: | 842504 |
ISSN: | 0081-5438 |
DOI: | 10.1134/S0081543813090034 |
Appears in Collections: | Научные публикации ученых УрФУ, проиндексированные в SCOPUS и WoS CC |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
scopus-2013-0436.pdf | 1,42 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.