Оptimization of the Start Point in the Gtsp with the Precedence Conditions

Abstract

The paper is devoted to the routing problem with constraints and cost functions that can depend on the list of tasks. It is assumed that the initial condition for the process with discrete time can be selected within a metric space that satises the condition of complete boundedness. It is supposed that the problem includes a visiting of a nite system of megalopolises (non-empty nite sets) with the fulllment of some works. The cost of these works each time depend on the point of arrival and the point of departure. The costs of movement and work are aggregated additively. For the problem solution widely understood dynamic programming method providing ε-optimal solution for any ε > 0 is used.