An exact algorithm for the reliability redundancy allocation problem

• Published in: European journal of operational research Vol. 244; no. 1; pp. 110 - 116
• Main Authors: Caserta, Marco, Voß, Stefan
• Format: Journal Article
• Language: English
• Published: Amsterdam Elsevier B.V 01.07.2015; Elsevier Sequoia S.A
• Subjects: Algorithms; Allocations; Benchmarking; Benchmarks; Branch & bound algorithms; Branch and cut; Knapsack problem; Multiple choice knapsack problem; Operational research; Optimization; Optimization algorithms; Redundancy; Redundancy allocation problem; Redundant components; Resource allocation; Studies; Work stations; Workstations; Redundancy allocation problem; Branch and cut; Multiple choice knapsack problem
• ISSN: 0377-2217; 1872-6860
• DOI: 10.1016/j.ejor.2015.01.008

•New exact algorithm for the redundancy allocation problem.•Applying a two-step problem transformation to the multiple choice knapsack problem.•Considerable improvements in running time and solution quality over earlier methods. The redundancy allocation problem is the problem of finding an optimal allocation of redundant components subject to a set of resource constraints. The problem studied in this paper refers to a series-parallel system configuration and allows for component mixing. We propose a new modeling/solution approach, in which the problem is transformed into a multiple choice knapsack problem and solved to optimality via a branch and cut algorithm. The algorithm is tested on well-known sets of benchmark instances. All instances have been solved to optimality in milliseconds or very few seconds on a normal workstation.