[Optimization] Is multi-days Travelling Salesman Problem the same as mTSP?

Hello,
I'm very green to ML and I'm looking for a little project to start getting my hands dirty. I've completed the 3 Pluralsight courses on ML using Encog. One of the proposed case studies is TSP using Genetic Algo.
I want to take things a bit further: suppose we have N cities and our Travelling Salesman has D days to visit them all, how would you model this using ML?
I'm wondering if this problem can be thought as a variant of TSP where you have multiple salesmen, except this time it's the same salesman in disguise. However it is, I'm guessing there needs to be a windowing of nodes, as in, e.g. consider from x to y nodes for each day (or salesman).
Any hint \ suggestion \ tip \ reference is welcomed :)