About construction of realizability arias of salesman strategies in dynamic salesmen problem

The dynamic travelling salesman problem, where we assume that all objects can move with constant velocity, is considered. To solve this NP-hard problem we use a game-theoretic approach and well-known solution concepts of pursuit games. We identify the realizability areas of salesman strategies depending on the initial positions of customers and their velocities. We present different cases of realizability areas of salesman strategies constructing in Python program with several numbers of customers.