2019 23rd International Conference on System Theory, Control and Computing (ICSTCC) | 2019
01IP and QUBO: Optimization Methods for Redundancy Allocation in Complex Systems
Abstract
This paper addresses the issue of optimal allocation of spare modules in complex series-parallel redundant systems in order to achieve a required reliability with minimal cost. To solve this problem, two optimization techniques are considered: Zero-One Integer Programming (01IP) and Quadratic Unconstrained Binary optimization (QUBO). The results are compared with those given by an approximate analytical method based on Lagrange multipliers. For large systems, the numerical results presented show that the 01IP and QUBO methods give better solutions. A comparative time complexity analysis of 01IP and QUBO is also presented.