A hybrid optimization algorithm for standardization of maintenance plans

0Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper presents an algorithm to solve the combinatorial optimization problem in the definition of preventive maintenance plans. This problem is not easy to solve, since tasks performed on assets can be redundant or not required. The objective is a more accurate definition of plans to reduce maintenance costs, where different optimization algorithms can be used. Taking a single optimization algorithm approach could serve to find an optimal solution depending of the use case, but it does not find reliable results in a generic way. The new hybrid approach with 4 different algorithms shows that better results are obtained than the use of the individual optimization algorithms.

Cite

CITATION STYLE

APA

Gilabert, E., Konde, E., Arnaiz, A., & Sierra, B. (2018). A hybrid optimization algorithm for standardization of maintenance plans. In Studies in Computational Intelligence (Vol. 798, pp. 135–144). Springer Verlag. https://doi.org/10.1007/978-3-319-99626-4_12

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free