OPTIMIZING THE STARTING POINT IN A PRECEDENCE CONSTRAINED ROUTING PROBLEM WITH COMPLICATED TRAVEL COST FUNCTIONS

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...

Full description

Bibliographic Details
Main Authors: Alexander G. Chentsov, Alexey M. Grigoryev, Alexey 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. 2018-12-01
Series:Ural Mathematical Journal
Subjects:
Dynamic programming, Route, Sequencing, Precedence constraints, Parallel computation
Online Access:https://umjuran.ru/index.php/umj/article/view/118

Similar Items

Similar Items