The learning algorithms of causal discovery mainly include score-based methods and genetic algorithms(GA).The score-based algorithms are prone to searching space explosion.Classical GA is slow to converge,and prone to...The learning algorithms of causal discovery mainly include score-based methods and genetic algorithms(GA).The score-based algorithms are prone to searching space explosion.Classical GA is slow to converge,and prone to falling into local optima.To address these issues,an improved GA with domain knowledge(IGADK)is proposed.Firstly,domain knowledge is incorporated into the learning process of causality to construct a new fitness function.Secondly,a dynamical mutation operator is introduced in the algorithm to accelerate the convergence rate.Finally,an experiment is conducted on simulation data,which compares the classical GA with IGADK with domain knowledge of varying accuracy.The IGADK can greatly reduce the number of iterations,populations,and samples required for learning,which illustrates the efficiency and effectiveness of the proposed algorithm.展开更多
Reducing the vulnerability of a platform,i.e.,the risk of being affected by hostile objects,is of paramount importance in the design process of vehicles,especially aircraft.A simple and effective way to decrease vulne...Reducing the vulnerability of a platform,i.e.,the risk of being affected by hostile objects,is of paramount importance in the design process of vehicles,especially aircraft.A simple and effective way to decrease vulnerability is to introduce protective structures to intercept and possibly stop threats.However,this type of solution can lead to a significant increase in weight,affecting the performance of the aircraft.For this reason,it is crucial to study possible solutions that allow reducing the vulnerability of the aircraft while containing the increase in structural weight.One possible strategy is to optimize the topology of protective solutions to find the optimal balance between vulnerability and the weight of the added structures.Among the many optimization techniques available in the literature for this purpose,multiobjective genetic algorithms stand out as promising tools.In this context,this work proposes the use of a in-house software for vulnerability calculation to guide the process of topology optimization through multi-objective genetic algorithms,aiming to simultaneously minimize the weight of protective structures and vulnerability.In addition to the use of the in-house software,which itself represents a novelty in the field of topology optimization of structures,the method incorporates a custom mutation function within the genetic algorithm,specifically developed using a graph-based approach to ensure the continuity of the generated structures.The tool developed for this work is capable of generating protections with optimized layouts considering two different types of impacting objects,namely bullets and fragments from detonating objects.The software outputs a set of non-dominated solutions describing different topologies that the user can choose from.展开更多
To obtain the optimal process parameters of stamping forming, finite element analysis and optimization technique were integrated via transforming multi-objective issue into a single-objective issue. A Pareto-based gen...To obtain the optimal process parameters of stamping forming, finite element analysis and optimization technique were integrated via transforming multi-objective issue into a single-objective issue. A Pareto-based genetic algorithm was applied to optimizing the head stamping forming process. In the proposed optimal model, fracture, wrinkle and thickness varying are a function of several factors, such as fillet radius, draw-bead position, blank size and blank-holding force. Hence, it is necessary to investigate the relationship between the objective functions and the variables in order to make objective functions varying minimized simultaneously. Firstly, the central composite experimental(CCD) with four factors and five levels was applied, and the experimental data based on the central composite experimental were acquired. Then, the response surface model(RSM) was set up and the results of the analysis of variance(ANOVA) show that it is reliable to predict the fracture, wrinkle and thickness varying functions by the response surface model. Finally, a Pareto-based genetic algorithm was used to find out a set of Pareto front, which makes fracture, wrinkle and thickness varying minimized integrally. A head stamping case indicates that the present method has higher precision and practicability compared with the "trial and error" procedure.展开更多
The vehicle model of the recirculating ball-type electric power steering (EPS) system for the pure electric bus was built. According to the features of constrained optimization for multi-variable function, a multi-obj...The vehicle model of the recirculating ball-type electric power steering (EPS) system for the pure electric bus was built. According to the features of constrained optimization for multi-variable function, a multi-objective genetic algorithm (GA) was designed. Based on the model of system, the quantitative formula of the road feel, sensitivity, and operation stability of the steering were induced. Considering the road feel and sensitivity of steering as optimization objectives, and the operation stability of steering as constraint, the multi-objective GA was proposed and the system parameters were optimized. The simulation results show that the system optimized by multi-objective genetic algorithm has better road feel, steering sensibility and steering stability. The energy of steering road feel after optimization is 1.44 times larger than the one before optimization, and the energy of portability after optimization is 0.4 times larger than the one before optimization. The ground test was conducted in order to verify the feasibility of simulation results, and it is shown that the pure electric bus equipped with the recirculating ball-type EPS system can provide better road feel and better steering portability for the drivers, thus the optimization methods can provide a theoretical basis for the design and optimization of the recirculating ball-type EPS system.展开更多
The multi-objective genetic algorithm(MOGA) is proposed to calibrate the non-linear camera model of a space manipulator to improve its locational accuracy. This algorithm can optimize the camera model by dynamic balan...The multi-objective genetic algorithm(MOGA) is proposed to calibrate the non-linear camera model of a space manipulator to improve its locational accuracy. This algorithm can optimize the camera model by dynamic balancing its model weight and multi-parametric distributions to the required accuracy. A novel measuring instrument of space manipulator is designed to orbital simulative motion and locational accuracy test. The camera system of space manipulator, calibrated by MOGA algorithm, is used to locational accuracy test in this measuring instrument. The experimental result shows that the absolute errors are [0.07, 1.75] mm for MOGA calibrating model, [2.88, 5.95] mm for MN method, and [1.19, 4.83] mm for LM method. Besides, the composite errors both of LM method and MN method are approximately seven times higher that of MOGA calibrating model. It is suggested that the MOGA calibrating model is superior both to LM method and MN method.展开更多
In the field of calculating the attack area of air-to-air missiles in modern air combat scenarios,the limitations of existing research,including real-time calculation,accuracy efficiency trade-off,and the absence of t...In the field of calculating the attack area of air-to-air missiles in modern air combat scenarios,the limitations of existing research,including real-time calculation,accuracy efficiency trade-off,and the absence of the three-dimensional attack area model,restrict their practical applications.To address these issues,an improved backtracking algorithm is proposed to improve calculation efficiency.A significant reduction in solution time and maintenance of accuracy in the three-dimensional attack area are achieved by using the proposed algorithm.Furthermore,the age-layered population structure genetic programming(ALPS-GP)algorithm is introduced to determine an analytical polynomial model of the three-dimensional attack area,considering real-time requirements.The accuracy of the polynomial model is enhanced through the coefficient correction using an improved gradient descent algorithm.The study reveals a remarkable combination of high accuracy and efficient real-time computation,with a mean error of 91.89 m using the analytical polynomial model of the three-dimensional attack area solved in just 10^(-4)s,thus meeting the requirements of real-time combat scenarios.展开更多
The belief rule-based(BRB)system has been popular in complexity system modeling due to its good interpretability.However,the current mainstream optimization methods of the BRB systems only focus on modeling accuracy b...The belief rule-based(BRB)system has been popular in complexity system modeling due to its good interpretability.However,the current mainstream optimization methods of the BRB systems only focus on modeling accuracy but ignore the interpretability.The single-objective optimization strategy has been applied in the interpretability-accuracy trade-off by inte-grating accuracy and interpretability into an optimization objec-tive.But the integration has a greater impact on optimization results with strong subjectivity.Thus,a multi-objective optimiza-tion framework in the modeling of BRB systems with inter-pretability-accuracy trade-off is proposed in this paper.Firstly,complexity and accuracy are taken as two independent opti-mization goals,and uniformity as a constraint to give the mathe-matical description.Secondly,a classical multi-objective opti-mization algorithm,nondominated sorting genetic algorithm II(NSGA-II),is utilized as an optimization tool to give a set of BRB systems with different accuracy and complexity.Finally,a pipeline leakage detection case is studied to verify the feasibility and effectiveness of the developed multi-objective optimization.The comparison illustrates that the proposed multi-objective optimization framework can effectively avoid the subjectivity of single-objective optimization,and has capability of joint optimiz-ing the structure and parameters of BRB systems with inter-pretability-accuracy trade-off.展开更多
The control design, based on self-adaptive PID with genetic algorithms(GA) tuning on-line was investigated, for the temperature control of industrial microwave drying rotary device with the multi-layer(IMDRDWM) and wi...The control design, based on self-adaptive PID with genetic algorithms(GA) tuning on-line was investigated, for the temperature control of industrial microwave drying rotary device with the multi-layer(IMDRDWM) and with multivariable nonlinear interaction of microwave and materials. The conventional PID control strategy incorporated with optimization GA was put forward to maintain the optimum drying temperature in order to keep the moisture content below 1%, whose adaptation ability included the cost function of optimization GA according to the output change. Simulations on five different industrial process models and practical temperature process control system for selenium-enriched slag drying intensively by using IMDRDWM were carried out systematically, indicating the reliability and effectiveness of control design. The parameters of proposed control design are all on-line implemented without iterative predictive calculations, and the closed-loop system stability is guaranteed, which makes the developed scheme simpler in its synthesis and application, providing the practical guidelines for the control implementation and the parameter design.展开更多
The classical job shop scheduling problem(JSP) is the most popular machine scheduling model in practice and is known as NP-hard.The formulation of the JSP is based on the assumption that for each part type or job ther...The classical job shop scheduling problem(JSP) is the most popular machine scheduling model in practice and is known as NP-hard.The formulation of the JSP is based on the assumption that for each part type or job there is only one process plan that prescribes the sequence of operations and the machine on which each operation has to be performed.However,JSP with alternative machines for various operations is an extension of the classical JSP,which allows an operation to be processed by any machine from a given set of machines.Since this problem requires an additional decision of machine allocation during scheduling,it is much more complex than JSP.We present a domain independent genetic algorithm(GA) approach for the job shop scheduling problem with alternative machines.The GA is implemented in a spreadsheet environment.The performance of the proposed GA is analyzed by comparing with various problem instances taken from the literatures.The result shows that the proposed GA is competitive with the existing approaches.A simplified approach that would be beneficial to both practitioners and researchers is presented for solving scheduling problems with alternative machines.展开更多
With its wide use in different fields, the problem of the convergence of simple genetic algorithms (GAs) has been concerned. In the past, the research on the convergence of GAs was based on Holland's model theorem...With its wide use in different fields, the problem of the convergence of simple genetic algorithms (GAs) has been concerned. In the past, the research on the convergence of GAs was based on Holland's model theorem. The diversity of the evolutionary population and the convergence of GAs are studied by using the concept of negentropy based on the discussion of the characteristic of GA. Some test functions are used to test the convergence of GAs, and good results have been obtained. It is shown that the global optimization may be obtained by selecting appropriate parameters of simple GAs if the evolution time is enough.展开更多
The problem of simultaneous scheduling of machines and vehicles in flexible manufacturing system (FMS) was addressed.A spreadsheet based genetic algorithm (GA) approach was presented to solve the problem.A domain inde...The problem of simultaneous scheduling of machines and vehicles in flexible manufacturing system (FMS) was addressed.A spreadsheet based genetic algorithm (GA) approach was presented to solve the problem.A domain independent general purpose GA was used,which was an add-in to the spreadsheet software.An adaptation of the propritary GA software was demonstrated to the problem of minimizing the total completion time or makespan for simultaneous scheduling of machines and vehicles in flexible manufacturing systems.Computational results are presented for a benchmark with 82 test problems,which have been constructed by other researchers.The achieved results are comparable to the previous approaches.The proposed approach can be also applied to other problems or objective functions without changing the GA routine or the spreadsheet model.展开更多
To generate a test set for a given circuit (including both combinational and sequential circuits), choice of an algorithm within a number of existing test generation algorithms to apply is bound to vary from circuit t...To generate a test set for a given circuit (including both combinational and sequential circuits), choice of an algorithm within a number of existing test generation algorithms to apply is bound to vary from circuit to circuit. In this paper, the genetic algorithms are used to construct the models of existing test generation algorithms in making such choice more easily. Therefore, we may forecast the testability parameters of a circuit before using the real test generation algorithm. The results also can be used to evaluate the efficiency of the existing test generation algorithms. Experimental results are given to convince the readers of the truth and the usefulness of this approach.展开更多
The method of determining the structures and parameters of radial basis function neural networks(RBFNNs) using improved genetic algorithms is proposed. Akaike′s information criterion (AIC) with generalization error t...The method of determining the structures and parameters of radial basis function neural networks(RBFNNs) using improved genetic algorithms is proposed. Akaike′s information criterion (AIC) with generalization error term is used as the best criterion of optimizing the structures and parameters of networks. It is shown from the simulation results that the method not only improves the approximation and generalization capability of RBFNNs ,but also obtain the optimal or suboptimal structures of networks.展开更多
A new error analysis method is presented via genetic algorithms for high precise heading determination model based on two total positioning stations （TPSs）. The method has the ability to search all possible solution...A new error analysis method is presented via genetic algorithms for high precise heading determination model based on two total positioning stations （TPSs）. The method has the ability to search all possible solution space by the genetic operators of elitist model and restriction. The result of analyzing the error of this model shows that the accuracy of this model is precise enough to meet the need of calibration for navigation systems on ship, and the search space is only 0. 03% of the total search space, and the precision of heading determination is 4＂ in a general dock.展开更多
Genetic Algorithms （GA） are a search techniques based on mechanics of nature selection and have already been successfully applied in many diverse areas. However, increasing samples show that GA＇s performance is not...Genetic Algorithms （GA） are a search techniques based on mechanics of nature selection and have already been successfully applied in many diverse areas. However, increasing samples show that GA＇s performance is not as good as it was expected to be. Criticism of this algorithm includes the slow speed and premature result during convergence procedure. In order to improve the performance, the population size and individuals＇ space is emphatically described. The influence of individuals＇ space and population size on the operators is analyzed. And a novel family genetic algorithm （FGA） is put forward based on this analysis. In this novel algorithm, the optimum solution families closed to quality individuals is constructed, which is exchanged found by a search in the world space. Search will be done in this microspace. The family that can search better genes in a limited period of time would win a new life. At the same time, the best gene of this micro space with the basic population in the world space is exchanged. Finally, the FGA is applied to the function optimization and image matching through several experiments. The results show that the FGA possessed high performance.展开更多
In this paper, we use the global search characteristics of genetic algorithms to help search the weight space of the neurons in the cascade-correlation architecture. The cascade-correlation learning architecture is a ...In this paper, we use the global search characteristics of genetic algorithms to help search the weight space of the neurons in the cascade-correlation architecture. The cascade-correlation learning architecture is a technique of training and building neural networks that starts with a simple network of neurons and adds additional neurons as they are needed to suit a particular problem. In our approach, instead ofmodifying the genetic algorithm to account for convergence problems, we search the weight-space using the genetic algorithm and then apply the gradient technique of Quickprop to optimize the weights. This hybrid algorithm which is a combination of genetic algorithms and cascade-correlation is applied to the two spirals problem. We also use our algorithm in the prediction of the cyclic oxidation resistance of Ni- and Co-base superalloys.展开更多
We set up computer vision system for tomato images. By using this system, the RGB value of tomato image was converted into HIS value whose H was used to acquire the color character of the surface of tomato. To use mul...We set up computer vision system for tomato images. By using this system, the RGB value of tomato image was converted into HIS value whose H was used to acquire the color character of the surface of tomato. To use multilayer feed forward neural network with GA can finish automatic identification of tomato maturation. The results of experiment showed that the accuracy was up to 94%.展开更多
Formulizations of mutation and crossover operators independent of representation of solutions are proposed. A kind of precisely quantitative Markov chain of populations of standard genetic algorithms is modeled. It is...Formulizations of mutation and crossover operators independent of representation of solutions are proposed. A kind of precisely quantitative Markov chain of populations of standard genetic algorithms is modeled. It is proved that inadequate parameters of mutation and crossover probabilities degenerate standard genetic algorithm to a class of random search algorithms without selection bias toward any solution based on fitness. After introducing elitist reservation, the stochastic matrix of Markov chain of the best-so-far individual with the highest fitness is derived.The average convergence velocity of genetic algorithms is defined as the mathematical expectation of the mean absorbing time steps that the best-so-far individual transfers from any initial solution to the global optimum. Using the stochastic matrix of the best-so-far individual, a theoretic method and the computing process of estimating the average convergence velocity are proposed.展开更多
In this paper, a new implementation of genetic algorithms (GAs) is developed for the machine scheduling problem, which is abundant among the modern manufacturing systems. The performance measure of early and tardy com...In this paper, a new implementation of genetic algorithms (GAs) is developed for the machine scheduling problem, which is abundant among the modern manufacturing systems. The performance measure of early and tardy completion of jobs is very natural as one's aim, which is usually to minimize simultaneously both earliness and tardiness of all jobs. As the problem is NP-hard and no effective algorithms exist, we propose a hybrid genetic algorithms approach to deal with it. We adjust the crossover and mutation probabilities by fuzzy logic controller whereas the hybrid genetic algorithm does not require preliminary experiments to determine probabilities for genetic operators. The experimental results show the effectiveness of the GAs method proposed in the paper.展开更多
Satellite constellation design for space optical systems is essentially a multiple-objective optimization problem. In this work, to tackle this challenge, we first categorize the performance metrics of the space optic...Satellite constellation design for space optical systems is essentially a multiple-objective optimization problem. In this work, to tackle this challenge, we first categorize the performance metrics of the space optical system by taking into account the system tasks（i.e., target detection and tracking）. We then propose a new non-dominated sorting genetic algorithm（NSGA） to maximize the system surveillance performance. Pareto optimal sets are employed to deal with the conflicts due to the presence of multiple cost functions. Simulation results verify the validity and the improved performance of the proposed technique over benchmark methods.展开更多
基金supported by the National Social Science Fund of China(2022-SKJJ-B-084).
文摘The learning algorithms of causal discovery mainly include score-based methods and genetic algorithms(GA).The score-based algorithms are prone to searching space explosion.Classical GA is slow to converge,and prone to falling into local optima.To address these issues,an improved GA with domain knowledge(IGADK)is proposed.Firstly,domain knowledge is incorporated into the learning process of causality to construct a new fitness function.Secondly,a dynamical mutation operator is introduced in the algorithm to accelerate the convergence rate.Finally,an experiment is conducted on simulation data,which compares the classical GA with IGADK with domain knowledge of varying accuracy.The IGADK can greatly reduce the number of iterations,populations,and samples required for learning,which illustrates the efficiency and effectiveness of the proposed algorithm.
文摘Reducing the vulnerability of a platform,i.e.,the risk of being affected by hostile objects,is of paramount importance in the design process of vehicles,especially aircraft.A simple and effective way to decrease vulnerability is to introduce protective structures to intercept and possibly stop threats.However,this type of solution can lead to a significant increase in weight,affecting the performance of the aircraft.For this reason,it is crucial to study possible solutions that allow reducing the vulnerability of the aircraft while containing the increase in structural weight.One possible strategy is to optimize the topology of protective solutions to find the optimal balance between vulnerability and the weight of the added structures.Among the many optimization techniques available in the literature for this purpose,multiobjective genetic algorithms stand out as promising tools.In this context,this work proposes the use of a in-house software for vulnerability calculation to guide the process of topology optimization through multi-objective genetic algorithms,aiming to simultaneously minimize the weight of protective structures and vulnerability.In addition to the use of the in-house software,which itself represents a novelty in the field of topology optimization of structures,the method incorporates a custom mutation function within the genetic algorithm,specifically developed using a graph-based approach to ensure the continuity of the generated structures.The tool developed for this work is capable of generating protections with optimized layouts considering two different types of impacting objects,namely bullets and fragments from detonating objects.The software outputs a set of non-dominated solutions describing different topologies that the user can choose from.
基金Project(2012ZX04010-081) supported by the National Science and Technology Major Project of the Ministry of Science and Technology of China
文摘To obtain the optimal process parameters of stamping forming, finite element analysis and optimization technique were integrated via transforming multi-objective issue into a single-objective issue. A Pareto-based genetic algorithm was applied to optimizing the head stamping forming process. In the proposed optimal model, fracture, wrinkle and thickness varying are a function of several factors, such as fillet radius, draw-bead position, blank size and blank-holding force. Hence, it is necessary to investigate the relationship between the objective functions and the variables in order to make objective functions varying minimized simultaneously. Firstly, the central composite experimental(CCD) with four factors and five levels was applied, and the experimental data based on the central composite experimental were acquired. Then, the response surface model(RSM) was set up and the results of the analysis of variance(ANOVA) show that it is reliable to predict the fracture, wrinkle and thickness varying functions by the response surface model. Finally, a Pareto-based genetic algorithm was used to find out a set of Pareto front, which makes fracture, wrinkle and thickness varying minimized integrally. A head stamping case indicates that the present method has higher precision and practicability compared with the "trial and error" procedure.
基金Projects(51005115, 51005248) supported by the National Natural Science Foundation of ChinaProject(SKLMT-KFKT-201105)supported by the Visiting Scholar Foundation of State Key Laboratory of Mechanical Transmission in Chongqing University, ChinaProject(QC201101) supported by Visiting Scholar Foundation of the Automobile Engineering Key Laboratory of Jiangsu Province, China
文摘The vehicle model of the recirculating ball-type electric power steering (EPS) system for the pure electric bus was built. According to the features of constrained optimization for multi-variable function, a multi-objective genetic algorithm (GA) was designed. Based on the model of system, the quantitative formula of the road feel, sensitivity, and operation stability of the steering were induced. Considering the road feel and sensitivity of steering as optimization objectives, and the operation stability of steering as constraint, the multi-objective GA was proposed and the system parameters were optimized. The simulation results show that the system optimized by multi-objective genetic algorithm has better road feel, steering sensibility and steering stability. The energy of steering road feel after optimization is 1.44 times larger than the one before optimization, and the energy of portability after optimization is 0.4 times larger than the one before optimization. The ground test was conducted in order to verify the feasibility of simulation results, and it is shown that the pure electric bus equipped with the recirculating ball-type EPS system can provide better road feel and better steering portability for the drivers, thus the optimization methods can provide a theoretical basis for the design and optimization of the recirculating ball-type EPS system.
基金Project(J132012C001)supported by Technological Foundation of ChinaProject(2011YQ04013606)supported by National Major Scientific Instrument & Equipment Developing Projects,China
文摘The multi-objective genetic algorithm(MOGA) is proposed to calibrate the non-linear camera model of a space manipulator to improve its locational accuracy. This algorithm can optimize the camera model by dynamic balancing its model weight and multi-parametric distributions to the required accuracy. A novel measuring instrument of space manipulator is designed to orbital simulative motion and locational accuracy test. The camera system of space manipulator, calibrated by MOGA algorithm, is used to locational accuracy test in this measuring instrument. The experimental result shows that the absolute errors are [0.07, 1.75] mm for MOGA calibrating model, [2.88, 5.95] mm for MN method, and [1.19, 4.83] mm for LM method. Besides, the composite errors both of LM method and MN method are approximately seven times higher that of MOGA calibrating model. It is suggested that the MOGA calibrating model is superior both to LM method and MN method.
基金National Natural Science Foundation of China(62373187)Forward-looking Layout Special Projects(ILA220591A22)。
文摘In the field of calculating the attack area of air-to-air missiles in modern air combat scenarios,the limitations of existing research,including real-time calculation,accuracy efficiency trade-off,and the absence of the three-dimensional attack area model,restrict their practical applications.To address these issues,an improved backtracking algorithm is proposed to improve calculation efficiency.A significant reduction in solution time and maintenance of accuracy in the three-dimensional attack area are achieved by using the proposed algorithm.Furthermore,the age-layered population structure genetic programming(ALPS-GP)algorithm is introduced to determine an analytical polynomial model of the three-dimensional attack area,considering real-time requirements.The accuracy of the polynomial model is enhanced through the coefficient correction using an improved gradient descent algorithm.The study reveals a remarkable combination of high accuracy and efficient real-time computation,with a mean error of 91.89 m using the analytical polynomial model of the three-dimensional attack area solved in just 10^(-4)s,thus meeting the requirements of real-time combat scenarios.
基金supported by the National Natural Science Foundation of China(71901212)the Science and Technology Innovation Program of Hunan Province(2020RC4046).
文摘The belief rule-based(BRB)system has been popular in complexity system modeling due to its good interpretability.However,the current mainstream optimization methods of the BRB systems only focus on modeling accuracy but ignore the interpretability.The single-objective optimization strategy has been applied in the interpretability-accuracy trade-off by inte-grating accuracy and interpretability into an optimization objec-tive.But the integration has a greater impact on optimization results with strong subjectivity.Thus,a multi-objective optimiza-tion framework in the modeling of BRB systems with inter-pretability-accuracy trade-off is proposed in this paper.Firstly,complexity and accuracy are taken as two independent opti-mization goals,and uniformity as a constraint to give the mathe-matical description.Secondly,a classical multi-objective opti-mization algorithm,nondominated sorting genetic algorithm II(NSGA-II),is utilized as an optimization tool to give a set of BRB systems with different accuracy and complexity.Finally,a pipeline leakage detection case is studied to verify the feasibility and effectiveness of the developed multi-objective optimization.The comparison illustrates that the proposed multi-objective optimization framework can effectively avoid the subjectivity of single-objective optimization,and has capability of joint optimiz-ing the structure and parameters of BRB systems with inter-pretability-accuracy trade-off.
基金Project(51090385) supported by the Major Program of National Natural Science Foundation of ChinaProject(2011IB001) supported by Yunnan Provincial Science and Technology Program,China+1 种基金Project(2012DFA70570) supported by the International Science & Technology Cooperation Program of ChinaProject(2011IA004) supported by the Yunnan Provincial International Cooperative Program,China
文摘The control design, based on self-adaptive PID with genetic algorithms(GA) tuning on-line was investigated, for the temperature control of industrial microwave drying rotary device with the multi-layer(IMDRDWM) and with multivariable nonlinear interaction of microwave and materials. The conventional PID control strategy incorporated with optimization GA was put forward to maintain the optimum drying temperature in order to keep the moisture content below 1%, whose adaptation ability included the cost function of optimization GA according to the output change. Simulations on five different industrial process models and practical temperature process control system for selenium-enriched slag drying intensively by using IMDRDWM were carried out systematically, indicating the reliability and effectiveness of control design. The parameters of proposed control design are all on-line implemented without iterative predictive calculations, and the closed-loop system stability is guaranteed, which makes the developed scheme simpler in its synthesis and application, providing the practical guidelines for the control implementation and the parameter design.
文摘The classical job shop scheduling problem(JSP) is the most popular machine scheduling model in practice and is known as NP-hard.The formulation of the JSP is based on the assumption that for each part type or job there is only one process plan that prescribes the sequence of operations and the machine on which each operation has to be performed.However,JSP with alternative machines for various operations is an extension of the classical JSP,which allows an operation to be processed by any machine from a given set of machines.Since this problem requires an additional decision of machine allocation during scheduling,it is much more complex than JSP.We present a domain independent genetic algorithm(GA) approach for the job shop scheduling problem with alternative machines.The GA is implemented in a spreadsheet environment.The performance of the proposed GA is analyzed by comparing with various problem instances taken from the literatures.The result shows that the proposed GA is competitive with the existing approaches.A simplified approach that would be beneficial to both practitioners and researchers is presented for solving scheduling problems with alternative machines.
文摘With its wide use in different fields, the problem of the convergence of simple genetic algorithms (GAs) has been concerned. In the past, the research on the convergence of GAs was based on Holland's model theorem. The diversity of the evolutionary population and the convergence of GAs are studied by using the concept of negentropy based on the discussion of the characteristic of GA. Some test functions are used to test the convergence of GAs, and good results have been obtained. It is shown that the global optimization may be obtained by selecting appropriate parameters of simple GAs if the evolution time is enough.
文摘The problem of simultaneous scheduling of machines and vehicles in flexible manufacturing system (FMS) was addressed.A spreadsheet based genetic algorithm (GA) approach was presented to solve the problem.A domain independent general purpose GA was used,which was an add-in to the spreadsheet software.An adaptation of the propritary GA software was demonstrated to the problem of minimizing the total completion time or makespan for simultaneous scheduling of machines and vehicles in flexible manufacturing systems.Computational results are presented for a benchmark with 82 test problems,which have been constructed by other researchers.The achieved results are comparable to the previous approaches.The proposed approach can be also applied to other problems or objective functions without changing the GA routine or the spreadsheet model.
基金This work was supported by National Natural Science Foundation of China (NSFC) under the grant !No. 69873030
文摘To generate a test set for a given circuit (including both combinational and sequential circuits), choice of an algorithm within a number of existing test generation algorithms to apply is bound to vary from circuit to circuit. In this paper, the genetic algorithms are used to construct the models of existing test generation algorithms in making such choice more easily. Therefore, we may forecast the testability parameters of a circuit before using the real test generation algorithm. The results also can be used to evaluate the efficiency of the existing test generation algorithms. Experimental results are given to convince the readers of the truth and the usefulness of this approach.
文摘The method of determining the structures and parameters of radial basis function neural networks(RBFNNs) using improved genetic algorithms is proposed. Akaike′s information criterion (AIC) with generalization error term is used as the best criterion of optimizing the structures and parameters of networks. It is shown from the simulation results that the method not only improves the approximation and generalization capability of RBFNNs ,but also obtain the optimal or suboptimal structures of networks.
文摘A new error analysis method is presented via genetic algorithms for high precise heading determination model based on two total positioning stations （TPSs）. The method has the ability to search all possible solution space by the genetic operators of elitist model and restriction. The result of analyzing the error of this model shows that the accuracy of this model is precise enough to meet the need of calibration for navigation systems on ship, and the search space is only 0. 03% of the total search space, and the precision of heading determination is 4＂ in a general dock.
文摘Genetic Algorithms （GA） are a search techniques based on mechanics of nature selection and have already been successfully applied in many diverse areas. However, increasing samples show that GA＇s performance is not as good as it was expected to be. Criticism of this algorithm includes the slow speed and premature result during convergence procedure. In order to improve the performance, the population size and individuals＇ space is emphatically described. The influence of individuals＇ space and population size on the operators is analyzed. And a novel family genetic algorithm （FGA） is put forward based on this analysis. In this novel algorithm, the optimum solution families closed to quality individuals is constructed, which is exchanged found by a search in the world space. Search will be done in this microspace. The family that can search better genes in a limited period of time would win a new life. At the same time, the best gene of this micro space with the basic population in the world space is exchanged. Finally, the FGA is applied to the function optimization and image matching through several experiments. The results show that the FGA possessed high performance.
文摘In this paper, we use the global search characteristics of genetic algorithms to help search the weight space of the neurons in the cascade-correlation architecture. The cascade-correlation learning architecture is a technique of training and building neural networks that starts with a simple network of neurons and adds additional neurons as they are needed to suit a particular problem. In our approach, instead ofmodifying the genetic algorithm to account for convergence problems, we search the weight-space using the genetic algorithm and then apply the gradient technique of Quickprop to optimize the weights. This hybrid algorithm which is a combination of genetic algorithms and cascade-correlation is applied to the two spirals problem. We also use our algorithm in the prediction of the cyclic oxidation resistance of Ni- and Co-base superalloys.
文摘We set up computer vision system for tomato images. By using this system, the RGB value of tomato image was converted into HIS value whose H was used to acquire the color character of the surface of tomato. To use multilayer feed forward neural network with GA can finish automatic identification of tomato maturation. The results of experiment showed that the accuracy was up to 94%.
文摘Formulizations of mutation and crossover operators independent of representation of solutions are proposed. A kind of precisely quantitative Markov chain of populations of standard genetic algorithms is modeled. It is proved that inadequate parameters of mutation and crossover probabilities degenerate standard genetic algorithm to a class of random search algorithms without selection bias toward any solution based on fitness. After introducing elitist reservation, the stochastic matrix of Markov chain of the best-so-far individual with the highest fitness is derived.The average convergence velocity of genetic algorithms is defined as the mathematical expectation of the mean absorbing time steps that the best-so-far individual transfers from any initial solution to the global optimum. Using the stochastic matrix of the best-so-far individual, a theoretic method and the computing process of estimating the average convergence velocity are proposed.
文摘In this paper, a new implementation of genetic algorithms (GAs) is developed for the machine scheduling problem, which is abundant among the modern manufacturing systems. The performance measure of early and tardy completion of jobs is very natural as one's aim, which is usually to minimize simultaneously both earliness and tardiness of all jobs. As the problem is NP-hard and no effective algorithms exist, we propose a hybrid genetic algorithms approach to deal with it. We adjust the crossover and mutation probabilities by fuzzy logic controller whereas the hybrid genetic algorithm does not require preliminary experiments to determine probabilities for genetic operators. The experimental results show the effectiveness of the GAs method proposed in the paper.
文摘Satellite constellation design for space optical systems is essentially a multiple-objective optimization problem. In this work, to tackle this challenge, we first categorize the performance metrics of the space optical system by taking into account the system tasks（i.e., target detection and tracking）. We then propose a new non-dominated sorting genetic algorithm（NSGA） to maximize the system surveillance performance. Pareto optimal sets are employed to deal with the conflicts due to the presence of multiple cost functions. Simulation results verify the validity and the improved performance of the proposed technique over benchmark methods.
