ON ROUTING PROBLEM WITH STARTING POINT OPTIMIZATION
One problem focused on engineering applications is considered. It is assumed that sequential visits to megacities have been implemented. After all visits have been made, it is required to return to the starting point (a more complex dependence on the starting point is also considered). But the last...
Main Authors: | Alexander G. Chentsov, Pavel A. Chentsov |
---|---|
Format: | Article |
Language: | English |
Published: |
Krasovskii Institute of Mathematics and Mechanics of the Ural Branch of the Russian Academy of Sciences and Ural Federal University named after the first President of Russia B.N.Yeltsin.
2020-12-01
|
Series: | Ural Mathematical Journal |
Subjects: | |
Online Access: | https://umjuran.ru/index.php/umj/article/view/264 |
Similar Items
-
On a Nonstationary Route Problem with Constraints
by: A. G. Chentsov, et al.
Published: (2015-02-01) -
OPTIMIZING THE STARTING POINT IN A PRECEDENCE CONSTRAINED ROUTING PROBLEM WITH COMPLICATED TRAVEL COST FUNCTIONS
by: Alexander G. Chentsov, et al.
Published: (2018-12-01) -
Routization Problem Complicated by the Dependence of Costs Functions and «Current» Restrictions From the Tasks List
by: A. G Chentsov, et al.
Published: (2016-04-01) -
Dynamic Programming in a Generalized Courier Problem with
Inner Tasks: Elements of a Parallel Structure
by: A. M. Grigoriev, et al.
Published: (2011-09-01) -
About a Routing Problem of the Tool Motion on Sheet Cutting
by: A. A. Petunin, et al.
Published: (2015-04-01)