Main Image
Volume 299 - The 7th International Conference on Computer Engineering and Networks (CENet2017) - Session I - Machine Learning
The Particle Swarm Optimization Algorithm of Three- state Reliability Redundancy Allocation Problem
D. Li
Full text: pdf
Pre-published on: 2017 July 17
Published on: 2017 September 06
This paper studies the three-state series-parallel (S-P) devices network reliability redundancy allocation problem (RAP) whose different components is paralleled, and the objective function
is maximized with cost and weight constraints. A new model is built. A new algorithm is constructed by using an objective function, that is, the discrete particle swarm optimization algorithm with compression coefficient to solve the RAP problem.
The algorithm is tested by two instances of the problem with MATLAB programming. As shown by the results, under the usually initial solution conditions, the particle swarm optimization algorithm can converge in each run and solve the system; at the same time, the algorithm is compared with the traditional simulated annealing algorithm, ant colony algorithm and genetic algorithm. The particle swarm optimization algorithm features advantages of easy programming and efficient convergence to the system optimal solution.
Open Access
Creative Commons LicenseCopyright owned by the author(s) under the term of the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.