A Birnbaum-importance based genetic local search algorithm for component assignment problems

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalpeer-review

34 Scopus Citations
View graph of relations

Author(s)

Related Research Unit(s)

Detail(s)

Original languageEnglish
Pages (from-to)185-200
Journal / PublicationAnnals of Operations Research
Volume212
Issue number1
Publication statusPublished - Jan 2014

Abstract

This paper considers the component assignment problem (CAP) of finding the optimal assignment of n available components to n positions in a system such that the system reliability is maximized. To solve the CAP, an important type of problems in reliability, we propose a Birnbaum-importance based genetic local search (BIGLS) algorithm in which a local search using the Birnbaum importance is embedded into the genetic algorithm. This paper presents comprehensive numerical tests to compare the performance of the BIGLS with a general genetic algorithm and a Birnbaum-importance based two-stage heuristic. The testing results show that the BIGLS is robust (with respect to its random operations) and effective, and outperforms two benchmark methods in terms of solution quality. It demonstrates the effectiveness of embedding the Birnbaum importance in the local search under the genetic evolutionary mechanism. © 2012 Springer Science+Business Media, LLC.

Research Area(s)

  • Birnbaum importance, Component assignment problem, Genetic algorithm, Local search, Reliability