Routing under constraints: problem of visit to megalopolises

Consideration was given to the problems of routing transfers under conditions of precedence and dynamic constraints including the dependence of the list of jobs both already completed by the instant of transfer or, on the contrary, not yet completed. The transfer costs also can be dependent on the list of jobs. The megalopolises (nonempty finite sets) are the objects of visits, which corresponds to the possible multiple-choice of transfers. The widely understood dynamic programming in a realization not requiring (under the precedence conditions) construction of the entire array of the Bellman function values is used as the basic method of study. The procedure of constructing a “complete” solution including determination of the optimal solution route and track (trajectory) and the procedure determining the problem value (global extremum) can be used separately to test the heuristic algorithms. An efficient heuristic algorithm was constructed to solve the routing problems of great dimension complicated by the constraints typical of the sheet cutting on the machines with computerized numerical control. For moderate problems, the results obtained were compared with the optimal result provided by the dynamic programming.