TSP with multiple visits
This problem is PSPACE-complete even in the case in which the edge weights obey the triangle inequality. See


Hsi-Ming Ho, Joel Ouaknine, The Cyclic-Routing UAV Problem is PSPACE-Complete, FoSSaCS 2015