The test selection and optimization （TSO） can improve the abilities of fault diagnosis, prognosis and health-state evalua- tion for prognostics and health management （PHM） systems. Traditionally, TSO mainly focuse...The test selection and optimization （TSO） can improve the abilities of fault diagnosis, prognosis and health-state evalua- tion for prognostics and health management （PHM） systems. Traditionally, TSO mainly focuses on fault detection and isolation, but they cannot provide an effective guide for the design for testability （DFT） to improve the PHM performance level. To solve the problem, a model of TSO for PHM systems is proposed. Firstly, through integrating the characteristics of fault severity and propa- gation time, and analyzing the test timing and sensitivity, a testability model based on failure evolution mechanism model （FEMM） for PHM systems is built up. This model describes the fault evolution- test dependency using the fault-symptom parameter matrix and symptom parameter-test matrix. Secondly, a novel method of in- herent testability analysis for PHM systems is developed based on the above information. Having completed the analysis, a TSO model, whose objective is to maximize fault trackability and mini- mize the test cost, is proposed through inherent testability analysis results, and an adaptive simulated annealing genetic algorithm （ASAGA） is introduced to solve the TSO problem. Finally, a case of a centrifugal pump system is used to verify the feasibility and effectiveness of the proposed models and methods. The results show that the proposed technology is important for PHM systems to select and optimize the test set in order to improve their performance level.展开更多
A novel immune genetic algorithm with the elitist selection and elitist crossover was proposed, which is called the immune genetic algorithm with the elitism （IGAE）. In IGAE, the new methods for computing antibody s...A novel immune genetic algorithm with the elitist selection and elitist crossover was proposed, which is called the immune genetic algorithm with the elitism （IGAE）. In IGAE, the new methods for computing antibody similarity, expected reproduction probability, and clonal selection probability were given. IGAE has three features. The first is that the similarities of two antibodies in structure and quality are all defined in the form of percentage, which helps to describe the similarity of two antibodies more accurately and to reduce the computational burden effectively. The second is that with the elitist selection and elitist crossover strategy IGAE is able to find the globally optimal solution of a given problem. The third is that the formula of expected reproduction probability of antibody can be adjusted through a parameter r, which helps to balance the population diversity and the convergence speed of IGAE so that IGAE can find the globally optimal solution of a given problem more rapidly. Two different complex multi-modal functions were selected to test the validity of IGAE. The experimental results show that IGAE can find the globally maximum/minimum values of the two functions rapidly. The experimental results also confirm that IGAE is of better performance in convergence speed, solution variation behavior, and computational efficiency compared with the canonical genetic algorithm with the elitism and the immune genetic algorithm with the information entropy and elitism.展开更多
Heuristic optimization methods provide a robust and efficient approach to solving complex optimization problems.This paper presents a hybrid optimization technique combining two heuristic optimization methods,artifici...Heuristic optimization methods provide a robust and efficient approach to solving complex optimization problems.This paper presents a hybrid optimization technique combining two heuristic optimization methods,artificial immune system（AIS） and particle swarm optimization（PSO）,together in searching for the global optima of nonlinear functions.The proposed algorithm,namely hybrid anti-prematuration optimization method,contains four significant operators,i.e.swarm operator,cloning operator,suppression operator,and receptor editing operator.The swarm operator is inspired by the particle swarm intelligence,and the clone operator,suppression operator,and receptor editing operator are gleaned by the artificial immune system.The simulation results of three representative nonlinear test functions demonstrate the superiority of the hybrid optimization algorithm over the conventional methods with regard to both the solution quality and convergence rate.It is also employed to cope with a real-world optimization problem.展开更多
Project construction and development are an impor-tant part of future army designs.In today’s world,intelligent war-fare and joint operations have become the dominant develop-ments in warfare,so the construction and ...Project construction and development are an impor-tant part of future army designs.In today’s world,intelligent war-fare and joint operations have become the dominant develop-ments in warfare,so the construction and development of the army need top-down,top-level design,and comprehensive plan-ning.The traditional project development model is no longer suf-ficient to meet the army’s complex capability requirements.Projects in various fields need to be developed and coordinated to form a joint force and improve the army’s combat effective-ness.At the same time,when a program consists of large-scale project data,the effectiveness of the traditional,precise mathe-matical planning method is greatly reduced because it is time-consuming,costly,and impractical.To solve above problems,this paper proposes a multi-stage program optimization model based on a heterogeneous network and hybrid genetic algo-rithm and verifies the effectiveness and feasibility of the model and algorithm through an example.The results show that the hybrid algorithm proposed in this paper is better than the exist-ing meta-heuristic algorithm.展开更多
A quality of service （QoS） or constraint-based routing selection needs to find a path subject to multiple constraints through a network. The problem of finding such a path is known as the multi-constrained path （MC...A quality of service （QoS） or constraint-based routing selection needs to find a path subject to multiple constraints through a network. The problem of finding such a path is known as the multi-constrained path （MCP） problem, and has been proven to be NP-complete that cannot be exactly solved in a polynomial time. The NPC problem is converted into a multiobjective optimization problem with constraints to be solved with a genetic algorithm. Based on the Pareto optimum, a constrained routing computation method is proposed to generate a set of nondominated optimal routes with the genetic algorithm mechanism. The convergence and time complexity of the novel algorithm is analyzed. Experimental results show that multiobjective evolution is highly responsive and competent for the Pareto optimum-based route selection. When this method is applied to a MPLS and metropolitan-area network, it will be capable of optimizing the transmission performance.展开更多
基金supported by the National Natural Science Foundation of China(51175502)
文摘The test selection and optimization （TSO） can improve the abilities of fault diagnosis, prognosis and health-state evalua- tion for prognostics and health management （PHM） systems. Traditionally, TSO mainly focuses on fault detection and isolation, but they cannot provide an effective guide for the design for testability （DFT） to improve the PHM performance level. To solve the problem, a model of TSO for PHM systems is proposed. Firstly, through integrating the characteristics of fault severity and propa- gation time, and analyzing the test timing and sensitivity, a testability model based on failure evolution mechanism model （FEMM） for PHM systems is built up. This model describes the fault evolution- test dependency using the fault-symptom parameter matrix and symptom parameter-test matrix. Secondly, a novel method of in- herent testability analysis for PHM systems is developed based on the above information. Having completed the analysis, a TSO model, whose objective is to maximize fault trackability and mini- mize the test cost, is proposed through inherent testability analysis results, and an adaptive simulated annealing genetic algorithm （ASAGA） is introduced to solve the TSO problem. Finally, a case of a centrifugal pump system is used to verify the feasibility and effectiveness of the proposed models and methods. The results show that the proposed technology is important for PHM systems to select and optimize the test set in order to improve their performance level.
基金Project(50275150) supported by the National Natural Science Foundation of ChinaProjects(20040533035, 20070533131) supported by the National Research Foundation for the Doctoral Program of Higher Education of China
文摘A novel immune genetic algorithm with the elitist selection and elitist crossover was proposed, which is called the immune genetic algorithm with the elitism （IGAE）. In IGAE, the new methods for computing antibody similarity, expected reproduction probability, and clonal selection probability were given. IGAE has three features. The first is that the similarities of two antibodies in structure and quality are all defined in the form of percentage, which helps to describe the similarity of two antibodies more accurately and to reduce the computational burden effectively. The second is that with the elitist selection and elitist crossover strategy IGAE is able to find the globally optimal solution of a given problem. The third is that the formula of expected reproduction probability of antibody can be adjusted through a parameter r, which helps to balance the population diversity and the convergence speed of IGAE so that IGAE can find the globally optimal solution of a given problem more rapidly. Two different complex multi-modal functions were selected to test the validity of IGAE. The experimental results show that IGAE can find the globally maximum/minimum values of the two functions rapidly. The experimental results also confirm that IGAE is of better performance in convergence speed, solution variation behavior, and computational efficiency compared with the canonical genetic algorithm with the elitism and the immune genetic algorithm with the information entropy and elitism.
文摘Heuristic optimization methods provide a robust and efficient approach to solving complex optimization problems.This paper presents a hybrid optimization technique combining two heuristic optimization methods,artificial immune system（AIS） and particle swarm optimization（PSO）,together in searching for the global optima of nonlinear functions.The proposed algorithm,namely hybrid anti-prematuration optimization method,contains four significant operators,i.e.swarm operator,cloning operator,suppression operator,and receptor editing operator.The swarm operator is inspired by the particle swarm intelligence,and the clone operator,suppression operator,and receptor editing operator are gleaned by the artificial immune system.The simulation results of three representative nonlinear test functions demonstrate the superiority of the hybrid optimization algorithm over the conventional methods with regard to both the solution quality and convergence rate.It is also employed to cope with a real-world optimization problem.
基金supported by the National Natural Science Foundation of China(724701189072431011).
文摘Project construction and development are an impor-tant part of future army designs.In today’s world,intelligent war-fare and joint operations have become the dominant develop-ments in warfare,so the construction and development of the army need top-down,top-level design,and comprehensive plan-ning.The traditional project development model is no longer suf-ficient to meet the army’s complex capability requirements.Projects in various fields need to be developed and coordinated to form a joint force and improve the army’s combat effective-ness.At the same time,when a program consists of large-scale project data,the effectiveness of the traditional,precise mathe-matical planning method is greatly reduced because it is time-consuming,costly,and impractical.To solve above problems,this paper proposes a multi-stage program optimization model based on a heterogeneous network and hybrid genetic algo-rithm and verifies the effectiveness and feasibility of the model and algorithm through an example.The results show that the hybrid algorithm proposed in this paper is better than the exist-ing meta-heuristic algorithm.
基金the Natural Science Foundation of Anhui Province of China (050420212)the Excellent Youth Science and Technology Foundation of Anhui Province of China (04042069).
文摘A quality of service （QoS） or constraint-based routing selection needs to find a path subject to multiple constraints through a network. The problem of finding such a path is known as the multi-constrained path （MCP） problem, and has been proven to be NP-complete that cannot be exactly solved in a polynomial time. The NPC problem is converted into a multiobjective optimization problem with constraints to be solved with a genetic algorithm. Based on the Pareto optimum, a constrained routing computation method is proposed to generate a set of nondominated optimal routes with the genetic algorithm mechanism. The convergence and time complexity of the novel algorithm is analyzed. Experimental results show that multiobjective evolution is highly responsive and competent for the Pareto optimum-based route selection. When this method is applied to a MPLS and metropolitan-area network, it will be capable of optimizing the transmission performance.
