The Generalized Close Enough Traveling Salesman Problem

•The Generalized Close Enough Traveling Salesman Problem (GCETSP) is introduced.•The GCETSP is a new variation of the traveling salesman problem.•In the GCETSP, each customer is associated with a set of disks with different radii to model real-world scenarios.•The goal is to determine the route that maximizes the difference between the collected prize and the route length.•A heuristic algorithm and a genetic algorithm (GA) are proposed to solve the problem.