🚀 go-pugleaf

I have a problem which can be viewed as an extended version of
traveling salesman. I would like to know if anything similar
(or the problem itself, hopefully) is studied, or at least defined
in literature..
In this version, the cities are replaced with sets of cities.
Each set is to be visited only once with a choice of an element
of it (for example, visit one city of each given state). No two
cities of the same set can be visited during the tour and the last
city should be the same as the starting one.