The University of Southampton
University of Southampton Institutional Repository

Optimisation of system resources in reliability availability & maintainability problems using genetic algorithms

Optimisation of system resources in reliability availability & maintainability problems using genetic algorithms
Optimisation of system resources in reliability availability & maintainability problems using genetic algorithms
We propose an application of Genetic Algorithms to the output from Reliability Availability & Maintainability models of complex (mainly industrial) systems to reduce computational costs while maintaining a desired level of fidelity of the model. The paper notes the fundamental difficulty of applying resource optimisation to models of complex systems given the dimensional and computational costs involved in realising it. To date, several analytic approaches have been suggested to provide solutions, which are very fast, but fundamental question marks have arisen regarding their fidelity. By their nature they are limited in the complexity of problems they can tackle. A hybrid approach, which utilises Monte Carlo Simulations together with an analytic metric for the search process has also been proposed. This hybrid approach preserves the model's accuracy and fidelity, but as it involves a study of the model's physics is limited to spare parts and repair teams as the resources, and to the availability as the objective function in the optimisation. The approach proposed here also uses Monte Carlo Simulations, but the difference is that the Genetic Algorithms approach does not require any prior study of the model's underlying structure, instead referring to the Monte Carlo Simulations as a black box engine, which yields an accurate set of outputs for a given set of inputs. Hence, the Genetic Algorithms approach can be applied for the optimisation of a wider resources space and for any desired objective function defined and calculated in the model. A the same time, the application of the Genetic Algorithms is found to be an efficient and relatively cheap search method for optimisation
1-14
Gruber, A.
e2c365ab-5e1b-4af1-a2f8-05063688f850
Keane, A.J.
26d7fa33-5415-4910-89d8-fb3620413def
Gruber, A.
e2c365ab-5e1b-4af1-a2f8-05063688f850
Keane, A.J.
26d7fa33-5415-4910-89d8-fb3620413def

Gruber, A. and Keane, A.J. (2006) Optimisation of system resources in reliability availability & maintainability problems using genetic algorithms. 16th International MIRCE Symposium, Exeter, UK. 06 - 08 Dec 2006. pp. 1-14 .

Record type: Conference or Workshop Item (Paper)

Abstract

We propose an application of Genetic Algorithms to the output from Reliability Availability & Maintainability models of complex (mainly industrial) systems to reduce computational costs while maintaining a desired level of fidelity of the model. The paper notes the fundamental difficulty of applying resource optimisation to models of complex systems given the dimensional and computational costs involved in realising it. To date, several analytic approaches have been suggested to provide solutions, which are very fast, but fundamental question marks have arisen regarding their fidelity. By their nature they are limited in the complexity of problems they can tackle. A hybrid approach, which utilises Monte Carlo Simulations together with an analytic metric for the search process has also been proposed. This hybrid approach preserves the model's accuracy and fidelity, but as it involves a study of the model's physics is limited to spare parts and repair teams as the resources, and to the availability as the objective function in the optimisation. The approach proposed here also uses Monte Carlo Simulations, but the difference is that the Genetic Algorithms approach does not require any prior study of the model's underlying structure, instead referring to the Monte Carlo Simulations as a black box engine, which yields an accurate set of outputs for a given set of inputs. Hence, the Genetic Algorithms approach can be applied for the optimisation of a wider resources space and for any desired objective function defined and calculated in the model. A the same time, the application of the Genetic Algorithms is found to be an efficient and relatively cheap search method for optimisation

Text
grub_06.pdf - Accepted Manuscript
Download (2MB)

More information

Published date: 6 December 2006
Venue - Dates: 16th International MIRCE Symposium, Exeter, UK, 2006-12-06 - 2006-12-08

Identifiers

Local EPrints ID: 46183
URI: http://eprints.soton.ac.uk/id/eprint/46183
PURE UUID: acd75b4f-bcb6-4dab-b4eb-17e6ea2a6d47
ORCID for A.J. Keane: ORCID iD orcid.org/0000-0001-7993-1569

Catalogue record

Date deposited: 29 May 2007
Last modified: 16 Mar 2024 02:53

Export record

Contributors

Author: A. Gruber
Author: A.J. Keane ORCID iD

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×