Polynomial formulation and heuristic based approach for the k-travelling repairman problem

Imen Ome Ezzine and Sonda Elloumi

International Journal of Mathematics in Operational Research, 2012, vol. 4, issue 5, 503-514

Abstract: In this paper, we propose a polynomial linear integer formulation for the k-travelling repairman problem (k-TRP) and a heuristic method. The latter is a k-means clustering algorithm used to efficiently assigning of customers to k groups. Two versions of k-means algorithm are tested: the k-means in its original version and the balanced k-means, which we propose in this context. After clustering, an optimised route is generated by a polynomial linear integer formulation for each customer in his allotted cluster. Computational results prove the efficiency of the proposed approach, especially when the balanced k-means algorithm is applied.

Keywords: polynomial mathematical formulation; integer programming; k-TRP; travelling repairman problem; balanced k-means; clustering algorithms; heuristics. (search for similar items in EconPapers)
Date: 2012
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.inderscience.com/link.php?id=48928 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijmore:v:4:y:2012:i:5:p:503-514

Access Statistics for this article

More articles in International Journal of Mathematics in Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().