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

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

0.00 Avg rating0 Votes
Article ID: iaor201477
Volume: 212
Issue: 1
Start Page Number: 185
End Page Number: 200
Publication Date: Jan 2014
Journal: Annals of Operations Research
Authors: , ,
Keywords: programming: assignment, heuristics: local search
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.

Reviews

Required fields are marked *. Your email address will not be published.