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 条
  • [31] The risk-averse traveling repairman problem with profits
    Beraldi, P.
    Bruni, M. E.
    Lagana, D.
    Musmanno, R.
    SOFT COMPUTING, 2019, 23 (09) : 2979 - 2993
  • [32] Memetic algorithm for the multiple traveling repairman problem with profits
    Lu, Yongliang
    Benlic, Una
    Wu, Qinghua
    Peng, Bo
    ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2019, 80 : 35 - 47
  • [33] Hybrid evolutionary search for the traveling repairman problem with profits
    Lu, Yongliang
    Hao, Jin-Kao
    Wu, Qinghua
    INFORMATION SCIENCES, 2019, 502 : 91 - 108
  • [34] Metaheuristic for the Traveling Repairman Problem with Time Window Constraints
    Bang, Ha Ban
    Nghia, Duc Nguyen
    2019 IEEE - RIVF INTERNATIONAL CONFERENCE ON COMPUTING AND COMMUNICATION TECHNOLOGIES (RIVF), 2019, : 1 - 6
  • [35] NEW FORMULATIONS FOR THE TRAVELING REPAIRMAN PROBLEM WITH TIME WINDOWS
    Kara, Imdat
    Uzun, Gozde Onder
    PROCEEDINGS OF THE 6TH INTERNATIONAL CONFERENCE ON CONTROL AND OPTIMIZATION WITH INDUSTRIAL APPLICATIONS, VOL I, 2018, : 222 - 224
  • [36] Routing Under Uncertainty: The a priori Traveling Repairman Problem
    van Ee, Martijn
    Sitters, Rene
    APPROXIMATION AND ONLINE ALGORITHMS, WAOA 2014, 2015, 8952 : 248 - 259
  • [37] Heuristic Approch for Solving the Makespan Problem in a Hospital Sterilization Service
    Soufi, Amal
    Mjirda, Anis
    Mourad, Abed
    2014 INTERNATIONAL CONFERENCE ON ADVANCED LOGISTICS & TRANSPORT (ICALT 2014), 2014, : 179 - 183
  • [38] A heuristic for the traveling salesman problem based on a continuous approximation
    del Castillo, JM
    TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 1999, 33 (02) : 123 - 152
  • [39] A NEW HEURISTIC FOR TRAVELING SALESMAN PROBLEM BASED ON LCO
    Yokoyama, Soichiro
    Suzuki, Ikuo
    Yamamoto, Masahito
    Furukawa, Masashi
    PROCEEDINGS OF THE ASME/ISCIE INTERNATIONAL SYMPOSIUM ON FLEXIBLE AUTOMATION, ISFA 2012, 2013, : 345 - 350
  • [40] An ILP approach for the Traveling Repairman Problem with Unit Time Windows
    Miguel-Pilar, Yani
    Morales-Luna, Guillermo
    Sagols Troncoso, Feliu
    Zaragoza Martinez, Francisco Javier
    2015 12TH INTERNATIONAL CONFERENCE ON ELECTRICAL ENGINEERING, COMPUTING SCIENCE AND AUTOMATIC CONTROL (CCE 2015), 2015,
12345