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.
CLARANS heuristic based approch for the k-traveling repairman problem
2013-05-01
263793 byte
Conference paper
Electronic Resource
English
Online Contents | 2004
Diagnosis of Satellites -Top-Down Approch-
British Library Conference Proceedings | 2002
|Heuristic Approach to the Traveling Salesman Problem
NTIS | 1987
|Flight Facilities Equipment Repairman, AFSC 30451
NTIS | 1977
|