摘要：Generally, the redundancy allocation problem is characterized as a kind of NP-hard combinatorial optimization problem, which is difficult to solve with the classical method because it has exponentially increasing complexity with the augmented size. In this paper, we propose the efficient approach with two phases that is comprised of particle swarm optimization (PSO), which can efficiently represent the region search, and a local search, to solve the adjacent domains of best particle, which is great useful to improve optimization efficiency, and the parameter of local search is also studied.
