THE TRAVELING-SALESMAN PROBLEM WITH MOVING-OBJECTS

A generalization of the travelling-salesman problem (for references see, for example, the survey [1]), i.e., the problem of making an optimal round of moving objects (see also [2-5]), is examined. Conditions for the applicability of the dynamic programming method are pointed out, the class of dynamic models which satisfy these conditions is described, and a model example is presented.