DocumentCode
624931
Title
CLARANS heuristic based approch for the k-traveling repairman problem
Author
Hmayer, Amira ; Ezzine, Imen Ome
Author_Institution
SII/ISIG, Univ. of Kairouan, Kairouan, Tunisia
fYear
2013
fDate
29-31 May 2013
Firstpage
535
Lastpage
538
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.
Keywords
combinatorial mathematics; optimisation; pattern classification; CLARANS heuristic based approch; K-TRP; heuristic classification method; k-traveling repairman problem; mathematical approach; optimized route; Approximation algorithms; Approximation methods; Classification algorithms; Clustering algorithms; Heuristic algorithms; Mathematical model; Polynomials; CLARANS; K-Traveling Repairman Problem; Traveling Repairman Problem; heuristics; the Traveling Salesman Problem;
fLanguage
English
Publisher
ieee
Conference_Titel
Advanced Logistics and Transport (ICALT), 2013 International Conference on
Conference_Location
Sousse
Print_ISBN
978-1-4799-0314-6
Type
conf
DOI
10.1109/ICAdLT.2013.6568515
Filename
6568515
Link To Document