IDEAS home Printed from https://ideas.repec.org/a/ids/ijmore/v4y2012i5p503-514.html
   My bibliography  Save this article

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

Author

Listed:
  • Imen Ome Ezzine
  • Sonda Elloumi

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.

Suggested Citation

  • Imen Ome Ezzine & Sonda Elloumi, 2012. "Polynomial formulation and heuristic based approach for the k-travelling repairman problem," International Journal of Mathematics in Operational Research, Inderscience Enterprises Ltd, vol. 4(5), pages 503-514.
    • Handle: RePEc:ids:ijmore:v:4:y:2012:i:5:p:503-514
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=48928
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. F. Angel-Bello & Y. Cardona-Valdés & A. Álvarez, 2019. "Mixed integer formulations for the multiple minimum latency problem," Operational Research, Springer, vol. 19(2), pages 369-398, June.
    2. David A. Flores-Garza & M. Angélica Salazar-Aguilar & Sandra Ulrich Ngueveu & Gilbert Laporte, 2017. "The multi-vehicle cumulative covering tour problem," Annals of Operations Research, Springer, vol. 258(2), pages 761-780, November.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ids:ijmore:v:4:y:2012:i:5:p:503-514. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=320 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.