IDEAS home Printed from https://ideas.repec.org/a/ids/ijores/v29y2017i1p67-86.html
   My bibliography  Save this article

A hybrid DEA-based K-means and shuffled frog-leaping algorithm for maintenance selection

Author

Listed:
  • Farshad Faezy Razi

Abstract

One of the main topics in repair and maintenance management lies is a matter of selection of repair and maintenance activities. This issue inherently deals with multiple and diverse quantitative and qualitative criteria for the purpose of decision-making and the selection. For this reason, the present paper has presented a new methodology for multi-criteria decision-making to select among various maintenance and repair activities. In the proposed approach, repair and maintenance activities are initially clustered using K-means clustering algorithm. The optimal number of clusters in K-means algorithm is validated using Silhouette Index. After determining optimal number of clusters, efficiency of repair and maintenance activities in each cluster is measured using data envelopment analysis. The fuzzy inference system is used to predict risk of unavoidable repairs and maintenance activities studied in this paper. Then, a two-objective mathematical programming model is designed, which not only maximises efficiency of maintenance activities, but also minimises the risk attributed to maintenance activities. Pareto optimal solution relevant to discussed model is obtained using shuffled frog-leaping algorithm. A case study is used to intuitively express multi-criteria problem of selection of repair and maintenance activities.

Suggested Citation

  • Farshad Faezy Razi, 2017. "A hybrid DEA-based K-means and shuffled frog-leaping algorithm for maintenance selection," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 29(1), pages 67-86.
  • Handle: RePEc:ids:ijores:v:29:y:2017:i:1:p:67-86
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=83175
    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.

    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:ijores:v:29:y:2017:i:1:p:67-86. 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=170 .

    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.