A grasp +vnd algorithm for the multiple traveling repairmen problem with distance constraints
A grasp +vnd algorithm for the multiple traveling repairmen problem with distance constraints
In our work, we propose a metaheuristic algorithm which is mainly based on the principles of Greedy Randomized Adaptive Search Procedure (GRASP) and Variable Neighborhood Descent (VND) to solve the problem. The GRASP is used to build an initial solution which is good enough in a construction phase.