The generalized covering traveling salesman problem
We develop a problem with potential applications in humanitarian relief transportation and telecommunication networks. Two mathematical methods and two metaheuristic algorithms are proposed to solve the problem. The introduced problem is a generalization of the covering salesman problem and the proposed method has been adapted to be used for this problem as well. The results have been compared with the state of the art algorithms available in the literature.
traveling salesman problem humanitarian relief transportation memetic algorithm variable neighborhood search