New approaches for facility distribution in chemical plants are proposed including an improved non-overlapping constraint based on projection relationships of facilities and a novel toxic gas dispersion constraint. In...New approaches for facility distribution in chemical plants are proposed including an improved non-overlapping constraint based on projection relationships of facilities and a novel toxic gas dispersion constraint. In consideration of the large number of variables in the plant layout model, our new method can significantly reduce the number of variables with their own projection relationships. Also, as toxic gas dispersion is a usual incident in a chemical plant, a simple approach to describe the gas leakage is proposed, which can clearly represent the constraints of potential emission source and sitting facilities. For solving the plant layout model, an improved genetic algorithm (GA) based on infeasible solution fix technique is proposed, which improves the globe search ability of GA. The case study and experiment show that a better layout plan can be obtained with our method, and the safety factors such as gas dispersion and minimum distances can be well handled in the solution.展开更多
Aerodynamic parameters are important factors that affect projectile flight movement. To obtain accurate aerodynamic parameters, a hybrid genetic algorithm is proposed to identify and optimize the aerodynamic parameter...Aerodynamic parameters are important factors that affect projectile flight movement. To obtain accurate aerodynamic parameters, a hybrid genetic algorithm is proposed to identify and optimize the aerodynamic parameters of projectile. By combining the traditional simulated annealing method that is easy to fall into local optimum solution but hard to get global parameters with the genetic algorithm that has good global optimization ability but slow local optimization ability, the hybrid genetic algo- rithm makes full use of the advantages of the two algorithms for the optimization of projectile aerodynamic parameters. The simulation results show that the hybrid genetic algorithm is better than a single algorithm.展开更多
To reduce resources consumption of parallel computation system, a static task scheduling opti- mization method based on hybrid genetic algorithm is proposed and validated, which can shorten the scheduling length of pa...To reduce resources consumption of parallel computation system, a static task scheduling opti- mization method based on hybrid genetic algorithm is proposed and validated, which can shorten the scheduling length of parallel tasks with precedence constraints. Firstly, the global optimal model and constraints are created to demonstrate the static task scheduling problem in heterogeneous distributed computing systems（HeDCSs）. Secondly, the genetic population is coded with matrix and used to search the total available time span of the processors, and then the simulated annealing algorithm is introduced to improve the convergence speed and overcome the problem of easily falling into local minimum point, which exists in the traditional genetic algorithm. Finally, compared to other existed scheduling algorithms such as dynamic level scheduling （ DLS）, heterogeneous earliest finish time （HEFr）, and longest dynamic critical path（ LDCP）, the proposed approach does not merely de- crease tasks schedule length, but also achieves the maximal resource utilization of parallel computa- tion system by extensive experiments.展开更多
A robust phase-only Direct Data Domain Least Squares (D3LS) algorithm based on gen- eralized Rayleigh quotient optimization using hybrid Genetic Algorithm (GA) is presented in this letter. The optimization efficiency ...A robust phase-only Direct Data Domain Least Squares (D3LS) algorithm based on gen- eralized Rayleigh quotient optimization using hybrid Genetic Algorithm (GA) is presented in this letter. The optimization efficiency and computational speed are improved via the hybrid GA com- posed of standard GA and Nelder-Mead simplex algorithms. First, the objective function, with a form of generalized Rayleigh quotient, is derived via the standard D3LS algorithm. It is then taken as a fitness function and the unknown phases of all adaptive weights are taken as decision variables. Then, the nonlinear optimization is performed via the hybrid GA to obtain the optimized solution of phase-only adaptive weights. As a phase-only adaptive algorithm, the proposed algorithm is sim- pler than conventional algorithms when it comes to hardware implementation. Moreover, it proc- esses only a single snapshot data as opposed to forming sample covariance matrix and operating matrix inversion. Simulation results show that the proposed algorithm has a good signal recovery and interferences nulling performance, which are superior to that of the phase-only D3LS algorithm based on standard GA.展开更多
Used genetic algorithm (GA) to optimize the network of ventilation in order toavoid artificial convergence and speed up the convergence rate to introduce the Powellalgorithm. The Powell algorithm had been integrated i...Used genetic algorithm (GA) to optimize the network of ventilation in order toavoid artificial convergence and speed up the convergence rate to introduce the Powellalgorithm. The Powell algorithm had been integrated into GA. Powell had the effectivecapacity of solving the local optimal solution. Powell and the cross as a method ofchoice, a variation of the parallel operator, can be a better solution to the prematureconvergence of the GA problem. The two methods will be improved to make it an effective combination of hybrid GA called hybrid genetic algorithm (HGA) for the introductionof mine ventilation network optimization and to be used to solve the problem of regulating mine optimization.展开更多
The solutions of dynamic optimization problems are usually very difficult due to their highly nonlinear and multidimensional nature. 13enetic algorithm （GA） has been proved to be a teasibte method when the gradient ...The solutions of dynamic optimization problems are usually very difficult due to their highly nonlinear and multidimensional nature. 13enetic algorithm （GA） has been proved to be a teasibte method when the gradient is difficult to calculate. Its advantage is that the control profiles at all time stages are optimized simultaneously, but its convergence is very slow in the later period of evolution and it is easily trapped in the local optimum. In this study, a hybrid improved genetic algorithm （HIGA） for solving dynamic optimization problems is proposed to overcome these defects. Simplex method （SM） is used to perform the local search in the neighborhood of the optimal solution. By using SM, the ideal searching direction of global optimal solution could be found as soon as possible and the convergence speed of the algorithm is improved. The hybrid algorithm presents some improvements, such as protecting the best individual, accepting immigrations, as well as employing adaptive crossover and Ganssian mutation operators. The efficiency of the proposed algorithm is demonstrated by solving several dynamic optimization problems. At last, HIGA is applied to the optimal production of secreted protein in a fed batch reactor and the optimal feed-rate found by HIGA is effective and relatively stable.展开更多
Deficiencies of applying the simple genetic algorithm to generate concepts were specified. Based on analyzing conceptual design and the morphological matrix of an excavator, the hybrid optimization model of generating...Deficiencies of applying the simple genetic algorithm to generate concepts were specified. Based on analyzing conceptual design and the morphological matrix of an excavator, the hybrid optimization model of generating its concepts was proposed, viz. an improved adaptive genetic algorithm was applied to explore the excavator concepts in the searching space of conceptual design, and a neural network was used to evaluate the fitness of the population. The optimization of generating concepts was finished through the ＂evolution - evaluation＂ iteration. The results show that by using the hybrid optimization model, not only the fitness evaluation and constraint conditions are well processed, but also the search precision and convergence speed of the optimization process are greatly improved. An example is presented to demonstrate the advantages of the orooosed method and associated algorithms.展开更多
基金Supported by the National Natural Science Foundation of China （61074153, 61104131）, and the Fundamental Research Funds for Central Universities of China （ZY1111, JD1104）.
文摘New approaches for facility distribution in chemical plants are proposed including an improved non-overlapping constraint based on projection relationships of facilities and a novel toxic gas dispersion constraint. In consideration of the large number of variables in the plant layout model, our new method can significantly reduce the number of variables with their own projection relationships. Also, as toxic gas dispersion is a usual incident in a chemical plant, a simple approach to describe the gas leakage is proposed, which can clearly represent the constraints of potential emission source and sitting facilities. For solving the plant layout model, an improved genetic algorithm (GA) based on infeasible solution fix technique is proposed, which improves the globe search ability of GA. The case study and experiment show that a better layout plan can be obtained with our method, and the safety factors such as gas dispersion and minimum distances can be well handled in the solution.
文摘Aerodynamic parameters are important factors that affect projectile flight movement. To obtain accurate aerodynamic parameters, a hybrid genetic algorithm is proposed to identify and optimize the aerodynamic parameters of projectile. By combining the traditional simulated annealing method that is easy to fall into local optimum solution but hard to get global parameters with the genetic algorithm that has good global optimization ability but slow local optimization ability, the hybrid genetic algo- rithm makes full use of the advantages of the two algorithms for the optimization of projectile aerodynamic parameters. The simulation results show that the hybrid genetic algorithm is better than a single algorithm.
基金Supported by the National Natural Science Foundation of China(No.61401496)
文摘To reduce resources consumption of parallel computation system, a static task scheduling opti- mization method based on hybrid genetic algorithm is proposed and validated, which can shorten the scheduling length of parallel tasks with precedence constraints. Firstly, the global optimal model and constraints are created to demonstrate the static task scheduling problem in heterogeneous distributed computing systems（HeDCSs）. Secondly, the genetic population is coded with matrix and used to search the total available time span of the processors, and then the simulated annealing algorithm is introduced to improve the convergence speed and overcome the problem of easily falling into local minimum point, which exists in the traditional genetic algorithm. Finally, compared to other existed scheduling algorithms such as dynamic level scheduling （ DLS）, heterogeneous earliest finish time （HEFr）, and longest dynamic critical path（ LDCP）, the proposed approach does not merely de- crease tasks schedule length, but also achieves the maximal resource utilization of parallel computa- tion system by extensive experiments.
基金Supported by the Natural Science Foundation of Jiangsu Province (No.BK2004016).
文摘A robust phase-only Direct Data Domain Least Squares (D3LS) algorithm based on gen- eralized Rayleigh quotient optimization using hybrid Genetic Algorithm (GA) is presented in this letter. The optimization efficiency and computational speed are improved via the hybrid GA com- posed of standard GA and Nelder-Mead simplex algorithms. First, the objective function, with a form of generalized Rayleigh quotient, is derived via the standard D3LS algorithm. It is then taken as a fitness function and the unknown phases of all adaptive weights are taken as decision variables. Then, the nonlinear optimization is performed via the hybrid GA to obtain the optimized solution of phase-only adaptive weights. As a phase-only adaptive algorithm, the proposed algorithm is sim- pler than conventional algorithms when it comes to hardware implementation. Moreover, it proc- esses only a single snapshot data as opposed to forming sample covariance matrix and operating matrix inversion. Simulation results show that the proposed algorithm has a good signal recovery and interferences nulling performance, which are superior to that of the phase-only D3LS algorithm based on standard GA.
基金Supported by the National Natural Science Foundation of China(60772159)
文摘Used genetic algorithm (GA) to optimize the network of ventilation in order toavoid artificial convergence and speed up the convergence rate to introduce the Powellalgorithm. The Powell algorithm had been integrated into GA. Powell had the effectivecapacity of solving the local optimal solution. Powell and the cross as a method ofchoice, a variation of the parallel operator, can be a better solution to the prematureconvergence of the GA problem. The two methods will be improved to make it an effective combination of hybrid GA called hybrid genetic algorithm (HGA) for the introductionof mine ventilation network optimization and to be used to solve the problem of regulating mine optimization.
基金Supported by Major State Basic Research Development Program of China （2012CB720500）, National Natural Science Foundation of China （Key Program： Ul162202）, National Science Fund for Outstanding Young Scholars （61222303）, National Natural Science Foundation of China （21276078, 21206037） and the Fundamental Research Funds for the Central Universities.
文摘The solutions of dynamic optimization problems are usually very difficult due to their highly nonlinear and multidimensional nature. 13enetic algorithm （GA） has been proved to be a teasibte method when the gradient is difficult to calculate. Its advantage is that the control profiles at all time stages are optimized simultaneously, but its convergence is very slow in the later period of evolution and it is easily trapped in the local optimum. In this study, a hybrid improved genetic algorithm （HIGA） for solving dynamic optimization problems is proposed to overcome these defects. Simplex method （SM） is used to perform the local search in the neighborhood of the optimal solution. By using SM, the ideal searching direction of global optimal solution could be found as soon as possible and the convergence speed of the algorithm is improved. The hybrid algorithm presents some improvements, such as protecting the best individual, accepting immigrations, as well as employing adaptive crossover and Ganssian mutation operators. The efficiency of the proposed algorithm is demonstrated by solving several dynamic optimization problems. At last, HIGA is applied to the optimal production of secreted protein in a fed batch reactor and the optimal feed-rate found by HIGA is effective and relatively stable.
文摘Deficiencies of applying the simple genetic algorithm to generate concepts were specified. Based on analyzing conceptual design and the morphological matrix of an excavator, the hybrid optimization model of generating its concepts was proposed, viz. an improved adaptive genetic algorithm was applied to explore the excavator concepts in the searching space of conceptual design, and a neural network was used to evaluate the fitness of the population. The optimization of generating concepts was finished through the ＂evolution - evaluation＂ iteration. The results show that by using the hybrid optimization model, not only the fitness evaluation and constraint conditions are well processed, but also the search precision and convergence speed of the optimization process are greatly improved. An example is presented to demonstrate the advantages of the orooosed method and associated algorithms.
