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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    CLARANS heuristic based approch for the k-traveling repairman problem


    Contributors:


    Publication date :

    2013-05-01


    Size :

    263793 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English




    Light Sport Repairman

    Online Contents | 2004


    Diagnosis of Satellites -Top-Down Approch-

    Iwata, T. / Motomura, Y. / Machida, K. | British Library Conference Proceedings | 2002


    Heuristic Approach to the Traveling Salesman Problem

    C. Y. Huang / S. H. Lane | NTIS | 1987


    Flight Facilities Equipment Repairman, AFSC 30451

    T. J. O'Connor / H. H. Marvel | NTIS | 1977