Generalized a bottleneck routing problem: dynamic programming and the start point optimization

Abstract

One routing problem with constraints is considered. These constraints are reduced to precedence conditions which be to visiting sequence of megalopolises. This sequence is selected together with concrete trajectory and initial state for minimization of nonadditive criterion. These criterion is some generalization of known criterion for the bottleneck routing problem. The basis singularity of the used solving method consists of using of unique dynamic programming procedure for all initial states. The used criterion includes a controlled parameter influences on significance of different fragments of solution. © 2018