论文部分内容阅读
Two heuristics, the max-min approach and the Nakagawa and Nakashima method, are consideredfor the redundancy allocation problem with series-parallel structure. The max-min approach canformulate the problem as an integer linear programming problem instead of an integer nonlinearproblem. This paper presents a comparison between those methods from the standpoint of solutionquality and computational complexity. The experimental results show that the max-min approach issuperior to the Nakagawa and Nakashima method in terms of solution quality in small-scale problems,but analysis of computational complexity shows that the max-min approach is inferior to other greedyheuristics.
Two heuristics, the max-min approach and the Nakagawa and Nakashima method, are considered for the redundancy allocation problem with series-parallel structure. The max-min approach canformulate the problem as an integer linear programming problem instead of an integer nonlinearproblem. This paper presents a comparison in those methods from the standpoint of solutionquality and computational complexity. The experimental results show that max-min approach issuperior to the Nakagawa and Nakashima method in terms of solution quality in small-scale problems, but analysis of computational complexity that that the max-min approach is inferior to other greedyheuristics.