Search

Redundancy is a common structure for warship system, and it is an effective way to improve the reliability of the system. In this paper, warship system is taken as the object of study, based on the system reliability equivalence principle, a spares demand rate calculation method for redundant system is proposed through structure transformation. According to the system analysis method, the general modeling data structure of spares support echelon and system indenture is established, and the mission success probability is taken as the optimization target to build the dynamic optimization model of carrying spares during the process of multi-phase. By introducing the Lagrange multiplier, the spares weight, volume and cost are transformed to the single target of the spares total scale, and the initial Lagrange factors and its dynamic adjustment policy is proposed. In a given example, the main influence factors of the carrying spares project are analyzed, and the study results are in accordance with the reality, which can provide a new approach to mission-oriented carrying spares optimization for the redundant system. [ABSTRACT FROM AUTHOR]

Optimization of architecture design has recently drawn research interest. System deployment optimization (SDO) refers to the process of optimizing systems that are being deployed to activities. This paper first formulates a mathematical model to theorize and operationalize the SDO problem and then identifies optimal solutions to solve the SDO problem. In the solutions, the success rate of the combat task is maximized, whereas the execution time of the task and the cost of changes in the system structure are minimized. The presented optimized algorithm generates an optimal solution without the need to check the entire search space. A novel method is finally proposed based on the combination of heuristic method and genetic algorithm (HGA), as well as the combination of heuristic method and particle swarm optimization (HPSO). Experiment results show that the HPSO method generates solutions faster than particle swarm optimization (PSO) and genetic algorithm (GA) in terms of execution time and performs more efficiently than the heuristic method in terms of determining the best solution. [ABSTRACT FROM AUTHOR]