Exact and heuristic methods for the selective maintenance problem
We present in this paper, new resolution methods for the selective maintenance problem. This problem consists in finding the best choice of maintenance actions to be performed on a multicomponent system, so as to maximize the system reliability, within a time window of a limited duration. When the number of components of the system is important, this combinatorial problem is not easy to solve, in particular because of the nonlinear objective function modeling the system reliability. This problem did not receive much attention yet. Consequently, rare are the effective resolution methods that are offered to the user. We thus developed heuristics and an exact method based on a branch and bound procedure, which we apply to various system configurations. We compare the obtained results, and we evaluate the best method to be used in various situations.
Year of publication: |
2009
|
---|---|
Authors: | Lust, T. ; Roux, O. ; Riane, F. |
Published in: |
European Journal of Operational Research. - Elsevier, ISSN 0377-2217. - Vol. 197.2009, 3, p. 1166-1177
|
Publisher: |
Elsevier |
Keywords: | Selective maintenance Reliability Combinatorial optimization Branch and bound Tabu search |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
Exact and heuristic methods for the selective maintenance problem
Lust, T., (2009)
-
Exact and heuristic methods for the selective maintenance problem
Lust, T., (2009)
-
La culture régionale : ses liens avec le développement économique vu par l'Union provençale
Feraud, Henri, (2014)
- More ...