CLARANS heuristic based approch for the k-traveling repairman problem

被引:0
|
作者
Hmayer, Amira [1 ]
Ezzine, Imen Ome [1 ]
机构
[1] Univ Kairouan, SII ISIG, Kairouan, Tunisia
来源
2013 INTERNATIONAL CONFERENCE ON ADVANCED LOGISTICS AND TRANSPORT (ICALT) | 2013年
关键词
K-Traveling Repairman Problem; Traveling Repairman Problem; the Traveling Salesman Problem; heuristics; CLARANS;
D O I
暂无
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
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.
引用
收藏
页码:535 / 538
页数:4
相关论文
共 50 条
  • [42] An Efficient Evolutionary Metaheuristic for the Traveling Repairman (Minimum Latency) Problem
    Boldizsár Tüű-Szabó
    Péter Földesi
    László T. Kóczy
    International Journal of Computational Intelligence Systems, 2020, 13 : 781 - 793
  • [43] AN EFFECTIVE METAHEURISTIC FOR MULTIPLE TRAVELING REPAIRMAN PROBLEM WITH DISTANCE CONSTRAINTS
    Ban, Ha-Bang
    Duc-Nghia Nguyen
    Kien Nguyen
    COMPUTING AND INFORMATICS, 2019, 38 (04) : 883 - 916
  • [44] A GRASP with iterated local search for the traveling repairman problem with profits
    Avci, Mustafa
    Avci, Mualla Gonca
    COMPUTERS & INDUSTRIAL ENGINEERING, 2017, 113 : 323 - 332
  • [45] An effective hybrid search algorithm for the multiple traveling repairman problem with profits
    Ren, Jintong
    Hao, Jin-Kao
    Wu, Feng
    Fu, Zhang-Hua
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2023, 304 (02) : 381 - 394
  • [46] An ant-based heuristic for the railway traveling salesman problem
    Pop, Petrica C.
    Pintea, Camelia M.
    Sitar, Corina Pop
    APPLICATIONS OF EVOLUTIONARY COMPUTING, PROCEEDINGS, 2007, 4448 : 702 - +
  • [47] A Hybrid Biogeography Based Heuristic for the Mirrored Traveling Tournament Problem
    Gupta, Daya
    Goel, Lavika
    Aggarwal, Vipin
    2013 SIXTH INTERNATIONAL CONFERENCE ON CONTEMPORARY COMPUTING (IC3), 2013, : 325 - 330
  • [48] A Fast 4-Approximation Algorithm for the Traveling Repairman Problem on a Line
    Perez Perez, S. L.
    Urban Riverol, L. E.
    Lopez Bracho, R.
    Zaragoza Martinez, F. J.
    2014 11TH INTERNATIONAL CONFERENCE ON ELECTRICAL ENGINEERING, COMPUTING SCIENCE AND AUTOMATIC CONTROL (CCE), 2014,
  • [49] THE APPROXIMATION RATIO OF THE k-OPT HEURISTIC FOR THE EUCLIDEAN TRAVELING SALESMAN PROBLEM
    Brodowsky, Ulrich A.
    Hougardy, Stefan
    Zhong, Xianghui
    SIAM JOURNAL ON COMPUTING, 2023, 52 (04) : 841 - 864
  • [50] A NEW HEURISTIC FOR THE TRAVELING SALESMAN PROBLEM
    CARLIER, J
    VILLON, P
    RAIRO-RECHERCHE OPERATIONNELLE-OPERATIONS RESEARCH, 1990, 24 (03): : 245 - 253