OPTIMIZING THE STARTING POINT IN A PRECEDENCE CONSTRAINED ROUTING PROBLEM WITH COMPLICATED TRAVEL COST FUNCTIONS
We study the optimization of the initial state, route (a permutation of indices), and track in an extremal problem connected with visiting a finite system of megalopolises subject to precedence constraints where the travel cost functions may depend on the set of (pending) tasks. This problem stateme...
Saved in:
Main Authors: | Alexander G. Chentsov, Alexey M. Grigoryev, Alexey A. Chentsov |
---|---|
Format: | Article |
Language: | English |
Published: |
Ural Branch of the Russian Academy of Sciences and Ural Federal University named after the first President of Russia B.N.Yeltsin, Krasovskii Institute of Mathematics and Mechanics
2018-12-01
|
Series: | Ural Mathematical Journal |
Subjects: | |
Online Access: | https://umjuran.ru/index.php/umj/article/view/118 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
ON ROUTING PROBLEM WITH STARTING POINT OPTIMIZATION
by: Alexander G. Chentsov, et al.
Published: (2020-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) -
On a Nonstationary Route Problem with Constraints
by: A. G. Chentsov, et al.
Published: (2015-02-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)