Basics of genetic algorithms optimization for RAMS applications [An article from: Reliability Engineering and System Safety]
Book Details
Author(s)M. Marseguerra, E. Zio, S. Martorell
PublisherElsevier
ISBN / ASINB000P6O35W
ISBN-13978B000P6O358
AvailabilityAvailable for download now
Sales Rank99,999,999
MarketplaceUnited States 🇺🇸
Description
This digital document is a journal article from Reliability Engineering and System Safety, published by Elsevier in 2006. The article is delivered in HTML format and is available in your Amazon.com Media Library immediately after purchase. You can view it with any web browser.
Description:
This paper discusses the use of genetic algorithms (GA) within the area of reliability, availability, maintainability and safety (RAMS) optimization. First, the multi-objective optimization problem is formulated in general terms and two alternative approaches to its solution are illustrated. Then, the theory behind the operation of GA is presented. The steps of the algorithm are sketched to some details for both the traditional breeding procedure as well as for more sophisticated breeding procedures. The necessity of affine transforming the fitness function, object of the optimization, is discussed in detail, together with the transformation itself. In addition, how to handle constraints by the penalization approach is illustrated. Finally, specific metrics for measuring the performance of a genetic algorithm are introduced.
Description:
This paper discusses the use of genetic algorithms (GA) within the area of reliability, availability, maintainability and safety (RAMS) optimization. First, the multi-objective optimization problem is formulated in general terms and two alternative approaches to its solution are illustrated. Then, the theory behind the operation of GA is presented. The steps of the algorithm are sketched to some details for both the traditional breeding procedure as well as for more sophisticated breeding procedures. The necessity of affine transforming the fitness function, object of the optimization, is discussed in detail, together with the transformation itself. In addition, how to handle constraints by the penalization approach is illustrated. Finally, specific metrics for measuring the performance of a genetic algorithm are introduced.
