Metallic alloys for a given application are usually designed to achieve the desired properties by devising experimentsbased on experience, thermodynamic and kinetic principles, and various modeling and simulation exer...Metallic alloys for a given application are usually designed to achieve the desired properties by devising experimentsbased on experience, thermodynamic and kinetic principles, and various modeling and simulation exercises.However, the influence of process parameters and material properties is often non-linear and non-colligative. Inrecent years, machine learning (ML) has emerged as a promising tool to dealwith the complex interrelation betweencomposition, properties, and process parameters to facilitate accelerated discovery and development of new alloysand functionalities. In this study, we adopt an ML-based approach, coupled with genetic algorithm (GA) principles,to design novel copper alloys for achieving seemingly contradictory targets of high strength and high electricalconductivity. Initially, we establish a correlation between the alloy composition (binary to multi-component) andthe target properties, namely, electrical conductivity and mechanical strength. Catboost, an ML model coupledwith GA, was used for this task. The accuracy of the model was above 93.5%. Next, for obtaining the optimizedcompositions the outputs fromthe initial model were refined by combining the concepts of data augmentation andPareto front. Finally, the ultimate objective of predicting the target composition that would deliver the desired rangeof properties was achieved by developing an advancedMLmodel through data segregation and data augmentation.To examine the reliability of this model, results were rigorously compared and verified using several independentdata reported in the literature. This comparison substantiates that the results predicted by our model regarding thevariation of conductivity and evolution ofmicrostructure and mechanical properties with composition are in goodagreement with the reports published in the literature.展开更多
A multi-objective optimization method based on Pareto Genetic Algorithm is presented for shape design of membrane structures from a structural view point.Several non-dimensional variables are defined as optimization v...A multi-objective optimization method based on Pareto Genetic Algorithm is presented for shape design of membrane structures from a structural view point.Several non-dimensional variables are defined as optimization variables,which are decision factors of shapes of membrane structures.Three objectives are proposed including maximization of stiffness,maximum uniformity of stress and minimum reaction under external loads.Pareto Multi-objective Genetic Algorithm is introduced to solve the Pareto solutions.Consequently,the dependence of the optimality upon the optimization variables is derived to provide guidelines on how to determine design parameters.Moreover,several examples illustrate the proposed methods and applications.The study shows that the multi-objective optimization method in this paper is feasible and efficient for membrane structures;the research on Pareto solutions can provide explicit and useful guidelines for shape design of membrane structures.展开更多
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.展开更多
Pulping production process produces a large amount of wastewater and pollutant emitted, which has become one of the main pollution sources in pulp and paper industry. To solve this problem, it is necessary to implemen...Pulping production process produces a large amount of wastewater and pollutant emitted, which has become one of the main pollution sources in pulp and paper industry. To solve this problem, it is necessary to implement cleaner production by using modeling and optimization technology. This paper studies the modeling and multi\|objective genetic algorithms for continuous digester process. First, model is established, in which environmental pollution and saving energy factors are considered. Then hybrid genetic algorithm based on Pareto stratum\|niche count is designed for finding near\|Pareto or Pareto optimal solutions in the problem and a new genetic evaluation and selection mechanism is proposed. Finally using the real data from a pulp mill shows the results of computer simulation. Through comparing with the practical curve of digester,this method can reduce the pollutant effectively and increase the profit while keeping the pulp quality unchanged.展开更多
This study proposes a groundwater management model in which the solution is performed through a combined simulation-optimization model. In the proposed model, a modular three-dimensional finite difference groundwater ...This study proposes a groundwater management model in which the solution is performed through a combined simulation-optimization model. In the proposed model, a modular three-dimensional finite difference groundwater flow model, MODFLOW is used as simulation model. This model is then integrated with an optimization model, in which a modified Pareto dominance based Real-Coded Genetic Algorithm (mPRCGA) is adopted. The performance of the proposed mPRCGA based management model is tested on a hypothetical numerical example. The results indicate that the proposed mPRCGA based management model is an effective way to obtain good optimum management strategy and may be used to solve other type of groundwater simulation-optimization problems.展开更多
Except for the bad weather or other uncontrollable reasons,a reasonable queue of departure and arrival flights is one of the important methods to reduce the delay on busy airports.Here focusing on the Pareto optimizat...Except for the bad weather or other uncontrollable reasons,a reasonable queue of departure and arrival flights is one of the important methods to reduce the delay on busy airports.Here focusing on the Pareto optimization of departure flights,the take-off sequencing is taken as a single machine scheduling problem with two objective functions,i.e.,the minimum of total weighted delayed number of departure flights and the latest delay time of delayed flight.And the integer programming model is established and solved by multi-objective genetic algorithm.The simulation results show that the method can obtain the better goal,and provide a variety of options for controllers considering the scene situation,thus improving the flexibility and effectivity of flight plan.展开更多
Three heuristic algorithms for optimal polygonal approximation of digital planar curves is presented. With Genetic Algorithm (GA), improved Genetic Algorithm (IGA) based on Pareto optimal solution and Tabu Search (TS)...Three heuristic algorithms for optimal polygonal approximation of digital planar curves is presented. With Genetic Algorithm (GA), improved Genetic Algorithm (IGA) based on Pareto optimal solution and Tabu Search (TS), a near optimal polygonal approximation was obtained. Compared to the famous Teh chin algorithm, our algorithms have obtained the approximated polygons with less number of vertices and less approximation error. Compared to the dynamic programming algorithm, the processing time of our algorithms are much less expensive.展开更多
The non-dominated sorting genetic algorithm （NSGA） is improved with the controlled elitism and dynamic crowding distance. A novel multi-objective optimization algorithm is obtained for wind turbine blades. As an exa...The non-dominated sorting genetic algorithm （NSGA） is improved with the controlled elitism and dynamic crowding distance. A novel multi-objective optimization algorithm is obtained for wind turbine blades. As an example, a 5 MW wind turbine blade design is presented by taking the maximum power coefficient and the minimum blade mass as the optimization objectives. The optimal results show that this algorithm has good performance in handling the multi-objective optimization of wind turbines, and it gives a Pareto-optimal solution set rather than the optimum solutions to the conventional multi objective optimization problems. The wind turbine blade optimization method presented in this paper provides a new and general algorithm for the multi-objective optimization of wind turbines.展开更多
The subject area of multiobjective optimization deals with the investigation of optimization problems that possess more than one objective function. Usually, there does not exist a single solution that optimizes all f...The subject area of multiobjective optimization deals with the investigation of optimization problems that possess more than one objective function. Usually, there does not exist a single solution that optimizes all functions simultaneously;quite the contrary, we have solution set that is called nondominated set and elements of this set are usually infinite. It is from this set decision made by taking elements of nondominated set as alternatives, which is given by analysts. Since it is important for the decision maker to obtain as much information as possible about this set, our research objective is to determine a well-defined and meaningful approximation of the solution set for linear and nonlinear three objective optimization problems. In this paper a continuous variable genetic algorithm is used to find approximate near optimal solution set. Objective functions are considered as fitness function without modification. Initial solution was generated within box constraint and solutions will be kept in feasible region during mutation and recombination.展开更多
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.展开更多
文摘Metallic alloys for a given application are usually designed to achieve the desired properties by devising experimentsbased on experience, thermodynamic and kinetic principles, and various modeling and simulation exercises.However, the influence of process parameters and material properties is often non-linear and non-colligative. Inrecent years, machine learning (ML) has emerged as a promising tool to dealwith the complex interrelation betweencomposition, properties, and process parameters to facilitate accelerated discovery and development of new alloysand functionalities. In this study, we adopt an ML-based approach, coupled with genetic algorithm (GA) principles,to design novel copper alloys for achieving seemingly contradictory targets of high strength and high electricalconductivity. Initially, we establish a correlation between the alloy composition (binary to multi-component) andthe target properties, namely, electrical conductivity and mechanical strength. Catboost, an ML model coupledwith GA, was used for this task. The accuracy of the model was above 93.5%. Next, for obtaining the optimizedcompositions the outputs fromthe initial model were refined by combining the concepts of data augmentation andPareto front. Finally, the ultimate objective of predicting the target composition that would deliver the desired rangeof properties was achieved by developing an advancedMLmodel through data segregation and data augmentation.To examine the reliability of this model, results were rigorously compared and verified using several independentdata reported in the literature. This comparison substantiates that the results predicted by our model regarding thevariation of conductivity and evolution ofmicrostructure and mechanical properties with composition are in goodagreement with the reports published in the literature.
基金Sponsored by the National Natural Science Foundation of China(Grant No.50608022)
文摘A multi-objective optimization method based on Pareto Genetic Algorithm is presented for shape design of membrane structures from a structural view point.Several non-dimensional variables are defined as optimization variables,which are decision factors of shapes of membrane structures.Three objectives are proposed including maximization of stiffness,maximum uniformity of stress and minimum reaction under external loads.Pareto Multi-objective Genetic Algorithm is introduced to solve the Pareto solutions.Consequently,the dependence of the optimality upon the optimization variables is derived to provide guidelines on how to determine design parameters.Moreover,several examples illustrate the proposed methods and applications.The study shows that the multi-objective optimization method in this paper is feasible and efficient for membrane structures;the research on Pareto solutions can provide explicit and useful guidelines for shape design of membrane structures.
基金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.
基金TheNationNaturalScienceFoundationofChina (No .6 9974 0 34)
文摘Pulping production process produces a large amount of wastewater and pollutant emitted, which has become one of the main pollution sources in pulp and paper industry. To solve this problem, it is necessary to implement cleaner production by using modeling and optimization technology. This paper studies the modeling and multi\|objective genetic algorithms for continuous digester process. First, model is established, in which environmental pollution and saving energy factors are considered. Then hybrid genetic algorithm based on Pareto stratum\|niche count is designed for finding near\|Pareto or Pareto optimal solutions in the problem and a new genetic evaluation and selection mechanism is proposed. Finally using the real data from a pulp mill shows the results of computer simulation. Through comparing with the practical curve of digester,this method can reduce the pollutant effectively and increase the profit while keeping the pulp quality unchanged.
文摘This study proposes a groundwater management model in which the solution is performed through a combined simulation-optimization model. In the proposed model, a modular three-dimensional finite difference groundwater flow model, MODFLOW is used as simulation model. This model is then integrated with an optimization model, in which a modified Pareto dominance based Real-Coded Genetic Algorithm (mPRCGA) is adopted. The performance of the proposed mPRCGA based management model is tested on a hypothetical numerical example. The results indicate that the proposed mPRCGA based management model is an effective way to obtain good optimum management strategy and may be used to solve other type of groundwater simulation-optimization problems.
基金supported by the National Natural Science Foundation of China(No.61079013)the Natural Science Fund Project in Jiangsu Province(No.BK2011737)
文摘Except for the bad weather or other uncontrollable reasons,a reasonable queue of departure and arrival flights is one of the important methods to reduce the delay on busy airports.Here focusing on the Pareto optimization of departure flights,the take-off sequencing is taken as a single machine scheduling problem with two objective functions,i.e.,the minimum of total weighted delayed number of departure flights and the latest delay time of delayed flight.And the integer programming model is established and solved by multi-objective genetic algorithm.The simulation results show that the method can obtain the better goal,and provide a variety of options for controllers considering the scene situation,thus improving the flexibility and effectivity of flight plan.
文摘Three heuristic algorithms for optimal polygonal approximation of digital planar curves is presented. With Genetic Algorithm (GA), improved Genetic Algorithm (IGA) based on Pareto optimal solution and Tabu Search (TS), a near optimal polygonal approximation was obtained. Compared to the famous Teh chin algorithm, our algorithms have obtained the approximated polygons with less number of vertices and less approximation error. Compared to the dynamic programming algorithm, the processing time of our algorithms are much less expensive.
基金Project supported by the National Basic Research Program of China (973 Program) (No. 2007CB714600)
文摘The non-dominated sorting genetic algorithm （NSGA） is improved with the controlled elitism and dynamic crowding distance. A novel multi-objective optimization algorithm is obtained for wind turbine blades. As an example, a 5 MW wind turbine blade design is presented by taking the maximum power coefficient and the minimum blade mass as the optimization objectives. The optimal results show that this algorithm has good performance in handling the multi-objective optimization of wind turbines, and it gives a Pareto-optimal solution set rather than the optimum solutions to the conventional multi objective optimization problems. The wind turbine blade optimization method presented in this paper provides a new and general algorithm for the multi-objective optimization of wind turbines.
文摘The subject area of multiobjective optimization deals with the investigation of optimization problems that possess more than one objective function. Usually, there does not exist a single solution that optimizes all functions simultaneously;quite the contrary, we have solution set that is called nondominated set and elements of this set are usually infinite. It is from this set decision made by taking elements of nondominated set as alternatives, which is given by analysts. Since it is important for the decision maker to obtain as much information as possible about this set, our research objective is to determine a well-defined and meaningful approximation of the solution set for linear and nonlinear three objective optimization problems. In this paper a continuous variable genetic algorithm is used to find approximate near optimal solution set. Objective functions are considered as fitness function without modification. Initial solution was generated within box constraint and solutions will be kept in feasible region during mutation and recombination.
文摘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.
