In this paper,an adaptive cubic regularisation algorithm based on affine scaling methods(ARCBASM)is proposed for solving nonlinear equality constrained programming with nonnegative constraints on variables.From the op...In this paper,an adaptive cubic regularisation algorithm based on affine scaling methods(ARCBASM)is proposed for solving nonlinear equality constrained programming with nonnegative constraints on variables.From the optimality conditions of the problem,we introduce appropriate affine matrix and construct an affine scaling ARC subproblem with linearized constraints.Composite step methods and reduced Hessian methods are applied to tackle the linearized constraints.As a result,a standard unconstrained ARC subproblem is deduced and its solution can supply sufficient decrease.The fraction to the boundary rule maintains the strict feasibility(for nonnegative constraints on variables)of every iteration point.Reflection techniques are employed to prevent the iterations from approaching zero too early.Under mild assumptions,global convergence of the algorithm is analysed.Preliminary numerical results are reported.展开更多
The moving morphable component(MMC)topology optimization method,as a typical explicit topology optimization method,has been widely concerned.In the MMC topology optimization framework,the surrogate material model is m...The moving morphable component(MMC)topology optimization method,as a typical explicit topology optimization method,has been widely concerned.In the MMC topology optimization framework,the surrogate material model is mainly used for finite element analysis at present,and the effectiveness of the surrogate material model has been fully confirmed.However,there are some accuracy problems when dealing with boundary elements using the surrogate material model,which will affect the topology optimization results.In this study,a boundary element reconstruction(BER)model is proposed based on the surrogate material model under the MMC topology optimization framework to improve the accuracy of topology optimization.The proposed BER model can reconstruct the boundary elements by refining the local meshes and obtaining new nodes in boundary elements.Then the density of boundary elements is recalculated using the new node information,which is more accurate than the original model.Based on the new density of boundary elements,the material properties and volume information of the boundary elements are updated.Compared with other finite element analysis methods,the BER model is simple and feasible and can improve computational accuracy.Finally,the effectiveness and superiority of the proposed method are verified by comparing it with the optimization results of the original surrogate material model through several numerical examples.展开更多
Landing gear lower drag stay is a key component which connects fuselage and landing gear and directly effects the safety and performance of aircraft takeoff and landing. To effectively design the lower drag stay and r...Landing gear lower drag stay is a key component which connects fuselage and landing gear and directly effects the safety and performance of aircraft takeoff and landing. To effectively design the lower drag stay and reduce the weight of landing gear, Global/local Linked Driven Optimization Strategy(GLDOS) was developed to conduct the overall process design of lower drag stay in respect of optimization thought. The whole-process optimization involves two stages of structural conceptual design and detailed design. In the structural conceptual design, the landing gear lower drag stay was globally topologically optimized by adopting multiple starting points algorithm. In the detailed design, the local size and shape of landing gear lower drag stay were globally optimized by the gradient optimization strategy. The GLDOS method adopts different optimization strategies for different optimization stages to acquire the optimum design effect. Through the experimental validation, the weight of the optimized lower dray stay with the developed GLDOS is reduced by 16.79% while keeping enough strength and stiffness, which satisfies the requirements of engineering design under the typical loading conditions. The proposed GLDOS is validated to be accurate and efficient in optimization scheme and design cycles. The efforts of this paper provide a whole-process optimization approach regarding different optimization technologies in different design phases, which is significant in reducing structural weight and enhance design tp wid 1 precision for complex structures in aircrafts.展开更多
Variable-fidelity(VF)surrogate models have received increasing attention in engineering design optimization as they can approximate expensive high-fidelity(HF)simulations with reduced computational power.A key challen...Variable-fidelity(VF)surrogate models have received increasing attention in engineering design optimization as they can approximate expensive high-fidelity(HF)simulations with reduced computational power.A key challenge to building a VF model is devising an adaptive model updating strategy that jointly selects additional low-fidelity(LF)and/or HF samples.The additional samples must enhance the model accuracy while maximizing the computational efficiency.We propose ISMA-VFEEI,a global optimization framework that integrates an Improved Slime-Mould Algorithm(ISMA)and a Variable-Fidelity Expected Extension Improvement(VFEEI)learning function to construct a VF surrogate model efficiently.First,A cost-aware VFEEI function guides the adaptive LF/HF sampling by explicitly incorporating evaluation cost and existing sample proximity.Second,ISMA is employed to solve the resulting non-convex optimization problem and identify global optimal infill points for model enhancement.The efficacy of ISMA-VFEEI is demonstrated through six numerical benchmarks and one real-world engineering case study.The engineering case study of a high-speed railway Electric Multiple Unit(EMU),the optimization objective of a sanding device attained a minimum value of 1.546 using only 20 HF evaluations,outperforming all the compared methods.展开更多
Optimal sizing and allocation of distributed generators(DGs)have become essential computational challenges in improving the performance,efficiency,and reliability of electrical distribution networks.Despite extensive ...Optimal sizing and allocation of distributed generators(DGs)have become essential computational challenges in improving the performance,efficiency,and reliability of electrical distribution networks.Despite extensive research,existing approaches often face algorithmic limitations such as slow convergence,premature stagnation in local minima,or suboptimal accuracy in determining optimal DG placement and capacity.This study presents a comprehensive scientometric and systematic review of global research focused on computer-based modelling and algorithmic optimization for renewable DG sizing and placement.It integrates both quantitative and qualitative analyses of the scholarly landscape,mapping influential research domains,co-authorship structures,the articles’citation networks,keyword clusters,and international collaboration patterns.Moreover,the study classifies and evaluates the most prominent objective functions,key computational models and optimization algorithms,DG technologies,and strategic approaches employed in the field.The findings reveal that advanced algorithmic frameworks substantially enhance network stability,minimize real power losses,and improve voltage profiles under various operational constraints.This review serves as a foundational resource for researchers and practitioners,highlighting emerging algorithmic trends,modelling innovations,and data-driven methodologies that can guide future development of intelligent,optimization-based DG integration strategies in smart distribution systems.展开更多
Constrained multi-objective optimization problems(CMOPs) include the optimization of objective functions and the satisfaction of constraint conditions, which challenge the solvers.To solve CMOPs, constrained multi-obj...Constrained multi-objective optimization problems(CMOPs) include the optimization of objective functions and the satisfaction of constraint conditions, which challenge the solvers.To solve CMOPs, constrained multi-objective evolutionary algorithms(CMOEAs) have been developed. However, most of them tend to converge into local areas due to the loss of diversity. Evolutionary multitasking(EMT) is new model of solving complex optimization problems, through the knowledge transfer between the source task and other related tasks. Inspired by EMT, this paper develops a new EMT-based CMOEA to solve CMOPs, in which the main task, a global auxiliary task, and a local auxiliary task are created and optimized by one specific population respectively. The main task focuses on finding the feasible Pareto front(PF), and global and local auxiliary tasks are used to respectively enhance global and local diversity. Moreover, the global auxiliary task is used to implement the global search by ignoring constraints, so as to help the population of the main task pass through infeasible obstacles. The local auxiliary task is used to provide local diversity around the population of the main task, so as to exploit promising regions. Through the knowledge transfer among the three tasks, the search ability of the population of the main task will be significantly improved. Compared with other state-of-the-art CMOEAs, the experimental results on three benchmark test suites demonstrate the superior or competitive performance of the proposed CMOEA.展开更多
An efficient parallel global router using random optimization that is independent of net ordering is proposed.Parallel approaches are described and strategies guaranteeing the routing quality are discussed.The wire le...An efficient parallel global router using random optimization that is independent of net ordering is proposed.Parallel approaches are described and strategies guaranteeing the routing quality are discussed.The wire length model is implemented on multiprocessor,which enables the algorithm to approach feasibility of large scale problems.Timing driven model on multiprocessor and wire length model on distributed processors are also presented.The parallel algorithm greatly reduces the run time of routing.The experimental results show good speedups with no degradation of the routing quality.展开更多
Chaotic neural networks have global searching ability.But their applications are generally confined to combinatorial optimization to date.By introducing chaotic noise annealing process into conventional Hopfield netwo...Chaotic neural networks have global searching ability.But their applications are generally confined to combinatorial optimization to date.By introducing chaotic noise annealing process into conventional Hopfield network,this paper proposes a new chaotic annealing neural network (CANN) for global optimization of continuous constrained non linear programming.It is easy to implement,conceptually simple,and generally applicable.Numerical experiments on severe test functions manifest that CANN is efficient and reliable to search for global optimum and outperforms the existing genetic algorithm GAMAS for the same purpose.展开更多
Synthesis of chemical processes is of non-convex and multi-modal. Deterministic strategies often fail to find global optimum within reasonable time scales. Stochastic methodologies generally approach global solution i...Synthesis of chemical processes is of non-convex and multi-modal. Deterministic strategies often fail to find global optimum within reasonable time scales. Stochastic methodologies generally approach global solution in probability. In recogniting the state of art status in the discipline, a new approach for global optimization of processes, based on sequential number theoretic optimization (SNTO), is proposed. In this approach, subspaces and feasible points are derived from uniformly scattered points, and iterations over passing the corner of local optimum are enhanced via parallel strategy. The efficiency of the approach proposed is verified by results obtained from various case studies.展开更多
By combining properly the simulated annealing algorithm and the nonlinear programming neural network, a new hybrid method for comtrained global optimization is proposed in this paper. To maintain the applicability of ...By combining properly the simulated annealing algorithm and the nonlinear programming neural network, a new hybrid method for comtrained global optimization is proposed in this paper. To maintain the applicability of the simulated annealing algorithm used in the hybrid method as general as possible, the nonlinear programming neural network is employed at each iteration to find only a feasible solution to the original constrained problem rather than a local optimal solution. Such a feasible solution is obtained by solving an auxiliary optimization problem with a new objective function. The computational results for two numerical examples indicate that the proposed hybrid method for constrained global optimization is not only highly reliable but also much more effcient than the simulated annealing algorithm using the penalty function method to deal with the constraints.展开更多
A new meta-heuristic method is proposed to enhance current meta-heuristic methods for global optimization and test scheduling for three-dimensional （3D） stacked system-on-chip （SoC） by hybridizing grey wolf optimi...A new meta-heuristic method is proposed to enhance current meta-heuristic methods for global optimization and test scheduling for three-dimensional （3D） stacked system-on-chip （SoC） by hybridizing grey wolf optimization with differential evo- lution （HGWO）. Because basic grey wolf optimization （GWO） is easy to fall into stagnation when it carries out the operation of at- tacking prey, and differential evolution （DE） is integrated into GWO to update the previous best position of grey wolf Alpha, Beta and Delta, in order to force GWO to jump out of the stagnation with DE＇s strong searching ability. The proposed algorithm can accele- rate the convergence speed of GWO and improve its performance. Twenty-three well-known benchmark functions and an NP hard problem of test scheduling for 3D SoC are employed to verify the performance of the proposed algorithm. Experimental results show the superior performance of the proposed algorithm for exploiting the optimum and it has advantages in terms of exploration.展开更多
In this paper,we propose a three-term conjugate gradient method for solving unconstrained optimization problems based on the Hestenes-Stiefel(HS)conjugate gradient method and Polak-Ribiere-Polyak(PRP)conjugate gradien...In this paper,we propose a three-term conjugate gradient method for solving unconstrained optimization problems based on the Hestenes-Stiefel(HS)conjugate gradient method and Polak-Ribiere-Polyak(PRP)conjugate gradient method.Under the condition of standard Wolfe line search,the proposed search direction is the descent direction.For general nonlinear functions,the method is globally convergent.Finally,numerical results show that the proposed method is efficient.展开更多
High fidelity analysis are utilized in modern engineering design optimization problems which involve expensive black-box models.For computation-intensive engineering design problems,efficient global optimization metho...High fidelity analysis are utilized in modern engineering design optimization problems which involve expensive black-box models.For computation-intensive engineering design problems,efficient global optimization methods must be developed to relieve the computational burden.A new metamodel-based global optimization method using fuzzy clustering for design space reduction(MGO-FCR) is presented.The uniformly distributed initial sample points are generated by Latin hypercube design to construct the radial basis function metamodel,whose accuracy is improved with increasing number of sample points gradually.Fuzzy c-mean method and Gath-Geva clustering method are applied to divide the design space into several small interesting cluster spaces for low and high dimensional problems respectively.Modeling efficiency and accuracy are directly related to the design space,so unconcerned spaces are eliminated by the proposed reduction principle and two pseudo reduction algorithms.The reduction principle is developed to determine whether the current design space should be reduced and which space is eliminated.The first pseudo reduction algorithm improves the speed of clustering,while the second pseudo reduction algorithm ensures the design space to be reduced.Through several numerical benchmark functions,comparative studies with adaptive response surface method,approximated unimodal region elimination method and mode-pursuing sampling are carried out.The optimization results reveal that this method captures the real global optimum for all the numerical benchmark functions.And the number of function evaluations show that the efficiency of this method is favorable especially for high dimensional problems.Based on this global design optimization method,a design optimization of a lifting surface in high speed flow is carried out and this method saves about 10 h compared with genetic algorithms.This method possesses favorable performance on efficiency,robustness and capability of global convergence and gives a new optimization strategy for engineering design optimization problems involving expensive black box models.展开更多
An aerodynamic optimization method for axial flow compressor blades available for engineering is developed in this paper. Bezier surface is adopted as parameterization method to control the suction surface of the blad...An aerodynamic optimization method for axial flow compressor blades available for engineering is developed in this paper. Bezier surface is adopted as parameterization method to control the suction surface of the blades, which brings the following advantages:(A) significantly reducing design variables;(B) easy to ensure the mechanical strength of rotating blades;(C) better physical understanding;(D) easy to achieve smooth surface. The Improved Artificial Bee Colony(IABC) algorithm, which significantly increases the convergence speed and global optimization ability, is adopted to find the optimal result. A new engineering optimization tool is constructed by combining the surface parametric control method, the IABC algorithm, with a verified Computational Fluid Dynamics(CFD) simulation method, and it has been successfully applied in the aerodynamic optimization for a single-row transonic rotor(Rotor 37) and a single-stage transonic axialflow compressor(Stage 35). With the constraint that the relative change in the flow rate is less than0.5% and the total pressure ratio does not decrease, within the acceptable time in engineering, the adiabatic efficiency of Rotor 37 at design point increases by 1.02%, while its surge margin 0.84%,and the adiabatic efficiency of Stage 35 0.54%, while its surge margin 1.11% after optimization, to verify the effectiveness and potential in engineering of this new tool for optimization of axial compressor blade.展开更多
A novel heuristic search algorithm called seeker op- timization algorithm （SOA） is proposed for the real-parameter optimization. The proposed SOA is based on simulating the act of human searching. In the SOA, search...A novel heuristic search algorithm called seeker op- timization algorithm （SOA） is proposed for the real-parameter optimization. The proposed SOA is based on simulating the act of human searching. In the SOA, search direction is based on empir- ical gradients by evaluating the response to the position changes, while step length is based on uncertainty reasoning by using a simple fuzzy rule. The effectiveness of the SOA is evaluated by using a challenging set of typically complex functions in compari- son to differential evolution （DE） and three modified particle swarm optimization （PSO） algorithms. The simulation results show that the performance of the SOA is superior or comparable to that of the other algorithms.展开更多
The filled function method is an approach for finding a global minimum of multi-dimensional functions. With more and more relevant research, it becomes a promising way used in unconstrained global optimization. Some f...The filled function method is an approach for finding a global minimum of multi-dimensional functions. With more and more relevant research, it becomes a promising way used in unconstrained global optimization. Some filled functions with one or two parameters have already been suggested. However, there is no certain criterion to choose a parameter appropriately. In this paper, a parameter-free filled function was proposed. The definition of the original filled function and assumptions of the objective function given by Ge were improved according to the presented parameter-free filled function. The algorithm and numerical results of test functions were reported. Conclusions were drawn in the end. Key words global optimization - filled function method - local minimizer MSC 2000 90C30展开更多
Avoiding the folding defect and improving the die filling capability in the transitional region are desired in isothermal local loading forming of a large-scale Ti-alloy rib-web component（LTRC）. To achieve a high-pr...Avoiding the folding defect and improving the die filling capability in the transitional region are desired in isothermal local loading forming of a large-scale Ti-alloy rib-web component（LTRC）. To achieve a high-precision LTRC, the folding evolution and die filling process in the transitional region were investigated by 3 D finite element simulation and experiment using an equal-thickness billet（ETB）. It is found that the initial volume distribution in the second-loading region can greatly affect the amount of material transferred into the first-loading region during the second-loading step, and thus lead to the folding defect. Besides, an improper initial volume distribution results in non-concurrent die filling in the cavities of ribs after the second-loading step, and then causes die underfilling. To this end, an unequal-thickness billet（UTB） was employed with the initial volume distribution optimized by the response surface method（RSM）. For a certain eigenstructure, the critical value of the percentage of transferred material determined by the ETB was taken as a constraint condition for avoiding the folding defect in the UTB optimization process,and the die underfilling rate was considered as the optimization objective. Then, based on the RSM models of the percentage of transferred material and the die underfilling rate, non-folding parameter combinations and optimum die filling were achieved. Lastly, an optimized UTB was obtained and verified by the simulation and experiment.展开更多
In this paper, an improved algorithm is proposed for unconstrained global optimization to tackle non-convex nonlinear multivariate polynomial programming problems. The proposed algorithm is based on the Bernstein poly...In this paper, an improved algorithm is proposed for unconstrained global optimization to tackle non-convex nonlinear multivariate polynomial programming problems. The proposed algorithm is based on the Bernstein polynomial approach. Novel features of the proposed algorithm are that it uses a new rule for the selection of the subdivision point, modified rules for the selection of the subdivision direction, and a new acceleration device to avoid some unnecessary subdivisions. The performance of the proposed algorithm is numerically tested on a collection of 16 test problems. The results of the tests show the proposed algorithm to be superior to the existing Bernstein algorithm in terms of the chosen performance metrics.展开更多
High fidelity analysis models,which are beneficial to improving the design quality,have been more and more widely utilized in the modern engineering design optimization problems.However,the high fidelity analysis mode...High fidelity analysis models,which are beneficial to improving the design quality,have been more and more widely utilized in the modern engineering design optimization problems.However,the high fidelity analysis models are so computationally expensive that the time required in design optimization is usually unacceptable.In order to improve the efficiency of optimization involving high fidelity analysis models,the optimization efficiency can be upgraded through applying surrogates to approximate the computationally expensive models,which can greately reduce the computation time.An efficient heuristic global optimization method using adaptive radial basis function（RBF） based on fuzzy clustering（ARFC） is proposed.In this method,a novel algorithm of maximin Latin hypercube design using successive local enumeration（SLE） is employed to obtain sample points with good performance in both space-filling and projective uniformity properties,which does a great deal of good to metamodels accuracy.RBF method is adopted for constructing the metamodels,and with the increasing the number of sample points the approximation accuracy of RBF is gradually enhanced.The fuzzy c-means clustering method is applied to identify the reduced attractive regions in the original design space.The numerical benchmark examples are used for validating the performance of ARFC.The results demonstrates that for most application examples the global optima are effectively obtained and comparison with adaptive response surface method（ARSM） proves that the proposed method can intuitively capture promising design regions and can efficiently identify the global or near-global design optimum.This method improves the efficiency and global convergence of the optimization problems,and gives a new optimization strategy for engineering design optimization problems involving computationally expensive models.展开更多
基金Supported by the National Natural Science Foundation of China(12071133)Natural Science Foundation of Henan Province(252300421993)Key Scientific Research Project of Higher Education Institutions in Henan Province(25B110005)。
文摘In this paper,an adaptive cubic regularisation algorithm based on affine scaling methods(ARCBASM)is proposed for solving nonlinear equality constrained programming with nonnegative constraints on variables.From the optimality conditions of the problem,we introduce appropriate affine matrix and construct an affine scaling ARC subproblem with linearized constraints.Composite step methods and reduced Hessian methods are applied to tackle the linearized constraints.As a result,a standard unconstrained ARC subproblem is deduced and its solution can supply sufficient decrease.The fraction to the boundary rule maintains the strict feasibility(for nonnegative constraints on variables)of every iteration point.Reflection techniques are employed to prevent the iterations from approaching zero too early.Under mild assumptions,global convergence of the algorithm is analysed.Preliminary numerical results are reported.
基金supported by the Science and Technology Research Project of Henan Province(242102241055)the Industry-University-Research Collaborative Innovation Base on Automobile Lightweight of“Science and Technology Innovation in Central Plains”(2024KCZY315)the Opening Fund of State Key Laboratory of Structural Analysis,Optimization and CAE Software for Industrial Equipment(GZ2024A03-ZZU).
文摘The moving morphable component(MMC)topology optimization method,as a typical explicit topology optimization method,has been widely concerned.In the MMC topology optimization framework,the surrogate material model is mainly used for finite element analysis at present,and the effectiveness of the surrogate material model has been fully confirmed.However,there are some accuracy problems when dealing with boundary elements using the surrogate material model,which will affect the topology optimization results.In this study,a boundary element reconstruction(BER)model is proposed based on the surrogate material model under the MMC topology optimization framework to improve the accuracy of topology optimization.The proposed BER model can reconstruct the boundary elements by refining the local meshes and obtaining new nodes in boundary elements.Then the density of boundary elements is recalculated using the new node information,which is more accurate than the original model.Based on the new density of boundary elements,the material properties and volume information of the boundary elements are updated.Compared with other finite element analysis methods,the BER model is simple and feasible and can improve computational accuracy.Finally,the effectiveness and superiority of the proposed method are verified by comparing it with the optimization results of the original surrogate material model through several numerical examples.
基金co-supported by National Natural Science Foundation of China (Nos. 51975124 and 51675179)Aerospace Science and Technology Fund of China (No.AERO201937)Research Start-up Funding of Fudan University (No. FDU38341)。
文摘Landing gear lower drag stay is a key component which connects fuselage and landing gear and directly effects the safety and performance of aircraft takeoff and landing. To effectively design the lower drag stay and reduce the weight of landing gear, Global/local Linked Driven Optimization Strategy(GLDOS) was developed to conduct the overall process design of lower drag stay in respect of optimization thought. The whole-process optimization involves two stages of structural conceptual design and detailed design. In the structural conceptual design, the landing gear lower drag stay was globally topologically optimized by adopting multiple starting points algorithm. In the detailed design, the local size and shape of landing gear lower drag stay were globally optimized by the gradient optimization strategy. The GLDOS method adopts different optimization strategies for different optimization stages to acquire the optimum design effect. Through the experimental validation, the weight of the optimized lower dray stay with the developed GLDOS is reduced by 16.79% while keeping enough strength and stiffness, which satisfies the requirements of engineering design under the typical loading conditions. The proposed GLDOS is validated to be accurate and efficient in optimization scheme and design cycles. The efforts of this paper provide a whole-process optimization approach regarding different optimization technologies in different design phases, which is significant in reducing structural weight and enhance design tp wid 1 precision for complex structures in aircrafts.
基金funded by National Natural Science Foundation of China(grant No.52405255)Special Program of Huzhou(grant No.2023GZ05)+1 种基金Projects of Huzhou Science and Technology Correspondent(grant No.2023KT76)Guangdong Basic and Applied Basic Research Foundation(grant No.2025A1515010487)。
文摘Variable-fidelity(VF)surrogate models have received increasing attention in engineering design optimization as they can approximate expensive high-fidelity(HF)simulations with reduced computational power.A key challenge to building a VF model is devising an adaptive model updating strategy that jointly selects additional low-fidelity(LF)and/or HF samples.The additional samples must enhance the model accuracy while maximizing the computational efficiency.We propose ISMA-VFEEI,a global optimization framework that integrates an Improved Slime-Mould Algorithm(ISMA)and a Variable-Fidelity Expected Extension Improvement(VFEEI)learning function to construct a VF surrogate model efficiently.First,A cost-aware VFEEI function guides the adaptive LF/HF sampling by explicitly incorporating evaluation cost and existing sample proximity.Second,ISMA is employed to solve the resulting non-convex optimization problem and identify global optimal infill points for model enhancement.The efficacy of ISMA-VFEEI is demonstrated through six numerical benchmarks and one real-world engineering case study.The engineering case study of a high-speed railway Electric Multiple Unit(EMU),the optimization objective of a sanding device attained a minimum value of 1.546 using only 20 HF evaluations,outperforming all the compared methods.
基金supported and funded by the Deanship of Scientific Research at Imam Mohammad Ibn Saud Islamic University(IMSIU)(grant number:IMSIU-DDRSP2503)。
文摘Optimal sizing and allocation of distributed generators(DGs)have become essential computational challenges in improving the performance,efficiency,and reliability of electrical distribution networks.Despite extensive research,existing approaches often face algorithmic limitations such as slow convergence,premature stagnation in local minima,or suboptimal accuracy in determining optimal DG placement and capacity.This study presents a comprehensive scientometric and systematic review of global research focused on computer-based modelling and algorithmic optimization for renewable DG sizing and placement.It integrates both quantitative and qualitative analyses of the scholarly landscape,mapping influential research domains,co-authorship structures,the articles’citation networks,keyword clusters,and international collaboration patterns.Moreover,the study classifies and evaluates the most prominent objective functions,key computational models and optimization algorithms,DG technologies,and strategic approaches employed in the field.The findings reveal that advanced algorithmic frameworks substantially enhance network stability,minimize real power losses,and improve voltage profiles under various operational constraints.This review serves as a foundational resource for researchers and practitioners,highlighting emerging algorithmic trends,modelling innovations,and data-driven methodologies that can guide future development of intelligent,optimization-based DG integration strategies in smart distribution systems.
基金supported in part by the National Natural Science Fund for Outstanding Young Scholars of China (61922072)the National Natural Science Foundation of China (62176238, 61806179, 61876169, 61976237)+2 种基金China Postdoctoral Science Foundation (2020M682347)the Training Program of Young Backbone Teachers in Colleges and Universities in Henan Province (2020GGJS006)Henan Provincial Young Talents Lifting Project (2021HYTP007)。
文摘Constrained multi-objective optimization problems(CMOPs) include the optimization of objective functions and the satisfaction of constraint conditions, which challenge the solvers.To solve CMOPs, constrained multi-objective evolutionary algorithms(CMOEAs) have been developed. However, most of them tend to converge into local areas due to the loss of diversity. Evolutionary multitasking(EMT) is new model of solving complex optimization problems, through the knowledge transfer between the source task and other related tasks. Inspired by EMT, this paper develops a new EMT-based CMOEA to solve CMOPs, in which the main task, a global auxiliary task, and a local auxiliary task are created and optimized by one specific population respectively. The main task focuses on finding the feasible Pareto front(PF), and global and local auxiliary tasks are used to respectively enhance global and local diversity. Moreover, the global auxiliary task is used to implement the global search by ignoring constraints, so as to help the population of the main task pass through infeasible obstacles. The local auxiliary task is used to provide local diversity around the population of the main task, so as to exploit promising regions. Through the knowledge transfer among the three tasks, the search ability of the population of the main task will be significantly improved. Compared with other state-of-the-art CMOEAs, the experimental results on three benchmark test suites demonstrate the superior or competitive performance of the proposed CMOEA.
文摘An efficient parallel global router using random optimization that is independent of net ordering is proposed.Parallel approaches are described and strategies guaranteeing the routing quality are discussed.The wire length model is implemented on multiprocessor,which enables the algorithm to approach feasibility of large scale problems.Timing driven model on multiprocessor and wire length model on distributed processors are also presented.The parallel algorithm greatly reduces the run time of routing.The experimental results show good speedups with no degradation of the routing quality.
基金the National Natural Science Foundation of China(No.79970 0 4 2 )
文摘Chaotic neural networks have global searching ability.But their applications are generally confined to combinatorial optimization to date.By introducing chaotic noise annealing process into conventional Hopfield network,this paper proposes a new chaotic annealing neural network (CANN) for global optimization of continuous constrained non linear programming.It is easy to implement,conceptually simple,and generally applicable.Numerical experiments on severe test functions manifest that CANN is efficient and reliable to search for global optimum and outperforms the existing genetic algorithm GAMAS for the same purpose.
文摘Synthesis of chemical processes is of non-convex and multi-modal. Deterministic strategies often fail to find global optimum within reasonable time scales. Stochastic methodologies generally approach global solution in probability. In recogniting the state of art status in the discipline, a new approach for global optimization of processes, based on sequential number theoretic optimization (SNTO), is proposed. In this approach, subspaces and feasible points are derived from uniformly scattered points, and iterations over passing the corner of local optimum are enhanced via parallel strategy. The efficiency of the approach proposed is verified by results obtained from various case studies.
文摘By combining properly the simulated annealing algorithm and the nonlinear programming neural network, a new hybrid method for comtrained global optimization is proposed in this paper. To maintain the applicability of the simulated annealing algorithm used in the hybrid method as general as possible, the nonlinear programming neural network is employed at each iteration to find only a feasible solution to the original constrained problem rather than a local optimal solution. Such a feasible solution is obtained by solving an auxiliary optimization problem with a new objective function. The computational results for two numerical examples indicate that the proposed hybrid method for constrained global optimization is not only highly reliable but also much more effcient than the simulated annealing algorithm using the penalty function method to deal with the constraints.
基金supported by the National Natural Science Foundation of China(6076600161105004)+1 种基金the Guangxi Key Laboratory of Automatic Detecting Technology and Instruments(YQ14110)the Program for Innovative Research Team of Guilin University of Electronic Technology(IRTGUET)
文摘A new meta-heuristic method is proposed to enhance current meta-heuristic methods for global optimization and test scheduling for three-dimensional （3D） stacked system-on-chip （SoC） by hybridizing grey wolf optimization with differential evo- lution （HGWO）. Because basic grey wolf optimization （GWO） is easy to fall into stagnation when it carries out the operation of at- tacking prey, and differential evolution （DE） is integrated into GWO to update the previous best position of grey wolf Alpha, Beta and Delta, in order to force GWO to jump out of the stagnation with DE＇s strong searching ability. The proposed algorithm can accele- rate the convergence speed of GWO and improve its performance. Twenty-three well-known benchmark functions and an NP hard problem of test scheduling for 3D SoC are employed to verify the performance of the proposed algorithm. Experimental results show the superior performance of the proposed algorithm for exploiting the optimum and it has advantages in terms of exploration.
基金Supported by the Science and Technology Project of Guangxi(Guike AD23023002)。
文摘In this paper,we propose a three-term conjugate gradient method for solving unconstrained optimization problems based on the Hestenes-Stiefel(HS)conjugate gradient method and Polak-Ribiere-Polyak(PRP)conjugate gradient method.Under the condition of standard Wolfe line search,the proposed search direction is the descent direction.For general nonlinear functions,the method is globally convergent.Finally,numerical results show that the proposed method is efficient.
基金supported by National Natural Science Foundation of China(Grant No.51105040)Aeronautic Science Foundation of China(Grant No.2011ZA72003)Excellent Young Scholars Research Fund of Beijing Institute of Technology(Grant No.2010Y0102)
文摘High fidelity analysis are utilized in modern engineering design optimization problems which involve expensive black-box models.For computation-intensive engineering design problems,efficient global optimization methods must be developed to relieve the computational burden.A new metamodel-based global optimization method using fuzzy clustering for design space reduction(MGO-FCR) is presented.The uniformly distributed initial sample points are generated by Latin hypercube design to construct the radial basis function metamodel,whose accuracy is improved with increasing number of sample points gradually.Fuzzy c-mean method and Gath-Geva clustering method are applied to divide the design space into several small interesting cluster spaces for low and high dimensional problems respectively.Modeling efficiency and accuracy are directly related to the design space,so unconcerned spaces are eliminated by the proposed reduction principle and two pseudo reduction algorithms.The reduction principle is developed to determine whether the current design space should be reduced and which space is eliminated.The first pseudo reduction algorithm improves the speed of clustering,while the second pseudo reduction algorithm ensures the design space to be reduced.Through several numerical benchmark functions,comparative studies with adaptive response surface method,approximated unimodal region elimination method and mode-pursuing sampling are carried out.The optimization results reveal that this method captures the real global optimum for all the numerical benchmark functions.And the number of function evaluations show that the efficiency of this method is favorable especially for high dimensional problems.Based on this global design optimization method,a design optimization of a lifting surface in high speed flow is carried out and this method saves about 10 h compared with genetic algorithms.This method possesses favorable performance on efficiency,robustness and capability of global convergence and gives a new optimization strategy for engineering design optimization problems involving expensive black box models.
基金supported by the National Natural Science Foundation of China(No.51576007)Civil Aircraft Special Research of China(No.MJZ-016-D-30)
文摘An aerodynamic optimization method for axial flow compressor blades available for engineering is developed in this paper. Bezier surface is adopted as parameterization method to control the suction surface of the blades, which brings the following advantages:(A) significantly reducing design variables;(B) easy to ensure the mechanical strength of rotating blades;(C) better physical understanding;(D) easy to achieve smooth surface. The Improved Artificial Bee Colony(IABC) algorithm, which significantly increases the convergence speed and global optimization ability, is adopted to find the optimal result. A new engineering optimization tool is constructed by combining the surface parametric control method, the IABC algorithm, with a verified Computational Fluid Dynamics(CFD) simulation method, and it has been successfully applied in the aerodynamic optimization for a single-row transonic rotor(Rotor 37) and a single-stage transonic axialflow compressor(Stage 35). With the constraint that the relative change in the flow rate is less than0.5% and the total pressure ratio does not decrease, within the acceptable time in engineering, the adiabatic efficiency of Rotor 37 at design point increases by 1.02%, while its surge margin 0.84%,and the adiabatic efficiency of Stage 35 0.54%, while its surge margin 1.11% after optimization, to verify the effectiveness and potential in engineering of this new tool for optimization of axial compressor blade.
基金supported by the National Natural Science Foundation of China(60870004)
文摘A novel heuristic search algorithm called seeker op- timization algorithm （SOA） is proposed for the real-parameter optimization. The proposed SOA is based on simulating the act of human searching. In the SOA, search direction is based on empir- ical gradients by evaluating the response to the position changes, while step length is based on uncertainty reasoning by using a simple fuzzy rule. The effectiveness of the SOA is evaluated by using a challenging set of typically complex functions in compari- son to differential evolution （DE） and three modified particle swarm optimization （PSO） algorithms. The simulation results show that the performance of the SOA is superior or comparable to that of the other algorithms.
文摘The filled function method is an approach for finding a global minimum of multi-dimensional functions. With more and more relevant research, it becomes a promising way used in unconstrained global optimization. Some filled functions with one or two parameters have already been suggested. However, there is no certain criterion to choose a parameter appropriately. In this paper, a parameter-free filled function was proposed. The definition of the original filled function and assumptions of the objective function given by Ge were improved according to the presented parameter-free filled function. The algorithm and numerical results of test functions were reported. Conclusions were drawn in the end. Key words global optimization - filled function method - local minimizer MSC 2000 90C30
基金supports of the National Natural Science Foundation of China (No. 51575449)Research Fund of the State Key Laboratory of Solidification Processing (NWPU) of China (No. 104-QP2014)+1 种基金the 111 Project (No. B08040)the Fundamental Research Funds for the Central Universities (3102015AX004)
文摘Avoiding the folding defect and improving the die filling capability in the transitional region are desired in isothermal local loading forming of a large-scale Ti-alloy rib-web component（LTRC）. To achieve a high-precision LTRC, the folding evolution and die filling process in the transitional region were investigated by 3 D finite element simulation and experiment using an equal-thickness billet（ETB）. It is found that the initial volume distribution in the second-loading region can greatly affect the amount of material transferred into the first-loading region during the second-loading step, and thus lead to the folding defect. Besides, an improper initial volume distribution results in non-concurrent die filling in the cavities of ribs after the second-loading step, and then causes die underfilling. To this end, an unequal-thickness billet（UTB） was employed with the initial volume distribution optimized by the response surface method（RSM）. For a certain eigenstructure, the critical value of the percentage of transferred material determined by the ETB was taken as a constraint condition for avoiding the folding defect in the UTB optimization process,and the die underfilling rate was considered as the optimization objective. Then, based on the RSM models of the percentage of transferred material and the die underfilling rate, non-folding parameter combinations and optimum die filling were achieved. Lastly, an optimized UTB was obtained and verified by the simulation and experiment.
文摘In this paper, an improved algorithm is proposed for unconstrained global optimization to tackle non-convex nonlinear multivariate polynomial programming problems. The proposed algorithm is based on the Bernstein polynomial approach. Novel features of the proposed algorithm are that it uses a new rule for the selection of the subdivision point, modified rules for the selection of the subdivision direction, and a new acceleration device to avoid some unnecessary subdivisions. The performance of the proposed algorithm is numerically tested on a collection of 16 test problems. The results of the tests show the proposed algorithm to be superior to the existing Bernstein algorithm in terms of the chosen performance metrics.
基金supported by National Natural Science Foundation of China (Grant Nos. 50875024,51105040)Excellent Young Scholars Research Fund of Beijing Institute of Technology,China (Grant No.2010Y0102)Defense Creative Research Group Foundation of China(Grant No. GFTD0803)
文摘High fidelity analysis models,which are beneficial to improving the design quality,have been more and more widely utilized in the modern engineering design optimization problems.However,the high fidelity analysis models are so computationally expensive that the time required in design optimization is usually unacceptable.In order to improve the efficiency of optimization involving high fidelity analysis models,the optimization efficiency can be upgraded through applying surrogates to approximate the computationally expensive models,which can greately reduce the computation time.An efficient heuristic global optimization method using adaptive radial basis function（RBF） based on fuzzy clustering（ARFC） is proposed.In this method,a novel algorithm of maximin Latin hypercube design using successive local enumeration（SLE） is employed to obtain sample points with good performance in both space-filling and projective uniformity properties,which does a great deal of good to metamodels accuracy.RBF method is adopted for constructing the metamodels,and with the increasing the number of sample points the approximation accuracy of RBF is gradually enhanced.The fuzzy c-means clustering method is applied to identify the reduced attractive regions in the original design space.The numerical benchmark examples are used for validating the performance of ARFC.The results demonstrates that for most application examples the global optima are effectively obtained and comparison with adaptive response surface method（ARSM） proves that the proposed method can intuitively capture promising design regions and can efficiently identify the global or near-global design optimum.This method improves the efficiency and global convergence of the optimization problems,and gives a new optimization strategy for engineering design optimization problems involving computationally expensive models.
