Formalizing complex processes and phenomena of a real-world problem may require a large number of variables and constraints,resulting in what is termed a large-scale optimization problem.Nowadays,such large-scale opti...Formalizing complex processes and phenomena of a real-world problem may require a large number of variables and constraints,resulting in what is termed a large-scale optimization problem.Nowadays,such large-scale optimization problems are solved using computing machines,leading to an enormous computational time being required,which may delay deriving timely solutions.Decomposition methods,which partition a large-scale optimization problem into lower-dimensional subproblems,represent a key approach to addressing time-efficiency issues.There has been significant progress in both applied mathematics and emerging artificial intelligence approaches on this front.This work aims at providing an overview of the decomposition methods from both the mathematics and computer science points of view.We also remark on the state-of-the-art developments and recent applications of the decomposition methods,and discuss the future research and development perspectives.展开更多
As optimization problems continue to grow in complexity,the need for effective metaheuristic algorithms becomes increasingly evident.However,the challenge lies in identifying the right parameters and strategies for th...As optimization problems continue to grow in complexity,the need for effective metaheuristic algorithms becomes increasingly evident.However,the challenge lies in identifying the right parameters and strategies for these algorithms.In this paper,we introduce the adaptive multi-strategy Rabbit Algorithm(RA).RA is inspired by the social interactions of rabbits,incorporating elements such as exploration,exploitation,and adaptation to address optimization challenges.It employs three distinct subgroups,comprising male,female,and child rabbits,to execute a multi-strategy search.Key parameters,including distance factor,balance factor,and learning factor,strike a balance between precision and computational efficiency.We offer practical recommendations for fine-tuning five essential RA parameters,making them versatile and independent.RA is capable of autonomously selecting adaptive parameter settings and mutation strategies,enabling it to successfully tackle a range of 17 CEC05 benchmark functions with dimensions scaling up to 5000.The results underscore RA’s superior performance in large-scale optimization tasks,surpassing other state-of-the-art metaheuristics in convergence speed,computational precision,and scalability.Finally,RA has demonstrated its proficiency in solving complicated optimization problems in real-world engineering by completing 10 problems in CEC2020.展开更多
To solve large-scale optimization problems,Fragrance coefficient and variant Particle Swarm local search Butterfly Optimization Algorithm(FPSBOA)is proposed.In the position update stage of Butterfly Optimization Algor...To solve large-scale optimization problems,Fragrance coefficient and variant Particle Swarm local search Butterfly Optimization Algorithm(FPSBOA)is proposed.In the position update stage of Butterfly Optimization Algorithm(BOA),the fragrance coefficient is designed to balance the exploration and exploitation of BOA.The variant particle swarm local search strategy is proposed to improve the local search ability of the current optimal butterfly and prevent the algorithm from falling into local optimality.192000-dimensional functions and 201000-dimensional CEC 2010 large-scale functions are used to verify FPSBOA for complex large-scale optimization problems.The experimental results are statistically analyzed by Friedman test and Wilcoxon rank-sum test.All attained results demonstrated that FPSBOA can better solve more challenging scientific and industrial real-world problems with thousands of variables.Finally,four mechanical engineering problems and one ten-dimensional process synthesis and design problem are applied to FPSBOA,which shows FPSBOA has the feasibility and effectiveness in real-world application problems.展开更多
With the increasing size of optimization problems in various scientific and engineering fields,finding promising solutions for these large-scale optimization problems has become increasingly challenging.Dimension redu...With the increasing size of optimization problems in various scientific and engineering fields,finding promising solutions for these large-scale optimization problems has become increasingly challenging.Dimension reduction-based evolutionary algorithms have emerged as one of the most efficient approaches to tackle these challenges.However,they still face difficulties in constructing appropriate subspaces and preserving the global optimum within those subspaces.To overcome these challenges,a multiform optimization framework with scale-adaptive subspace,called MFO-SAS,is proposed for large-scale optimization by taking full advantage of the subspace-assisted and multitasking mechanisms.To address the first challenge,a scale-adaptive switch strategy is designed to switch the subspaces with different scales at different optimization stages,enabling efficient assistance of the optimization processes for the original problem with appropriate subspaces.To tackle the second challenge,a multiform optimization paradigm is adopted to conduct the simultaneous search over both the original problem space and the constructed subspaces in a multitasking scenario,thus facilitating the utilization of the search experiences from different problem spaces.Consequently,the MFO-SAS framework effectively leverages valuable knowledge obtained from different spaces to guide the search and dynamically balances the representation accuracy of the subspace with the computational cost of subspace search.Experimental results on the large-scale benchmark problems demonstrate the superiority of MFO-SAS over several state-of-the-art algorithms.展开更多
Expensive multiobjective optimization problems(EMOPs)are complex optimization problems exacted from realworld applications,where each objective function evaluation(FE)involves expensive computations or physical experi...Expensive multiobjective optimization problems(EMOPs)are complex optimization problems exacted from realworld applications,where each objective function evaluation(FE)involves expensive computations or physical experiments.Many surrogate-assisted evolutionary algorithms(SAEAs)have been designed to solve EMOPs.Nevertheless,EMOPs with large-scale decision variables remain challenging for existing SAEAs,leading to difficulties in maintaining convergence and diversity.To address this deficiency,we proposed a variable reconstructionbased SAEA(VREA)to balance convergence enhancement and diversity maintenance.Generally,a cluster-based variable reconstruction strategy reconstructs the original large-scale decision variables into low-dimensional weight variables.Thus,the population can be rapidly pushed towards the Pareto set(PS)by optimizing low-dimensional weight variables with the assistance of surrogate models.Population diversity is improved due to the cluster-based variable reconstruction strategy.An adaptive search step size strategy is proposed to balance exploration and exploitation further.Experimental comparisons with four state-of-the-art SAEAs are conducted on benchmark EMOPs with up to 1000 decision variables and an aerodynamic design task.Experimental results demonstrate that VREA obtains well-converged and diverse solutions with limited real FEs.展开更多
The research on optimization methods for constellation launch deployment strategies focused on the consideration of mission interval time constraints at the launch site.Firstly,a dynamic modeling of the constellation ...The research on optimization methods for constellation launch deployment strategies focused on the consideration of mission interval time constraints at the launch site.Firstly,a dynamic modeling of the constellation deployment process was established,and the relationship between the deployment window and the phase difference of the orbit insertion point,as well as the cost of phase adjustment after orbit insertion,was derived.Then,the combination of the constellation deployment position sequence was treated as a parameter,together with the sequence of satellite deployment intervals,as optimization variables,simplifying a highdimensional search problem within a wide range of dates to a finite-dimensional integer programming problem.An improved genetic algorithm with local search on deployment dates was introduced to optimize the launch deployment strategy.With the new description of the optimization variables,the total number of elements in the solution space was reduced by N orders of magnitude.Numerical simulation confirms that the proposed optimization method accelerates the convergence speed from hours to minutes.展开更多
The construction of island power grids is a systematic engineering task.To ensure the safe operation of power grid systems,optimizing the line layout of island power grids is crucial.Especially in the current context ...The construction of island power grids is a systematic engineering task.To ensure the safe operation of power grid systems,optimizing the line layout of island power grids is crucial.Especially in the current context of large-scale distributed renewable energy integration into the power grid,conventional island power grid line layouts can no longer meet actual demands.It is necessary to combine the operational characteristics of island power systems and historical load data to perform load forecasting,thereby generating power grid line layout paths.This article focuses on large-scale distributed renewable energy integration,summarizing optimization strategies for island power grid line layouts,and providing a solid guarantee for the safe and stable operation of island power systems.展开更多
As power systems expand,solving the unit commitment problem(UCP)becomes increasingly challenging due to the curse of dimensionality,and traditional methods often struggle to balance computational efficiency and soluti...As power systems expand,solving the unit commitment problem(UCP)becomes increasingly challenging due to the curse of dimensionality,and traditional methods often struggle to balance computational efficiency and solution optimality.To tackle this issue,we propose a problem-structure-informed quantum approximate optimization algorithm(QAOA)framework that fully exploits the quantum advantage under extremely limited quantum resources.Specifically,we leverage the inherent topological structure of power systems to decompose large-scale UCP instances into smaller subproblems,which are solvable in parallel by limited number of qubits.This decomposition not only circumvents the current hardware limitations of quantum computing but also achieves higher performance as the graph structure of the power system becomes more sparse.Consequently,our approach can be extended to future power systems that are larger and more complex.展开更多
A major bottleneck in large-scale eigenfrequency topology optimization is the repeated solution of the generalized eigenvalue problem.This work presents an efficient graphics processing unit(GPU)solver for threedimens...A major bottleneck in large-scale eigenfrequency topology optimization is the repeated solution of the generalized eigenvalue problem.This work presents an efficient graphics processing unit(GPU)solver for threedimensional(3D)topology optimization that maximizes the fundamental eigenfrequency.The Successive Iteration of Analysis and Design(SIAD)framework is employed to avoid solving a full eigenproblem at every iteration.The sequential approximation of the eigenpairs is solved by the GPU-accelerated multigrid-preconditioned conjugate gradient(MGPCG)method to efficiently improve the eigenvectors along with the topological evolution.The cluster-mean approach is adopted to address the non-differentiability issue caused by repeated eigenfrequencies.The corresponding sensitivity analysis method is provided.The parallelized gradient-based Zhang-Paulino-Ramos Jr.(ZPR)algorithm is employed to update the design variables.The effectiveness of the proposed solver is demonstrated through two large-scale numerical examples.The first example demonstrates the accuracy,efficiency,and scalability of the proposed solver by solving a 3D optimization problem of 50.33 million elements being solved in approximately 15.2 h over 300 iterations on a single NVIDIA Tesla V100 GPU.The second example validates the effectiveness of the proposed solver in the presence of repeated eigenfrequencies.Our findings also highlight that higher-resolution models produce distinct optimized structures with higher fundamental frequencies,underscoring the necessity of large-scale topology optimization.展开更多
Traditional large-scale multi-objective optimization algorithms(LSMOEAs)encounter difficulties when dealing with sparse large-scale multi-objective optimization problems(SLM-OPs)where most decision variables are zero....Traditional large-scale multi-objective optimization algorithms(LSMOEAs)encounter difficulties when dealing with sparse large-scale multi-objective optimization problems(SLM-OPs)where most decision variables are zero.As a result,many algorithms use a two-layer encoding approach to optimize binary variable Mask and real variable Dec separately.Nevertheless,existing optimizers often focus on locating non-zero variable posi-tions to optimize the binary variables Mask.However,approxi-mating the sparse distribution of real Pareto optimal solutions does not necessarily mean that the objective function is optimized.In data mining,it is common to mine frequent itemsets appear-ing together in a dataset to reveal the correlation between data.Inspired by this,we propose a novel two-layer encoding learning swarm optimizer based on frequent itemsets(TELSO)to address these SLMOPs.TELSO mined the frequent terms of multiple particles with better target values to find mask combinations that can obtain better objective values for fast convergence.Experi-mental results on five real-world problems and eight benchmark sets demonstrate that TELSO outperforms existing state-of-the-art sparse large-scale multi-objective evolutionary algorithms(SLMOEAs)in terms of performance and convergence speed.展开更多
The performance of analytical derivative and sparse matrix techniques applied to a traditional dense sequential quadratic programming (SQP) is studied, and the strategy utilizing those techniques is also presented.Com...The performance of analytical derivative and sparse matrix techniques applied to a traditional dense sequential quadratic programming (SQP) is studied, and the strategy utilizing those techniques is also presented.Computational results on two typical chemical optimization problems demonstrate significant enhancement in efficiency, which shows this strategy is promising and suitable for large-scale process optimization problems.展开更多
Sparse large-scale multi-objective optimization problems(SLMOPs)are common in science and engineering.However,the large-scale problem represents the high dimensionality of the decision space,requiring algorithms to tr...Sparse large-scale multi-objective optimization problems(SLMOPs)are common in science and engineering.However,the large-scale problem represents the high dimensionality of the decision space,requiring algorithms to traverse vast expanse with limited computational resources.Furthermore,in the context of sparse,most variables in Pareto optimal solutions are zero,making it difficult for algorithms to identify non-zero variables efficiently.This paper is dedicated to addressing the challenges posed by SLMOPs.To start,we introduce innovative objective functions customized to mine maximum and minimum candidate sets.This substantial enhancement dramatically improves the efficacy of frequent pattern mining.In this way,selecting candidate sets is no longer based on the quantity of nonzero variables they contain but on a higher proportion of nonzero variables within specific dimensions.Additionally,we unveil a novel approach to association rule mining,which delves into the intricate relationships between non-zero variables.This novel methodology aids in identifying sparse distributions that can potentially expedite reductions in the objective function value.We extensively tested our algorithm across eight benchmark problems and four real-world SLMOPs.The results demonstrate that our approach achieves competitive solutions across various challenges.展开更多
During the last three decades,evolutionary algorithms(EAs)have shown superiority in solving complex optimization problems,especially those with multiple objectives and non-differentiable landscapes.However,due to the ...During the last three decades,evolutionary algorithms(EAs)have shown superiority in solving complex optimization problems,especially those with multiple objectives and non-differentiable landscapes.However,due to the stochastic search strategies,the performance of most EAs deteriorates drastically when handling a large number of decision variables.To tackle the curse of dimensionality,this work proposes an efficient EA for solving super-large-scale multi-objective optimization problems with sparse optimal solutions.The proposed algorithm estimates the sparse distribution of optimal solutions by optimizing a binary vector for each solution,and provides a fast clustering method to highly reduce the dimensionality of the search space.More importantly,all the operations related to the decision variables only contain several matrix calculations,which can be directly accelerated by GPUs.While existing EAs are capable of handling fewer than 10000 real variables,the proposed algorithm is verified to be effective in handling 1000000 real variables.Furthermore,since the proposed algorithm handles the large number of variables via accelerated matrix calculations,its runtime can be reduced to less than 10%of the runtime of existing EAs.展开更多
Among various architectures of polymers,end-group-free rings have attracted growing interests due to their distinct physicochemical performances over the linear counterparts which are exemplified by reduced hydrodynam...Among various architectures of polymers,end-group-free rings have attracted growing interests due to their distinct physicochemical performances over the linear counterparts which are exemplified by reduced hydrodynamic size and slower degradation.It is key to develop facile methods to large-scale synthesis of polymer rings with tunable compositions and microstructures.Recent progresses in large-scale synthesis of polymer rings against single-chain dynamic nanoparticles,and the example applications in synchronous enhancing toughness and strength of polymer nanocomposites are summarized.Once there is the breakthrough in rational design and effective large-scale synthesis of polymer rings and their functional derivatives,a family of cyclic functional hybrids would be available,thus providing a new paradigm in developing polymer science and engineering.展开更多
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.展开更多
A new limited memory symmetric rank one algorithm is proposed. It combines a modified self-scaled symmetric rank one （SSR1） update with the limited memory and nonmonotone line search technique. In this algorithm, th...A new limited memory symmetric rank one algorithm is proposed. It combines a modified self-scaled symmetric rank one （SSR1） update with the limited memory and nonmonotone line search technique. In this algorithm, the descent search direction is generated by inverse limited memory SSR1 update, thus simplifying the computation. Numerical comparison of the algorithm and the famous limited memory BFGS algorithm is given. Comparison results indicate that the new algorithm can process a kind of large-scale unconstrained optimization problems.展开更多
Refractory metals,including tungsten(W),tantalum(Ta),molybdenum(Mo),and niobium(Nb),play a vital role in industries,such as nuclear energy and aerospace,owing to their exceptional melting temperatures,thermal durabili...Refractory metals,including tungsten(W),tantalum(Ta),molybdenum(Mo),and niobium(Nb),play a vital role in industries,such as nuclear energy and aerospace,owing to their exceptional melting temperatures,thermal durability,and corrosion resistance.These metals have body-centered cubic crystal structure,characterized by limited slip systems and impeded dislocation motion,resulting in significant low-temperature brittleness,which poses challenges for the conventional processing.Additive manufacturing technique provides an innovative approach,enabling the production of intricate parts without molds,which significantly improves the efficiency of material usage.This review provides a comprehensive overview of the advancements in additive manufacturing techniques for the production of refractory metals,such as W,Ta,Mo,and Nb,particularly the laser powder bed fusion.In this review,the influence mechanisms of key process parameters(laser power,scan strategy,and powder characteristics)on the evolution of material microstructure,the formation of metallurgical defects,and mechanical properties were discussed.Generally,optimizing powder characteristics,such as sphericity,implementing substrate preheating,and formulating alloying strategies can significantly improve the densification and crack resistance of manufactured parts.Meanwhile,strictly controlling the oxygen impurity content and optimizing the energy density input are also the key factors to achieve the simultaneous improvement in strength and ductility of refractory metals.Although additive manufacturing technique provides an innovative solution for processing refractory metals,critical issues,such as residual stress control,microstructure and performance anisotropy,and process stability,still need to be addressed.This review not only provides a theoretical basis for the additive manufacturing of high-performance refractory metals,but also proposes forward-looking directions for their industrial application.展开更多
Aiming to solve the steering instability and hysteresis of agricultural robots in the process of movement,a fusion PID control method of particle swarm optimization(PSO)and genetic algorithm(GA)was proposed.The fusion...Aiming to solve the steering instability and hysteresis of agricultural robots in the process of movement,a fusion PID control method of particle swarm optimization(PSO)and genetic algorithm(GA)was proposed.The fusion algorithm took advantage of the fast optimization ability of PSO to optimize the population screening link of GA.The Simulink simulation results showed that the convergence of the fitness function of the fusion algorithm was accelerated,the system response adjustment time was reduced,and the overshoot was almost zero.Then the algorithm was applied to the steering test of agricultural robot in various scenes.After modeling the steering system of agricultural robot,the steering test results in the unloaded suspended state showed that the PID control based on fusion algorithm reduced the rise time,response adjustment time and overshoot of the system,and improved the response speed and stability of the system,compared with the artificial trial and error PID control and the PID control based on GA.The actual road steering test results showed that the PID control response rise time based on the fusion algorithm was the shortest,about 4.43 s.When the target pulse number was set to 100,the actual mean value in the steady-state regulation stage was about 102.9,which was the closest to the target value among the three control methods,and the overshoot was reduced at the same time.The steering test results under various scene states showed that the PID control based on the proposed fusion algorithm had good anti-interference ability,it can adapt to the changes of environment and load and improve the performance of the control system.It was effective in the steering control of agricultural robot.This method can provide a reference for the precise steering control of other robots.展开更多
Optimization problems are prevalent in various fields of science and engineering,with several real-world applications characterized by high dimensionality and complex search landscapes.Starfish optimization algorithm(...Optimization problems are prevalent in various fields of science and engineering,with several real-world applications characterized by high dimensionality and complex search landscapes.Starfish optimization algorithm(SFOA)is a recently optimizer inspired by swarm intelligence,which is effective for numerical optimization,but it may encounter premature and local convergence for complex optimization problems.To address these challenges,this paper proposes the multi-strategy enhanced crested porcupine-starfish optimization algorithm(MCPSFOA).The core innovation of MCPSFOA lies in employing a hybrid strategy to improve SFOA,which integrates the exploratory mechanisms of SFOA with the diverse search capacity of the Crested Porcupine Optimizer(CPO).This synergy enhances MCPSFOA’s ability to navigate complex and multimodal search spaces.To further prevent premature convergence,MCPSFOA incorporates Lévy flight,leveraging its characteristic long and short jump patterns to enable large-scale exploration and escape from local optima.Subsequently,Gaussian mutation is applied for precise solution tuning,introducing controlled perturbations that enhance accuracy and mitigate the risk of insufficient exploitation.Notably,the population diversity enhancement mechanism periodically identifies and resets stagnant individuals,thereby consistently revitalizing population variety throughout the optimization process.MCPSFOA is rigorously evaluated on 24 classical benchmark functions(including high-dimensional cases),the CEC2017 suite,and the CEC2022 suite.MCPSFOA achieves superior overall performance with Friedman mean ranks of 2.208,2.310 and 2.417 on these benchmark functions,outperforming 11 state-of-the-art algorithms.Furthermore,the practical applicability of MCPSFOA is confirmed through its successful application to five engineering optimization cases,where it also yields excellent results.In conclusion,MCPSFOA is not only a highly effective and reliable optimizer for benchmark functions,but also a practical tool for solving real-world optimization problems.展开更多
Deployable Composite Thin-Walled Structures(DCTWS)are widely used in space applications due to their ability to compactly fold and self-deploy in orbit,enabled by cutouts.Cutout design is crucial for balancing structu...Deployable Composite Thin-Walled Structures(DCTWS)are widely used in space applications due to their ability to compactly fold and self-deploy in orbit,enabled by cutouts.Cutout design is crucial for balancing structural rigidity and flexibility,ensuring material integrity during large deformations,and providing adequate load-bearing capacity and stability once deployed.Most research has focused on optimizing cutout size and shape,while topology optimization offers a broader design space.However,the anisotropic properties of woven composite laminates,complex failure criteria,and multi-performance optimization needs have limited the exploration of topology optimization in this field.This work derives the sensitivities of bending stiffness,critical buckling load,and the failure index of woven composite materials with respect to element density,and formulates both single-objective and multi-objective topology optimization models using a linear weighted aggregation approach.The developed method was integrated with the commercial finite element software ABAQUS via a Python script,allowing efficient application to cutout design in various DCTWS configurations to maximize bending stiffness and critical buckling load under material failure constraints.Optimization of a classical tubular hinge resulted in improvements of 107.7%in bending stiffness and 420.5%in critical buckling load compared to level-set topology optimization results reported in the literature,validating the effectiveness of the approach.To facilitate future research and encourage the broader adoption of topology optimization techniques in DCTWS design,the source code for this work is made publicly available via a Git Hub link:https://github.com/jinhao-ok1/Topo-for-DCTWS.git.展开更多
基金The Australian Research Council(DP200101197,DP230101107).
文摘Formalizing complex processes and phenomena of a real-world problem may require a large number of variables and constraints,resulting in what is termed a large-scale optimization problem.Nowadays,such large-scale optimization problems are solved using computing machines,leading to an enormous computational time being required,which may delay deriving timely solutions.Decomposition methods,which partition a large-scale optimization problem into lower-dimensional subproblems,represent a key approach to addressing time-efficiency issues.There has been significant progress in both applied mathematics and emerging artificial intelligence approaches on this front.This work aims at providing an overview of the decomposition methods from both the mathematics and computer science points of view.We also remark on the state-of-the-art developments and recent applications of the decomposition methods,and discuss the future research and development perspectives.
文摘As optimization problems continue to grow in complexity,the need for effective metaheuristic algorithms becomes increasingly evident.However,the challenge lies in identifying the right parameters and strategies for these algorithms.In this paper,we introduce the adaptive multi-strategy Rabbit Algorithm(RA).RA is inspired by the social interactions of rabbits,incorporating elements such as exploration,exploitation,and adaptation to address optimization challenges.It employs three distinct subgroups,comprising male,female,and child rabbits,to execute a multi-strategy search.Key parameters,including distance factor,balance factor,and learning factor,strike a balance between precision and computational efficiency.We offer practical recommendations for fine-tuning five essential RA parameters,making them versatile and independent.RA is capable of autonomously selecting adaptive parameter settings and mutation strategies,enabling it to successfully tackle a range of 17 CEC05 benchmark functions with dimensions scaling up to 5000.The results underscore RA’s superior performance in large-scale optimization tasks,surpassing other state-of-the-art metaheuristics in convergence speed,computational precision,and scalability.Finally,RA has demonstrated its proficiency in solving complicated optimization problems in real-world engineering by completing 10 problems in CEC2020.
基金funded by the National Natural Science Foundation of China(No.72104069)the Science and Technology Department of Henan Province,China(No.182102310886 and 162102110109)the Postgraduate Meritocracy Scheme,hina(No.SYL19060145).
文摘To solve large-scale optimization problems,Fragrance coefficient and variant Particle Swarm local search Butterfly Optimization Algorithm(FPSBOA)is proposed.In the position update stage of Butterfly Optimization Algorithm(BOA),the fragrance coefficient is designed to balance the exploration and exploitation of BOA.The variant particle swarm local search strategy is proposed to improve the local search ability of the current optimal butterfly and prevent the algorithm from falling into local optimality.192000-dimensional functions and 201000-dimensional CEC 2010 large-scale functions are used to verify FPSBOA for complex large-scale optimization problems.The experimental results are statistically analyzed by Friedman test and Wilcoxon rank-sum test.All attained results demonstrated that FPSBOA can better solve more challenging scientific and industrial real-world problems with thousands of variables.Finally,four mechanical engineering problems and one ten-dimensional process synthesis and design problem are applied to FPSBOA,which shows FPSBOA has the feasibility and effectiveness in real-world application problems.
基金supported in part by the Natural Science Foundation of Fujian Province of China(No.2021J01318)the Fujian Provincial Science and Technology Major Project(No.2020HZ02014)the Quanzhou Science and Technology Major Project(No.2021GZ1).
文摘With the increasing size of optimization problems in various scientific and engineering fields,finding promising solutions for these large-scale optimization problems has become increasingly challenging.Dimension reduction-based evolutionary algorithms have emerged as one of the most efficient approaches to tackle these challenges.However,they still face difficulties in constructing appropriate subspaces and preserving the global optimum within those subspaces.To overcome these challenges,a multiform optimization framework with scale-adaptive subspace,called MFO-SAS,is proposed for large-scale optimization by taking full advantage of the subspace-assisted and multitasking mechanisms.To address the first challenge,a scale-adaptive switch strategy is designed to switch the subspaces with different scales at different optimization stages,enabling efficient assistance of the optimization processes for the original problem with appropriate subspaces.To tackle the second challenge,a multiform optimization paradigm is adopted to conduct the simultaneous search over both the original problem space and the constructed subspaces in a multitasking scenario,thus facilitating the utilization of the search experiences from different problem spaces.Consequently,the MFO-SAS framework effectively leverages valuable knowledge obtained from different spaces to guide the search and dynamically balances the representation accuracy of the subspace with the computational cost of subspace search.Experimental results on the large-scale benchmark problems demonstrate the superiority of MFO-SAS over several state-of-the-art algorithms.
基金supported by the National Natural Science Foundation of China(U20A20306,62276191)the Fundamental Research Funds for the Central Universities(HUST2023JYCXJJ011).
文摘Expensive multiobjective optimization problems(EMOPs)are complex optimization problems exacted from realworld applications,where each objective function evaluation(FE)involves expensive computations or physical experiments.Many surrogate-assisted evolutionary algorithms(SAEAs)have been designed to solve EMOPs.Nevertheless,EMOPs with large-scale decision variables remain challenging for existing SAEAs,leading to difficulties in maintaining convergence and diversity.To address this deficiency,we proposed a variable reconstructionbased SAEA(VREA)to balance convergence enhancement and diversity maintenance.Generally,a cluster-based variable reconstruction strategy reconstructs the original large-scale decision variables into low-dimensional weight variables.Thus,the population can be rapidly pushed towards the Pareto set(PS)by optimizing low-dimensional weight variables with the assistance of surrogate models.Population diversity is improved due to the cluster-based variable reconstruction strategy.An adaptive search step size strategy is proposed to balance exploration and exploitation further.Experimental comparisons with four state-of-the-art SAEAs are conducted on benchmark EMOPs with up to 1000 decision variables and an aerodynamic design task.Experimental results demonstrate that VREA obtains well-converged and diverse solutions with limited real FEs.
文摘The research on optimization methods for constellation launch deployment strategies focused on the consideration of mission interval time constraints at the launch site.Firstly,a dynamic modeling of the constellation deployment process was established,and the relationship between the deployment window and the phase difference of the orbit insertion point,as well as the cost of phase adjustment after orbit insertion,was derived.Then,the combination of the constellation deployment position sequence was treated as a parameter,together with the sequence of satellite deployment intervals,as optimization variables,simplifying a highdimensional search problem within a wide range of dates to a finite-dimensional integer programming problem.An improved genetic algorithm with local search on deployment dates was introduced to optimize the launch deployment strategy.With the new description of the optimization variables,the total number of elements in the solution space was reduced by N orders of magnitude.Numerical simulation confirms that the proposed optimization method accelerates the convergence speed from hours to minutes.
文摘The construction of island power grids is a systematic engineering task.To ensure the safe operation of power grid systems,optimizing the line layout of island power grids is crucial.Especially in the current context of large-scale distributed renewable energy integration into the power grid,conventional island power grid line layouts can no longer meet actual demands.It is necessary to combine the operational characteristics of island power systems and historical load data to perform load forecasting,thereby generating power grid line layout paths.This article focuses on large-scale distributed renewable energy integration,summarizing optimization strategies for island power grid line layouts,and providing a solid guarantee for the safe and stable operation of island power systems.
文摘As power systems expand,solving the unit commitment problem(UCP)becomes increasingly challenging due to the curse of dimensionality,and traditional methods often struggle to balance computational efficiency and solution optimality.To tackle this issue,we propose a problem-structure-informed quantum approximate optimization algorithm(QAOA)framework that fully exploits the quantum advantage under extremely limited quantum resources.Specifically,we leverage the inherent topological structure of power systems to decompose large-scale UCP instances into smaller subproblems,which are solvable in parallel by limited number of qubits.This decomposition not only circumvents the current hardware limitations of quantum computing but also achieves higher performance as the graph structure of the power system becomes more sparse.Consequently,our approach can be extended to future power systems that are larger and more complex.
基金support from the National Natural Science Foundation of China(Award No.52105240).
文摘A major bottleneck in large-scale eigenfrequency topology optimization is the repeated solution of the generalized eigenvalue problem.This work presents an efficient graphics processing unit(GPU)solver for threedimensional(3D)topology optimization that maximizes the fundamental eigenfrequency.The Successive Iteration of Analysis and Design(SIAD)framework is employed to avoid solving a full eigenproblem at every iteration.The sequential approximation of the eigenpairs is solved by the GPU-accelerated multigrid-preconditioned conjugate gradient(MGPCG)method to efficiently improve the eigenvectors along with the topological evolution.The cluster-mean approach is adopted to address the non-differentiability issue caused by repeated eigenfrequencies.The corresponding sensitivity analysis method is provided.The parallelized gradient-based Zhang-Paulino-Ramos Jr.(ZPR)algorithm is employed to update the design variables.The effectiveness of the proposed solver is demonstrated through two large-scale numerical examples.The first example demonstrates the accuracy,efficiency,and scalability of the proposed solver by solving a 3D optimization problem of 50.33 million elements being solved in approximately 15.2 h over 300 iterations on a single NVIDIA Tesla V100 GPU.The second example validates the effectiveness of the proposed solver in the presence of repeated eigenfrequencies.Our findings also highlight that higher-resolution models produce distinct optimized structures with higher fundamental frequencies,underscoring the necessity of large-scale topology optimization.
基金supported by the Scientific Research Project of Xiang Jiang Lab(22XJ02003)the University Fundamental Research Fund(23-ZZCX-JDZ-28)+5 种基金the National Science Fund for Outstanding Young Scholars(62122093)the National Natural Science Foundation of China(72071205)the Hunan Graduate Research Innovation Project(ZC23112101-10)the Hunan Natural Science Foundation Regional Joint Project(2023JJ50490)the Science and Technology Project for Young and Middle-aged Talents of Hunan(2023TJ-Z03)the Science and Technology Innovation Program of Humnan Province(2023RC1002)。
文摘Traditional large-scale multi-objective optimization algorithms(LSMOEAs)encounter difficulties when dealing with sparse large-scale multi-objective optimization problems(SLM-OPs)where most decision variables are zero.As a result,many algorithms use a two-layer encoding approach to optimize binary variable Mask and real variable Dec separately.Nevertheless,existing optimizers often focus on locating non-zero variable posi-tions to optimize the binary variables Mask.However,approxi-mating the sparse distribution of real Pareto optimal solutions does not necessarily mean that the objective function is optimized.In data mining,it is common to mine frequent itemsets appear-ing together in a dataset to reveal the correlation between data.Inspired by this,we propose a novel two-layer encoding learning swarm optimizer based on frequent itemsets(TELSO)to address these SLMOPs.TELSO mined the frequent terms of multiple particles with better target values to find mask combinations that can obtain better objective values for fast convergence.Experi-mental results on five real-world problems and eight benchmark sets demonstrate that TELSO outperforms existing state-of-the-art sparse large-scale multi-objective evolutionary algorithms(SLMOEAs)in terms of performance and convergence speed.
基金Supported by the National Natural Science Foundation of China(No.29906010).
文摘The performance of analytical derivative and sparse matrix techniques applied to a traditional dense sequential quadratic programming (SQP) is studied, and the strategy utilizing those techniques is also presented.Computational results on two typical chemical optimization problems demonstrate significant enhancement in efficiency, which shows this strategy is promising and suitable for large-scale process optimization problems.
基金support by the Open Project of Xiangjiang Laboratory(22XJ02003)the University Fundamental Research Fund(23-ZZCX-JDZ-28,ZK21-07)+5 种基金the National Science Fund for Outstanding Young Scholars(62122093)the National Natural Science Foundation of China(72071205)the Hunan Graduate Research Innovation Project(CX20230074)the Hunan Natural Science Foundation Regional Joint Project(2023JJ50490)the Science and Technology Project for Young and Middle-aged Talents of Hunan(2023TJZ03)the Science and Technology Innovation Program of Humnan Province(2023RC1002).
文摘Sparse large-scale multi-objective optimization problems(SLMOPs)are common in science and engineering.However,the large-scale problem represents the high dimensionality of the decision space,requiring algorithms to traverse vast expanse with limited computational resources.Furthermore,in the context of sparse,most variables in Pareto optimal solutions are zero,making it difficult for algorithms to identify non-zero variables efficiently.This paper is dedicated to addressing the challenges posed by SLMOPs.To start,we introduce innovative objective functions customized to mine maximum and minimum candidate sets.This substantial enhancement dramatically improves the efficacy of frequent pattern mining.In this way,selecting candidate sets is no longer based on the quantity of nonzero variables they contain but on a higher proportion of nonzero variables within specific dimensions.Additionally,we unveil a novel approach to association rule mining,which delves into the intricate relationships between non-zero variables.This novel methodology aids in identifying sparse distributions that can potentially expedite reductions in the objective function value.We extensively tested our algorithm across eight benchmark problems and four real-world SLMOPs.The results demonstrate that our approach achieves competitive solutions across various challenges.
基金This work was supported in part by the National Key Research and Development Program of China(2018AAA0100100)the National Natural Science Foundation of China(61822301,61876123,61906001)+2 种基金the Collaborative Innovation Program of Universities in Anhui Province(GXXT-2020-051)the Hong Kong Scholars Program(XJ2019035)Anhui Provincial Natural Science Foundation(1908085QF271).
文摘During the last three decades,evolutionary algorithms(EAs)have shown superiority in solving complex optimization problems,especially those with multiple objectives and non-differentiable landscapes.However,due to the stochastic search strategies,the performance of most EAs deteriorates drastically when handling a large number of decision variables.To tackle the curse of dimensionality,this work proposes an efficient EA for solving super-large-scale multi-objective optimization problems with sparse optimal solutions.The proposed algorithm estimates the sparse distribution of optimal solutions by optimizing a binary vector for each solution,and provides a fast clustering method to highly reduce the dimensionality of the search space.More importantly,all the operations related to the decision variables only contain several matrix calculations,which can be directly accelerated by GPUs.While existing EAs are capable of handling fewer than 10000 real variables,the proposed algorithm is verified to be effective in handling 1000000 real variables.Furthermore,since the proposed algorithm handles the large number of variables via accelerated matrix calculations,its runtime can be reduced to less than 10%of the runtime of existing EAs.
基金Supported by the National Natural Science Foundation of China(Nos.52293472,22473096 and 22471164)。
文摘Among various architectures of polymers,end-group-free rings have attracted growing interests due to their distinct physicochemical performances over the linear counterparts which are exemplified by reduced hydrodynamic size and slower degradation.It is key to develop facile methods to large-scale synthesis of polymer rings with tunable compositions and microstructures.Recent progresses in large-scale synthesis of polymer rings against single-chain dynamic nanoparticles,and the example applications in synchronous enhancing toughness and strength of polymer nanocomposites are summarized.Once there is the breakthrough in rational design and effective large-scale synthesis of polymer rings and their functional derivatives,a family of cyclic functional hybrids would be available,thus providing a new paradigm in developing polymer science and engineering.
基金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.
基金the National Natural Science Foundation of China(10471062)the Natural Science Foundation of Jiangsu Province(BK2006184)~~
文摘A new limited memory symmetric rank one algorithm is proposed. It combines a modified self-scaled symmetric rank one （SSR1） update with the limited memory and nonmonotone line search technique. In this algorithm, the descent search direction is generated by inverse limited memory SSR1 update, thus simplifying the computation. Numerical comparison of the algorithm and the famous limited memory BFGS algorithm is given. Comparison results indicate that the new algorithm can process a kind of large-scale unconstrained optimization problems.
基金National MCF Energy R&D Program(2024YFE03260300)。
文摘Refractory metals,including tungsten(W),tantalum(Ta),molybdenum(Mo),and niobium(Nb),play a vital role in industries,such as nuclear energy and aerospace,owing to their exceptional melting temperatures,thermal durability,and corrosion resistance.These metals have body-centered cubic crystal structure,characterized by limited slip systems and impeded dislocation motion,resulting in significant low-temperature brittleness,which poses challenges for the conventional processing.Additive manufacturing technique provides an innovative approach,enabling the production of intricate parts without molds,which significantly improves the efficiency of material usage.This review provides a comprehensive overview of the advancements in additive manufacturing techniques for the production of refractory metals,such as W,Ta,Mo,and Nb,particularly the laser powder bed fusion.In this review,the influence mechanisms of key process parameters(laser power,scan strategy,and powder characteristics)on the evolution of material microstructure,the formation of metallurgical defects,and mechanical properties were discussed.Generally,optimizing powder characteristics,such as sphericity,implementing substrate preheating,and formulating alloying strategies can significantly improve the densification and crack resistance of manufactured parts.Meanwhile,strictly controlling the oxygen impurity content and optimizing the energy density input are also the key factors to achieve the simultaneous improvement in strength and ductility of refractory metals.Although additive manufacturing technique provides an innovative solution for processing refractory metals,critical issues,such as residual stress control,microstructure and performance anisotropy,and process stability,still need to be addressed.This review not only provides a theoretical basis for the additive manufacturing of high-performance refractory metals,but also proposes forward-looking directions for their industrial application.
文摘Aiming to solve the steering instability and hysteresis of agricultural robots in the process of movement,a fusion PID control method of particle swarm optimization(PSO)and genetic algorithm(GA)was proposed.The fusion algorithm took advantage of the fast optimization ability of PSO to optimize the population screening link of GA.The Simulink simulation results showed that the convergence of the fitness function of the fusion algorithm was accelerated,the system response adjustment time was reduced,and the overshoot was almost zero.Then the algorithm was applied to the steering test of agricultural robot in various scenes.After modeling the steering system of agricultural robot,the steering test results in the unloaded suspended state showed that the PID control based on fusion algorithm reduced the rise time,response adjustment time and overshoot of the system,and improved the response speed and stability of the system,compared with the artificial trial and error PID control and the PID control based on GA.The actual road steering test results showed that the PID control response rise time based on the fusion algorithm was the shortest,about 4.43 s.When the target pulse number was set to 100,the actual mean value in the steady-state regulation stage was about 102.9,which was the closest to the target value among the three control methods,and the overshoot was reduced at the same time.The steering test results under various scene states showed that the PID control based on the proposed fusion algorithm had good anti-interference ability,it can adapt to the changes of environment and load and improve the performance of the control system.It was effective in the steering control of agricultural robot.This method can provide a reference for the precise steering control of other robots.
基金supported by the National Natural Science Foundation of China(Grant No.12402139,No.52368070)supported by Hainan Provincial Natural Science Foundation of China(Grant No.524QN223)+3 种基金Scientific Research Startup Foundation of Hainan University(Grant No.RZ2300002710)State Key Laboratory of Structural Analysis,Optimization and CAE Software for Industrial Equipment,Dalian University of Technology(Grant No.GZ24107)the Horizontal Research Project(Grant No.HD-KYH-2024022)Innovative Research Projects for Postgraduate Students in Hainan Province(Grant No.Hys2025-217).
文摘Optimization problems are prevalent in various fields of science and engineering,with several real-world applications characterized by high dimensionality and complex search landscapes.Starfish optimization algorithm(SFOA)is a recently optimizer inspired by swarm intelligence,which is effective for numerical optimization,but it may encounter premature and local convergence for complex optimization problems.To address these challenges,this paper proposes the multi-strategy enhanced crested porcupine-starfish optimization algorithm(MCPSFOA).The core innovation of MCPSFOA lies in employing a hybrid strategy to improve SFOA,which integrates the exploratory mechanisms of SFOA with the diverse search capacity of the Crested Porcupine Optimizer(CPO).This synergy enhances MCPSFOA’s ability to navigate complex and multimodal search spaces.To further prevent premature convergence,MCPSFOA incorporates Lévy flight,leveraging its characteristic long and short jump patterns to enable large-scale exploration and escape from local optima.Subsequently,Gaussian mutation is applied for precise solution tuning,introducing controlled perturbations that enhance accuracy and mitigate the risk of insufficient exploitation.Notably,the population diversity enhancement mechanism periodically identifies and resets stagnant individuals,thereby consistently revitalizing population variety throughout the optimization process.MCPSFOA is rigorously evaluated on 24 classical benchmark functions(including high-dimensional cases),the CEC2017 suite,and the CEC2022 suite.MCPSFOA achieves superior overall performance with Friedman mean ranks of 2.208,2.310 and 2.417 on these benchmark functions,outperforming 11 state-of-the-art algorithms.Furthermore,the practical applicability of MCPSFOA is confirmed through its successful application to five engineering optimization cases,where it also yields excellent results.In conclusion,MCPSFOA is not only a highly effective and reliable optimizer for benchmark functions,but also a practical tool for solving real-world optimization problems.
基金supported by the National Natural Science Foundation of China(No.12202295)the International(Regional)Cooperation and Exchange Projects of the National Natural Science Foundation of China(No.W2421002)+2 种基金the Sichuan Science and Technology Program(No.2025ZNSFSC0845)Zhejiang Provincial Natural Science Foundation of China(No.ZCLZ24A0201)the Fundamental Research Funds for the Provincial Universities of Zhejiang(No.GK249909299001-004)。
文摘Deployable Composite Thin-Walled Structures(DCTWS)are widely used in space applications due to their ability to compactly fold and self-deploy in orbit,enabled by cutouts.Cutout design is crucial for balancing structural rigidity and flexibility,ensuring material integrity during large deformations,and providing adequate load-bearing capacity and stability once deployed.Most research has focused on optimizing cutout size and shape,while topology optimization offers a broader design space.However,the anisotropic properties of woven composite laminates,complex failure criteria,and multi-performance optimization needs have limited the exploration of topology optimization in this field.This work derives the sensitivities of bending stiffness,critical buckling load,and the failure index of woven composite materials with respect to element density,and formulates both single-objective and multi-objective topology optimization models using a linear weighted aggregation approach.The developed method was integrated with the commercial finite element software ABAQUS via a Python script,allowing efficient application to cutout design in various DCTWS configurations to maximize bending stiffness and critical buckling load under material failure constraints.Optimization of a classical tubular hinge resulted in improvements of 107.7%in bending stiffness and 420.5%in critical buckling load compared to level-set topology optimization results reported in the literature,validating the effectiveness of the approach.To facilitate future research and encourage the broader adoption of topology optimization techniques in DCTWS design,the source code for this work is made publicly available via a Git Hub link:https://github.com/jinhao-ok1/Topo-for-DCTWS.git.
