LAUSR

The generalized travelling salesman problem (GTSP) is a variant of the well-known travelling salesman problem. The cities are in this case spread into clusters and only one city from each one must be visited to make a cyclic tour with a minimal cost. Following this assumption, an instance can be subject to dimensionality reduction since removing some cities from each cluster will keep feasible solutions and then will preserve feasibility of the instance. Therefore, we propose a new preprocessing technique which consists of selecting from each cluster the nearest nodes to other clusters and removing the nodes that had never been selected in order to reduce the search space size. The suggested approach is tested on a large set of symmetric instances of different sizes picked from the different benchmarks. The reduction is performed in a negligible runtime, while the reduction rate is up to 98%, which is very competitive compared to the only reduction method for the GTSP we are aware of. State-of-the-art solvers for the GTSP were applied to the reduced instances to evaluate their performances. We show that the reduced instances help these solvers to obtain good solutions in a shorter time but do not guarantee to get the optimal ones, while they provide better solutions in a fixed time budget environment.