中文摘要：

针对串并联系统选择性维修问题,综合考虑后续子系统失效组件数量,以及维修时间和费用等约束条件,提出穷举法的一项新的改进措施。实验结果表明,该改进措施可以大幅减少候选解数量,并保证结果的最优性,特别适合于系统规模较大的选择性维修问题。综合采取多项改进措施,能够极大地减少CPU运行时间,进而提高穷举法的效率。此外,还分析了各项改进措施对于算法效率提升的贡献程度,并重新设计了仿真实验和数据分析流程,纠正了前人的一个错误结果。

英文摘要：

In order to solve the selective maintenance problem for series-parallel system,an improvement of enumerative method is proposed,considering both the number of failed components in the following subsystems and the maintenance time and cost constraints. Experiment results illustrate that,this improvement,which is especially appropriate for large scale optimization problem,can reduce the number of candidate solutions substantially and guarantee the best results. When several improvements are combined with the enumerative method,the CPU time will be lessened resulting in better algorithm efficiency. Furthermore,the contribution of each improvement is discussed thoughtfully. Finally,the simulation experiment and the data analysis are redesigned to correct a wrong conclusion of the past.