In this paper, we will discuss some algorithms in order to better optimize the problems of redundancy allocation in multi-state systems. The goal is to find the optimal configuration of the system that maximizes the availability and minimizes the investment cost. The availability will be evaluated using the universal generating function. In first step, our contribution consists in improving the genetic algorithm. In a second step, in the framework of the Constraint Programming, we propose a new method of optimization based on the Forward Checking as solver. Finally, we used the top-k method in our choice that helps us to get the best k elements from all possible values with highest availability. In comparison with the chosen study, our methods yield better results that satisfy the constraints of the problem in a shorter time.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.