신뢰도-리던던시 할당문제를 위한 시뮬레이티드 어닐링 알고리듬의 개발에 관한 연구

A Study on Developing A Simulated Annealing Algorithm for Reliability-Redundancy Allocation Problems

Reliability-redundancy allocation problems are simultaneously to determine optimal reliability and redundancy level of components in system subject to several resource constraints. Due to the solution's nature representing real and integer variables, the problem is a mixed integer programming problem. If resource constraints are constituted nonlinear functions, the problem becomes a nonlinear mixed integer programming problem that is an NP-hard problem of combinatorial optimization problems. Because it is not easy to obtain an optimal solution, many heuristic methods have been developed. In this paper, a simulated annealing (SA) algorithm is proposed to search an optimal solution of the nonlinear mixed integer programming problem. To show its effectiveness several test problems are experimented via the SA algorithm and the solutions are compared with best solutions through other previous studies. It is found that the SA algorithm gives better solutions.