A Discrete–Continuous Routing Problem with Precedence Constraints

Аннотация

We consider the problem of visiting closed sets in a compact metric space complicated by constraints in the form of precedence constraints and a possible dependence of the cost function on a set of tasks. We study a variant of the approximate realization of the extremum by applying models that involve problems of sequential visits to megalopolises (nonempty finite sets). This variant is naturally embedded into a more general construction that implements sequential visits to nonempty closed sets (NCSs) from a finite system in a metrizable compact space. The space of NCSs is equipped with the Hausdorff metric, which is used to estimate (under the corresponding condition that the sections of the cost functions are continuous) the proximity of the extrema in the problem of sequential visits for any two systems of NCSs (it is assumed that the numbers or NCSs in the systems are the same). The constraints in the form of precedence constraints are preserved in this variant.