We address the Capacitated m-Ring-Star Problem (CmRSP) in which the goal is to nd m rings (simple cycles) visiting a central depot, a subset of customers and a subset of potential (Steiner) nodes, while customers not belonging to any ring must be -allocated- to a visited (customer or Steiner) node. Moreover, the rings must be node-disjoint and the number of customers allocated or visited in a ring cannot be greater than a capacity Q. The objective is to minimize the total visiting and allocation costs. The problem is a generalization of the Traveling Salesman Problem, hence it is NP-hard. We present a new heuristic approach based on a Variable Neighborhood Search (VNS), that incorporates an Integer Linear Programming (ILP) based improvement procedure. Preliminary computational results, performed to compare the proposed VNS method with existing algorithms for CmRSP, shows that the proposed method can obtain slightly better results but in a larger CPU time.

Keywords