The existing algorithms for solving multi-objective optimization problems fall into three main categories:Decomposition-based,dominance-based,and indicator-based.Traditional multi-objective optimization problemsmainly...The existing algorithms for solving multi-objective optimization problems fall into three main categories:Decomposition-based,dominance-based,and indicator-based.Traditional multi-objective optimization problemsmainly focus on objectives,treating decision variables as a total variable to solve the problem without consideringthe critical role of decision variables in objective optimization.As seen,a variety of decision variable groupingalgorithms have been proposed.However,these algorithms are relatively broad for the changes of most decisionvariables in the evolution process and are time-consuming in the process of finding the Pareto frontier.To solvethese problems,a multi-objective optimization algorithm for grouping decision variables based on extreme pointPareto frontier(MOEA-DV/EPF)is proposed.This algorithm adopts a preprocessing rule to solve the Paretooptimal solution set of extreme points generated by simultaneous evolution in various target directions,obtainsthe basic Pareto front surface to determine the convergence effect,and analyzes the convergence and distributioneffects of decision variables.In the later stages of algorithm optimization,different mutation strategies are adoptedaccording to the nature of the decision variables to speed up the rate of evolution to obtain excellent individuals,thusenhancing the performance of the algorithm.Evaluation validation of the test functions shows that this algorithmcan solve the multi-objective optimization problem more efficiently.展开更多
The large-scale multi-objective optimization algorithm(LSMOA),based on the grouping of decision variables,is an advanced method for handling high-dimensional decision variables.However,in practical problems,the intera...The large-scale multi-objective optimization algorithm(LSMOA),based on the grouping of decision variables,is an advanced method for handling high-dimensional decision variables.However,in practical problems,the interaction among decision variables is intricate,leading to large group sizes and suboptimal optimization effects;hence a large-scale multi-objective optimization algorithm based on weighted overlapping grouping of decision variables(MOEAWOD)is proposed in this paper.Initially,the decision variables are perturbed and categorized into convergence and diversity variables;subsequently,the convergence variables are subdivided into groups based on the interactions among different decision variables.If the size of a group surpasses the set threshold,that group undergoes a process of weighting and overlapping grouping.Specifically,the interaction strength is evaluated based on the interaction frequency and number of objectives among various decision variables.The decision variable with the highest interaction in the group is identified and disregarded,and the remaining variables are then reclassified into subgroups.Finally,the decision variable with the strongest interaction is added to each subgroup.MOEAWOD minimizes the interactivity between different groups and maximizes the interactivity of decision variables within groups,which contributed to the optimized direction of convergence and diversity exploration with different groups.MOEAWOD was subjected to testing on 18 benchmark large-scale optimization problems,and the experimental results demonstrate the effectiveness of our methods.Compared with the other algorithms,our method is still at an advantage.展开更多
In the manufacturing industry,reasonable scheduling can greatly improve production efficiency,while excessive resource consumption highlights the growing significance of energy conservation in production.This paper st...In the manufacturing industry,reasonable scheduling can greatly improve production efficiency,while excessive resource consumption highlights the growing significance of energy conservation in production.This paper studies the problem of energy-efficient distributed heterogeneous permutation flowshop problem with variable processing speed(DHPFSP-VPS),considering both the minimum makespan and total energy consumption(TEC)as objectives.A discrete multi-objective squirrel search algorithm(DMSSA)is proposed to solve the DHPFSPVPS.DMSSA makes four improvements based on the squirrel search algorithm.Firstly,in terms of the population initialization strategy,four hybrid initialization methods targeting different objectives are proposed to enhance the quality of initial solutions.Secondly,enhancements are made to the population hierarchy system and position updating methods of the squirrel search algorithm,making it more suitable for discrete scheduling problems.Additionally,regarding the search strategy,six local searches are designed based on problem characteristics to enhance search capability.Moreover,a dynamic predator strategy based on Q-learning is devised to effectively balance DMSSA’s capability for global exploration and local exploitation.Finally,two speed control energy-efficient strategies are designed to reduce TEC.Extensive comparative experiments are conducted in this paper to validate the effectiveness of the proposed strategies.The results of comparing DMSSA with other algorithms demonstrate its superior performance and its potential for efficient solving of the DHPFSP-VPS problem.展开更多
In this work,a variable structure control(VSC)technique is proposed to achieve satisfactory robustness for unstable processes.Optimal values of unknown parameters of VSC are obtained using Whale optimization algorithm...In this work,a variable structure control(VSC)technique is proposed to achieve satisfactory robustness for unstable processes.Optimal values of unknown parameters of VSC are obtained using Whale optimization algorithm which was recently reported in literature.Stability analysis has been done to verify the suitability of the proposed structure for industrial processes.The proposed control strategy is applied to three different types of unstable processes including non-minimum phase and nonlinear systems.A comparative study ensures that the proposed scheme gives superior performance over the recently reported VSC system.Furthermore,the proposed method gives satisfactory results for a cart inverted pendulum system in the presence of external disturbance and noise.展开更多
In order to solve the flexible job shop scheduling problem with variable batches,we propose an improved multiobjective optimization algorithm,which combines the idea of inverse scheduling.First,a flexible job shop pro...In order to solve the flexible job shop scheduling problem with variable batches,we propose an improved multiobjective optimization algorithm,which combines the idea of inverse scheduling.First,a flexible job shop problem with the variable batches scheduling model is formulated.Second,we propose a batch optimization algorithm with inverse scheduling in which the batch size is adjusted by the dynamic feedback batch adjusting method.Moreover,in order to increase the diversity of the population,two methods are developed.One is the threshold to control the neighborhood updating,and the other is the dynamic clustering algorithm to update the population.Finally,a group of experiments are carried out.The results show that the improved multi-objective optimization algorithm can ensure the diversity of Pareto solutions effectively,and has effective performance in solving the flexible job shop scheduling problem with variable batches.展开更多
Associated dynamic performance of the clamping force control valve used in continuously variable transmission （CVT） is optimized. Firstly, the structure and working principle of the valve are analyzed, and then a dy...Associated dynamic performance of the clamping force control valve used in continuously variable transmission （CVT） is optimized. Firstly, the structure and working principle of the valve are analyzed, and then a dynamic model is set up by means of mechanism analysis. For the purpose of checking the validity of the modeling method, a prototype workpiece of the valve is manufactured for comparison test, and its simulation result follows the experimental result quite well. An associated performance index is founded considering the response time, overshoot and saving energy, and five structural parameters are selected to adjust for deriving the optimal associated performance index. The optimization problem is solved by the genetic algorithm （GA） with necessary constraints. Finally, the properties of the optimized valve are compared with those of the prototype workpiece, and the results prove that the dynamic performance indexes of the optimized valve are much better than those of the prototype workpiece.展开更多
Some problems in the optimal topology design of structures with discrete variables are studied in this paper.The problem of a model of discrete optimization is discussed and a neglected fact that discrete optimum desi...Some problems in the optimal topology design of structures with discrete variables are studied in this paper.The problem of a model of discrete optimization is discussed and a neglected fact that discrete optimum design may be controlled by the discreteness of sizing variables and global con- straints is pointed out.A heuristic algorithm for solving discrete topology optimization problems of trusses and frames is proposed.展开更多
In this paper, a variable metric algorithm is proposed with Broyden rank one modifications for the equality constrained optimization. This method is viewed expansion in constrained optimization as the quasi-Newton met...In this paper, a variable metric algorithm is proposed with Broyden rank one modifications for the equality constrained optimization. This method is viewed expansion in constrained optimization as the quasi-Newton method to unconstrained optimization. The theoretical analysis shows that local convergence can be induced under some suitable conditions. In the end, it is established an equivalent condition of superlinear convergence.展开更多
Genetic algorithm(GA) has received significant attention for the design and implementation of intrusion detection systems. In this paper, it is proposed to use variable length chromosomes(VLCs) in a GA-based network i...Genetic algorithm(GA) has received significant attention for the design and implementation of intrusion detection systems. In this paper, it is proposed to use variable length chromosomes(VLCs) in a GA-based network intrusion detection system.Fewer chromosomes with relevant features are used for rule generation. An effective fitness function is used to define the fitness of each rule. Each chromosome will have one or more rules in it. As each chromosome is a complete solution to the problem, fewer chromosomes are sufficient for effective intrusion detection. This reduces the computational time. The proposed approach is tested using Defense Advanced Research Project Agency(DARPA) 1998 data. The experimental results show that the proposed approach is efficient in network intrusion detection.展开更多
Blank holder force(BHF)is a crucial parameter in deep drawing,having close relation with the forming quality of sheet metal.However,there are different BHFs maintaining the best forming effect in different stages of d...Blank holder force(BHF)is a crucial parameter in deep drawing,having close relation with the forming quality of sheet metal.However,there are different BHFs maintaining the best forming effect in different stages of deep drawing.The variable blank holder force(VBHF)varying with the drawing stage can overcome this problem at an extent.The optimization of VBHF is to determine the optimal BHF in every deep drawing stage.In this paper,a new heuristic optimization algorithm named Jaya is introduced to solve the optimization efficiently.An improved“Quasi-oppositional”strategy is added to Jaya algorithm for improving population diversity.Meanwhile,an innovated stop criterion is added for better convergence.Firstly,the quality evaluation criteria for wrinkling and tearing are built.Secondly,the Kriging models are developed to approximate and quantify the relation between VBHF and forming defects under random sampling.Finally,the optimization models are established and solved by the improved QO-Jaya algorithm.A VBHF optimization example of component with complicated shape and thin wall is studied to prove the effectiveness of the improved Jaya algorithm.The optimization results are compared with that obtained by other algorithms based on the TOPSIS method.展开更多
To meet the greenhouse gas reduction targets and address the uncertainty introduced by the surging penetration of stochastic renewable energy sources,energy storage systems are being deployed in microgrids.Relying sol...To meet the greenhouse gas reduction targets and address the uncertainty introduced by the surging penetration of stochastic renewable energy sources,energy storage systems are being deployed in microgrids.Relying solely on short-term uncertainty forecasts can result in substantial costs when making dispatch decisions for a storage system over an entire day.To mitigate this challenge,an adaptive robust optimization approach tailored for a hybrid hydrogen battery energy storage system(HBESS)operating within a microgrid is proposed,with a focus on efficient state-of-charge(SoC)planning to minimize microgrid expenses.The SoC ranges of the battery energy storage(BES)are determined in the day-ahead stage.Concurrently,the power generated by fuel cells and consumed by electrolysis device are optimized.This is followed by the intraday stage,where BES dispatch decisions are made within a predetermined SoC range to accommodate the uncertainties realized.To address this uncertainty and solve the adaptive optimization problem with integer recourse variables in the intraday stage,we proposed an outer-inner column-and-constraint generation algorithm(outer-inner-CCG).Numerical analyses underscored the high effectiveness and efficiency of the proposed adaptive robust operation model in making decisions for HBESS dispatch.展开更多
A method utilizing variable depth increments during incremental forming was proposed and then optimized based on numerical simulation and intelligent algorithm.Initially,a finite element method(FEM) model was set up a...A method utilizing variable depth increments during incremental forming was proposed and then optimized based on numerical simulation and intelligent algorithm.Initially,a finite element method(FEM) model was set up and then experimentally verified.And the relation between depth increment and the minimum thickness tmin as well as its location was analyzed through the FEM model.Afterwards,the variation of depth increments was defined.The designed part was divided into three areas according to the main deformation mechanism,with Di(i=1,2) representing the two dividing locations.And three different values of depth increment,Δzi(i=1,2,3) were utilized for the three areas,respectively.Additionally,an orthogonal test was established to research the relation between the five process parameters(D and Δz) and tmin as well as its location.The result shows that Δz2 has the most significant influence on the thickness distribution for the corresponding area is the largest one.Finally,a single evaluating indicator,taking into account of both tmin and its location,was formatted with a linear weighted model.And the process parameters were optimized through a genetic algorithm integrated with an artificial neural network based on the evaluating index.The result shows that the proposed algorithm is satisfactory for the optimization of variable depth increment.展开更多
An Equilibrium Multi-objective Optimization Model(EMOM)with self-regulated weighting factors has been proposed for the optimum design of non-circular clearance hole on the front flange of turbine disk.In the‘‘equili...An Equilibrium Multi-objective Optimization Model(EMOM)with self-regulated weighting factors has been proposed for the optimum design of non-circular clearance hole on the front flange of turbine disk.In the‘‘equilibrium design",both the stress decrease around the hole and the least hole's profile variation are considered,which balances two ambivalent design goals.Specific discrete variables are applied to realize the standardization design in the optimization process,in which a Surrogate Genetic Coding Algorithm(SGCA)is introduced,and a special check module is used to get rid of repeated fitness evaluation of the samples.The method offers an equilibrium design for the non-circular clearance hole of the turbine disk with great accuracy and efficiency.展开更多
Advanced engineering systems, like aircraft, are defined by tens or even hundreds of design variables. Building an accurate surrogate model for use in such high-dimensional optimization problems is a difficult task ow...Advanced engineering systems, like aircraft, are defined by tens or even hundreds of design variables. Building an accurate surrogate model for use in such high-dimensional optimization problems is a difficult task owing to the curse of dimensionality. This paper presents a new algorithm to reduce the size of a design space to a smaller region of interest allowing a more accurate surrogate model to be generated. The framework requires a set of models of different physical or numerical fidelities. The low-fidelity （LF） model provides physics-based approximation of the high-fidelity （HF） model at a fraction of the computational cost. It is also instrumental in identifying the small region of interest in the design space that encloses the high-fidelity optimum. A surrogate model is then constructed to match the low-fidelity model to the high-fidelity model in the identified region of interest. The optimization process is managed by an update strategy to prevent convergence to false optima. The algorithm is applied on mathematical problems and a two-dimen-sional aerodynamic shape optimization problem in a variable-fidelity context. Results obtained are in excellent agreement with high-fidelity results, even with lower-fidelity flow solvers, while showing up to 39% time savings.展开更多
A concept of the independent-continuous topological variable is proposed to establish its corresponding smooth model of structural topological optimization. The method can overcome difficulties that are encountered in...A concept of the independent-continuous topological variable is proposed to establish its corresponding smooth model of structural topological optimization. The method can overcome difficulties that are encountered in conventional models and algorithms for the optimization of the structural topology. Its application to truss topological optimization with stress and displacement constraints is satisfactory, with convergence faster than that of sectional optimizations.展开更多
Anisotropic plates in different applications may have geometric defects such as openings and cracks.The presence of the opening disturbs the heat flow,which creates significant thermal stress around the opening.When t...Anisotropic plates in different applications may have geometric defects such as openings and cracks.The presence of the opening disturbs the heat flow,which creates significant thermal stress around the opening.When the heat flux is high enough,these extreme stresses can lead to structural failure.This article aims to obtain the optimal parameters for achieving the minimum value of the normalized stress near the cutout’s boundary in perforated anisotropic plates utilizing the genetic algorithm.Optimization parameters include the curvature of opening’s corners,orientation angle of opening,fibers angle,heat flux angle,and opening’s elongation.The plate is under heat flux,and the opening’s border is thermally insulated.The stress distribution around the opening is calculated using Lekhnitskii’s complex variable method and complex potential functions.The genetic algorithm is then implemented to find the optimal values for design parameters.The results show that by selecting the optimal parameters related to the anisotropic material and the opening’s geometry,the stress intensity factor of the perforated anisotropic plates is remarkably reduced.Furthermore,this optimization algorithm can be extended to find the optimized parameters and achieve the optimal designs in anisotropic and isotropic perforated plates under thermal loadings.展开更多
To solve the contradiction between convergence rate and steady-state error in least mean square (LMS) algorithm, basing on independence assumption, this paper proposes and proves the optimal step-size theorem from the...To solve the contradiction between convergence rate and steady-state error in least mean square (LMS) algorithm, basing on independence assumption, this paper proposes and proves the optimal step-size theorem from the view of minimizing mean squared error (MSE). The theorem reveals the one-to-one mapping between the optimal step-size and MSE. Following the theorem, optimal variable step-size LMS (OVS-LMS) model, describing the theoretical bound of the convergence rate of LMS algorithm, is constructed. Then we discuss the selection of initial optimal step-size and updating of optimal step-size at the time of unknown system changing. At last an optimal step-size LMS algorithm is proposed and tested in various environments. Simulation results show the proposed algorithm is very close to the theoretical bound.展开更多
To minimize the reactive power of the converter of the control winding in the novel dual stator-winding induction generator based on the PWM converter, design features of the induction generator with a rectified load ...To minimize the reactive power of the converter of the control winding in the novel dual stator-winding induction generator based on the PWM converter, design features of the induction generator with a rectified load are proposed. The optimization method of excited capacitors to minimize the reactive power of the control winding at a variable speed is given. The calculation capacity of the machine with a diode bridge rectifier load is proposed. To achieve global searching, the integrated method with the improved real-coded genetic algorithm and the twodimensional finite element method （FEM） is introduced. Design results of the sample show that reactive power can be reduced by the method, and the converter capacity can be decreased to 1/3 of output rated power at the speed ratio of 1 ： 3, thus reducing the volume and the mass of the inverter.展开更多
Due to the NP-hardness of the two-sided assembly line balancing （TALB） problem, multiple constraints existing in real applications are less studied, especially when one task is involved with several constraints. In ...Due to the NP-hardness of the two-sided assembly line balancing （TALB） problem, multiple constraints existing in real applications are less studied, especially when one task is involved with several constraints. In this paper, an effective hybrid algorithm is proposed to address the TALB problem with multiple constraints （TALB-MC）. Considering the discrete attribute of TALB-MC and the continuous attribute of the standard teaching-learning-based optimization （TLBO） algorithm, the random-keys method is hired in task permutation representation, for the purpose of bridging the gap between them. Subsequently, a special mechanism for handling multiple constraints is developed. In the mechanism, the directions constraint of each task is ensured by the direction check and adjustment. The zoning constraints and the synchronism constraints are satisfied by teasing out the hidden correlations among constraints. The positional constraint is allowed to be violated to some extent in decoding and punished in cost fimction. Finally, with the TLBO seeking for the global optimum, the variable neighborhood search （VNS） is further hybridized to extend the local search space. The experimental results show that the proposed hybrid algorithm outperforms the late acceptance hill-climbing algorithm （LAHC） for TALB-MC in most cases, especially for large-size problems with multiple constraints, and demonstrates well balance between the exploration and the exploitation. This research proposes an effective and efficient algorithm for solving TALB-MC problem by hybridizing the TLBO and VNS.展开更多
基金the Liaoning Province Nature Fundation Project(2022-MS-291)the National Programme for Foreign Expert Projects(G2022006008L)+2 种基金the Basic Research Projects of Liaoning Provincial Department of Education(LJKMZ20220781,LJKMZ20220783,LJKQZ20222457)King Saud University funded this study through theResearcher Support Program Number(RSPD2023R704)King Saud University,Riyadh,Saudi Arabia.
文摘The existing algorithms for solving multi-objective optimization problems fall into three main categories:Decomposition-based,dominance-based,and indicator-based.Traditional multi-objective optimization problemsmainly focus on objectives,treating decision variables as a total variable to solve the problem without consideringthe critical role of decision variables in objective optimization.As seen,a variety of decision variable groupingalgorithms have been proposed.However,these algorithms are relatively broad for the changes of most decisionvariables in the evolution process and are time-consuming in the process of finding the Pareto frontier.To solvethese problems,a multi-objective optimization algorithm for grouping decision variables based on extreme pointPareto frontier(MOEA-DV/EPF)is proposed.This algorithm adopts a preprocessing rule to solve the Paretooptimal solution set of extreme points generated by simultaneous evolution in various target directions,obtainsthe basic Pareto front surface to determine the convergence effect,and analyzes the convergence and distributioneffects of decision variables.In the later stages of algorithm optimization,different mutation strategies are adoptedaccording to the nature of the decision variables to speed up the rate of evolution to obtain excellent individuals,thusenhancing the performance of the algorithm.Evaluation validation of the test functions shows that this algorithmcan solve the multi-objective optimization problem more efficiently.
基金supported in part by the Central Government Guides Local Science and TechnologyDevelopment Funds(Grant No.YDZJSX2021A038)in part by theNational Natural Science Foundation of China under(Grant No.61806138)in part by the China University Industry-University-Research Collaborative Innovation Fund(Future Network Innovation Research and Application Project)(Grant 2021FNA04014).
文摘The large-scale multi-objective optimization algorithm(LSMOA),based on the grouping of decision variables,is an advanced method for handling high-dimensional decision variables.However,in practical problems,the interaction among decision variables is intricate,leading to large group sizes and suboptimal optimization effects;hence a large-scale multi-objective optimization algorithm based on weighted overlapping grouping of decision variables(MOEAWOD)is proposed in this paper.Initially,the decision variables are perturbed and categorized into convergence and diversity variables;subsequently,the convergence variables are subdivided into groups based on the interactions among different decision variables.If the size of a group surpasses the set threshold,that group undergoes a process of weighting and overlapping grouping.Specifically,the interaction strength is evaluated based on the interaction frequency and number of objectives among various decision variables.The decision variable with the highest interaction in the group is identified and disregarded,and the remaining variables are then reclassified into subgroups.Finally,the decision variable with the strongest interaction is added to each subgroup.MOEAWOD minimizes the interactivity between different groups and maximizes the interactivity of decision variables within groups,which contributed to the optimized direction of convergence and diversity exploration with different groups.MOEAWOD was subjected to testing on 18 benchmark large-scale optimization problems,and the experimental results demonstrate the effectiveness of our methods.Compared with the other algorithms,our method is still at an advantage.
基金supported by the Key Research and Development Project of Hubei Province(Nos.2020BAB114 and 2023BAB094).
文摘In the manufacturing industry,reasonable scheduling can greatly improve production efficiency,while excessive resource consumption highlights the growing significance of energy conservation in production.This paper studies the problem of energy-efficient distributed heterogeneous permutation flowshop problem with variable processing speed(DHPFSP-VPS),considering both the minimum makespan and total energy consumption(TEC)as objectives.A discrete multi-objective squirrel search algorithm(DMSSA)is proposed to solve the DHPFSPVPS.DMSSA makes four improvements based on the squirrel search algorithm.Firstly,in terms of the population initialization strategy,four hybrid initialization methods targeting different objectives are proposed to enhance the quality of initial solutions.Secondly,enhancements are made to the population hierarchy system and position updating methods of the squirrel search algorithm,making it more suitable for discrete scheduling problems.Additionally,regarding the search strategy,six local searches are designed based on problem characteristics to enhance search capability.Moreover,a dynamic predator strategy based on Q-learning is devised to effectively balance DMSSA’s capability for global exploration and local exploitation.Finally,two speed control energy-efficient strategies are designed to reduce TEC.Extensive comparative experiments are conducted in this paper to validate the effectiveness of the proposed strategies.The results of comparing DMSSA with other algorithms demonstrate its superior performance and its potential for efficient solving of the DHPFSP-VPS problem.
文摘In this work,a variable structure control(VSC)technique is proposed to achieve satisfactory robustness for unstable processes.Optimal values of unknown parameters of VSC are obtained using Whale optimization algorithm which was recently reported in literature.Stability analysis has been done to verify the suitability of the proposed structure for industrial processes.The proposed control strategy is applied to three different types of unstable processes including non-minimum phase and nonlinear systems.A comparative study ensures that the proposed scheme gives superior performance over the recently reported VSC system.Furthermore,the proposed method gives satisfactory results for a cart inverted pendulum system in the presence of external disturbance and noise.
基金supported by the National Key R&D Plan(2020YFB1712902)the National Natural Science Foundation of China(52075036).
文摘In order to solve the flexible job shop scheduling problem with variable batches,we propose an improved multiobjective optimization algorithm,which combines the idea of inverse scheduling.First,a flexible job shop problem with the variable batches scheduling model is formulated.Second,we propose a batch optimization algorithm with inverse scheduling in which the batch size is adjusted by the dynamic feedback batch adjusting method.Moreover,in order to increase the diversity of the population,two methods are developed.One is the threshold to control the neighborhood updating,and the other is the dynamic clustering algorithm to update the population.Finally,a group of experiments are carried out.The results show that the improved multi-objective optimization algorithm can ensure the diversity of Pareto solutions effectively,and has effective performance in solving the flexible job shop scheduling problem with variable batches.
基金Key Science-Technology Foundation of Hunan Province, China (No. 05GK2007).
文摘Associated dynamic performance of the clamping force control valve used in continuously variable transmission （CVT） is optimized. Firstly, the structure and working principle of the valve are analyzed, and then a dynamic model is set up by means of mechanism analysis. For the purpose of checking the validity of the modeling method, a prototype workpiece of the valve is manufactured for comparison test, and its simulation result follows the experimental result quite well. An associated performance index is founded considering the response time, overshoot and saving energy, and five structural parameters are selected to adjust for deriving the optimal associated performance index. The optimization problem is solved by the genetic algorithm （GA） with necessary constraints. Finally, the properties of the optimized valve are compared with those of the prototype workpiece, and the results prove that the dynamic performance indexes of the optimized valve are much better than those of the prototype workpiece.
文摘Some problems in the optimal topology design of structures with discrete variables are studied in this paper.The problem of a model of discrete optimization is discussed and a neglected fact that discrete optimum design may be controlled by the discreteness of sizing variables and global con- straints is pointed out.A heuristic algorithm for solving discrete topology optimization problems of trusses and frames is proposed.
文摘In this paper, a variable metric algorithm is proposed with Broyden rank one modifications for the equality constrained optimization. This method is viewed expansion in constrained optimization as the quasi-Newton method to unconstrained optimization. The theoretical analysis shows that local convergence can be induced under some suitable conditions. In the end, it is established an equivalent condition of superlinear convergence.
文摘Genetic algorithm(GA) has received significant attention for the design and implementation of intrusion detection systems. In this paper, it is proposed to use variable length chromosomes(VLCs) in a GA-based network intrusion detection system.Fewer chromosomes with relevant features are used for rule generation. An effective fitness function is used to define the fitness of each rule. Each chromosome will have one or more rules in it. As each chromosome is a complete solution to the problem, fewer chromosomes are sufficient for effective intrusion detection. This reduces the computational time. The proposed approach is tested using Defense Advanced Research Project Agency(DARPA) 1998 data. The experimental results show that the proposed approach is efficient in network intrusion detection.
基金Supported by National Key Research and Development Program of China(Grant No.2022YFB3304200)National Natural Science Foundation of China(Grant No.52075479)Taizhou Municipal Science and Technology Project of China(Grant No.1801gy23).
文摘Blank holder force(BHF)is a crucial parameter in deep drawing,having close relation with the forming quality of sheet metal.However,there are different BHFs maintaining the best forming effect in different stages of deep drawing.The variable blank holder force(VBHF)varying with the drawing stage can overcome this problem at an extent.The optimization of VBHF is to determine the optimal BHF in every deep drawing stage.In this paper,a new heuristic optimization algorithm named Jaya is introduced to solve the optimization efficiently.An improved“Quasi-oppositional”strategy is added to Jaya algorithm for improving population diversity.Meanwhile,an innovated stop criterion is added for better convergence.Firstly,the quality evaluation criteria for wrinkling and tearing are built.Secondly,the Kriging models are developed to approximate and quantify the relation between VBHF and forming defects under random sampling.Finally,the optimization models are established and solved by the improved QO-Jaya algorithm.A VBHF optimization example of component with complicated shape and thin wall is studied to prove the effectiveness of the improved Jaya algorithm.The optimization results are compared with that obtained by other algorithms based on the TOPSIS method.
基金supported by the National Natural Science Foundation of China under Grant No.72331008,and No.72271211,and PolyU research project 1-YXBL.
文摘To meet the greenhouse gas reduction targets and address the uncertainty introduced by the surging penetration of stochastic renewable energy sources,energy storage systems are being deployed in microgrids.Relying solely on short-term uncertainty forecasts can result in substantial costs when making dispatch decisions for a storage system over an entire day.To mitigate this challenge,an adaptive robust optimization approach tailored for a hybrid hydrogen battery energy storage system(HBESS)operating within a microgrid is proposed,with a focus on efficient state-of-charge(SoC)planning to minimize microgrid expenses.The SoC ranges of the battery energy storage(BES)are determined in the day-ahead stage.Concurrently,the power generated by fuel cells and consumed by electrolysis device are optimized.This is followed by the intraday stage,where BES dispatch decisions are made within a predetermined SoC range to accommodate the uncertainties realized.To address this uncertainty and solve the adaptive optimization problem with integer recourse variables in the intraday stage,we proposed an outer-inner column-and-constraint generation algorithm(outer-inner-CCG).Numerical analyses underscored the high effectiveness and efficiency of the proposed adaptive robust operation model in making decisions for HBESS dispatch.
文摘A method utilizing variable depth increments during incremental forming was proposed and then optimized based on numerical simulation and intelligent algorithm.Initially,a finite element method(FEM) model was set up and then experimentally verified.And the relation between depth increment and the minimum thickness tmin as well as its location was analyzed through the FEM model.Afterwards,the variation of depth increments was defined.The designed part was divided into three areas according to the main deformation mechanism,with Di(i=1,2) representing the two dividing locations.And three different values of depth increment,Δzi(i=1,2,3) were utilized for the three areas,respectively.Additionally,an orthogonal test was established to research the relation between the five process parameters(D and Δz) and tmin as well as its location.The result shows that Δz2 has the most significant influence on the thickness distribution for the corresponding area is the largest one.Finally,a single evaluating indicator,taking into account of both tmin and its location,was formatted with a linear weighted model.And the process parameters were optimized through a genetic algorithm integrated with an artificial neural network based on the evaluating index.The result shows that the proposed algorithm is satisfactory for the optimization of variable depth increment.
文摘An Equilibrium Multi-objective Optimization Model(EMOM)with self-regulated weighting factors has been proposed for the optimum design of non-circular clearance hole on the front flange of turbine disk.In the‘‘equilibrium design",both the stress decrease around the hole and the least hole's profile variation are considered,which balances two ambivalent design goals.Specific discrete variables are applied to realize the standardization design in the optimization process,in which a Surrogate Genetic Coding Algorithm(SGCA)is introduced,and a special check module is used to get rid of repeated fitness evaluation of the samples.The method offers an equilibrium design for the non-circular clearance hole of the turbine disk with great accuracy and efficiency.
文摘Advanced engineering systems, like aircraft, are defined by tens or even hundreds of design variables. Building an accurate surrogate model for use in such high-dimensional optimization problems is a difficult task owing to the curse of dimensionality. This paper presents a new algorithm to reduce the size of a design space to a smaller region of interest allowing a more accurate surrogate model to be generated. The framework requires a set of models of different physical or numerical fidelities. The low-fidelity （LF） model provides physics-based approximation of the high-fidelity （HF） model at a fraction of the computational cost. It is also instrumental in identifying the small region of interest in the design space that encloses the high-fidelity optimum. A surrogate model is then constructed to match the low-fidelity model to the high-fidelity model in the identified region of interest. The optimization process is managed by an update strategy to prevent convergence to false optima. The algorithm is applied on mathematical problems and a two-dimen-sional aerodynamic shape optimization problem in a variable-fidelity context. Results obtained are in excellent agreement with high-fidelity results, even with lower-fidelity flow solvers, while showing up to 39% time savings.
基金The project supported by State Key Laboratory of Structural Analyses of Industrial Equipment
文摘A concept of the independent-continuous topological variable is proposed to establish its corresponding smooth model of structural topological optimization. The method can overcome difficulties that are encountered in conventional models and algorithms for the optimization of the structural topology. Its application to truss topological optimization with stress and displacement constraints is satisfactory, with convergence faster than that of sectional optimizations.
文摘Anisotropic plates in different applications may have geometric defects such as openings and cracks.The presence of the opening disturbs the heat flow,which creates significant thermal stress around the opening.When the heat flux is high enough,these extreme stresses can lead to structural failure.This article aims to obtain the optimal parameters for achieving the minimum value of the normalized stress near the cutout’s boundary in perforated anisotropic plates utilizing the genetic algorithm.Optimization parameters include the curvature of opening’s corners,orientation angle of opening,fibers angle,heat flux angle,and opening’s elongation.The plate is under heat flux,and the opening’s border is thermally insulated.The stress distribution around the opening is calculated using Lekhnitskii’s complex variable method and complex potential functions.The genetic algorithm is then implemented to find the optimal values for design parameters.The results show that by selecting the optimal parameters related to the anisotropic material and the opening’s geometry,the stress intensity factor of the perforated anisotropic plates is remarkably reduced.Furthermore,this optimization algorithm can be extended to find the optimized parameters and achieve the optimal designs in anisotropic and isotropic perforated plates under thermal loadings.
基金This work was supported in part by the National Fundamental Research Program(Grant No.G1998030406)the National Natural Science Foundation of China(Grant No.69972020)by the State Key Lab on Microwave and Digital Communications,Department of Electronics Engineering,Tsinghua University.
文摘To solve the contradiction between convergence rate and steady-state error in least mean square (LMS) algorithm, basing on independence assumption, this paper proposes and proves the optimal step-size theorem from the view of minimizing mean squared error (MSE). The theorem reveals the one-to-one mapping between the optimal step-size and MSE. Following the theorem, optimal variable step-size LMS (OVS-LMS) model, describing the theoretical bound of the convergence rate of LMS algorithm, is constructed. Then we discuss the selection of initial optimal step-size and updating of optimal step-size at the time of unknown system changing. At last an optimal step-size LMS algorithm is proposed and tested in various environments. Simulation results show the proposed algorithm is very close to the theoretical bound.
文摘To minimize the reactive power of the converter of the control winding in the novel dual stator-winding induction generator based on the PWM converter, design features of the induction generator with a rectified load are proposed. The optimization method of excited capacitors to minimize the reactive power of the control winding at a variable speed is given. The calculation capacity of the machine with a diode bridge rectifier load is proposed. To achieve global searching, the integrated method with the improved real-coded genetic algorithm and the twodimensional finite element method （FEM） is introduced. Design results of the sample show that reactive power can be reduced by the method, and the converter capacity can be decreased to 1/3 of output rated power at the speed ratio of 1 ： 3, thus reducing the volume and the mass of the inverter.
基金Supported by National Natural Science Foundation of China(Grant Nos.51275366,50875190,51305311)Specialized Research Fund for the Doctoral Program of Higher Education of China(Grant No.20134219110002)
文摘Due to the NP-hardness of the two-sided assembly line balancing （TALB） problem, multiple constraints existing in real applications are less studied, especially when one task is involved with several constraints. In this paper, an effective hybrid algorithm is proposed to address the TALB problem with multiple constraints （TALB-MC）. Considering the discrete attribute of TALB-MC and the continuous attribute of the standard teaching-learning-based optimization （TLBO） algorithm, the random-keys method is hired in task permutation representation, for the purpose of bridging the gap between them. Subsequently, a special mechanism for handling multiple constraints is developed. In the mechanism, the directions constraint of each task is ensured by the direction check and adjustment. The zoning constraints and the synchronism constraints are satisfied by teasing out the hidden correlations among constraints. The positional constraint is allowed to be violated to some extent in decoding and punished in cost fimction. Finally, with the TLBO seeking for the global optimum, the variable neighborhood search （VNS） is further hybridized to extend the local search space. The experimental results show that the proposed hybrid algorithm outperforms the late acceptance hill-climbing algorithm （LAHC） for TALB-MC in most cases, especially for large-size problems with multiple constraints, and demonstrates well balance between the exploration and the exploitation. This research proposes an effective and efficient algorithm for solving TALB-MC problem by hybridizing the TLBO and VNS.
