CLARANS heuristic based approch for the k-traveling repairman problem

Abstract

In this paper, we propose an approach heuristic based on a mathematical approach for resolution of K-Traveling Repairman Problem 'K-TRP'. This approach is based on the heuristic classification method CLARANS which allows to convert a K-TRP in small problems containing a single repairman. After grouping, an optimized route is generated for every repairman in his indicated group. Computational results prove the efficiency of the proposed approach.