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.展开更多
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.展开更多
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.展开更多
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.展开更多
The large-scale multi-objective optimization algorithm(LSMOA),based on the grouping of decision variables,is an advanced method for handling high-dimensional decision variables.However,in practical problems,the intera...The large-scale multi-objective optimization algorithm(LSMOA),based on the grouping of decision variables,is an advanced method for handling high-dimensional decision variables.However,in practical problems,the interaction among decision variables is intricate,leading to large group sizes and suboptimal optimization effects;hence a large-scale multi-objective optimization algorithm based on weighted overlapping grouping of decision variables(MOEAWOD)is proposed in this paper.Initially,the decision variables are perturbed and categorized into convergence and diversity variables;subsequently,the convergence variables are subdivided into groups based on the interactions among different decision variables.If the size of a group surpasses the set threshold,that group undergoes a process of weighting and overlapping grouping.Specifically,the interaction strength is evaluated based on the interaction frequency and number of objectives among various decision variables.The decision variable with the highest interaction in the group is identified and disregarded,and the remaining variables are then reclassified into subgroups.Finally,the decision variable with the strongest interaction is added to each subgroup.MOEAWOD minimizes the interactivity between different groups and maximizes the interactivity of decision variables within groups,which contributed to the optimized direction of convergence and diversity exploration with different groups.MOEAWOD was subjected to testing on 18 benchmark large-scale optimization problems,and the experimental results demonstrate the effectiveness of our methods.Compared with the other algorithms,our method is still at an advantage.展开更多
This paper presents a comprehensive review of recent advances in reconfigurable electromagnetic(EM)surfaces.The discussion is organized around three key aspects of reconfigurable EM surfaces:unit cell engineering desi...This paper presents a comprehensive review of recent advances in reconfigurable electromagnetic(EM)surfaces.The discussion is organized around three key aspects of reconfigurable EM surfaces:unit cell engineering design,full-wave numerical analysis,and large-scale optimization techniques.Numerous references are provided to facilitate further exploration of this compelling and timely subject.To address the above three key aspects,we conduct an extensive examination of the design process for metasurfaces in reconfigurable devices.This involves evaluating the design methodology of unit cells,EM simulation techniques tailored for highly complex structures,and innovative optimization methods suitable for scenarios with numerous variables.In scenarios featuring reconfigurability for real-time manipulation of EM waves to meet the requirements of emerging communication environments,the optimization cost function is defined with multiple variables,exhibiting intricate behavior in the design space.Consequently,it necessitates an optimization methodology capable of handling high-dimensional functions without getting trapped in local minima.Moreover,the intricate geometries of metasurface devices preclude analytical solutions,necessitating high-performance full-wave solvers capable of providing highly accurate simulations with minimal computational expense.Key concepts and details pertaining to the aforementioned design stages are presented in a unified manner,along with representative examples.展开更多
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.展开更多
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.展开更多
Sinter is the core raw material for blast furnaces.Flue pressure,which is an important state parameter,affects sinter quality.In this paper,flue pressure prediction and optimization were studied based on the shapley a...Sinter is the core raw material for blast furnaces.Flue pressure,which is an important state parameter,affects sinter quality.In this paper,flue pressure prediction and optimization were studied based on the shapley additive explanation(SHAP)to predict the flue pressure and take targeted adjustment measures.First,the sintering process data were collected and processed.A flue pressure prediction model was then constructed after comparing different feature selection methods and model algorithms using SHAP+extremely random-ized trees(ET).The prediction accuracy of the model within the error range of±0.25 kPa was 92.63%.SHAP analysis was employed to improve the interpretability of the prediction model.The effects of various sintering operation parameters on flue pressure,the relation-ship between the numerical range of key operation parameters and flue pressure,the effect of operation parameter combinations on flue pressure,and the prediction process of the flue pressure prediction model on a single sample were analyzed.A flue pressure optimization module was also constructed and analyzed when the prediction satisfied the judgment conditions.The operating parameter combination was then pushed.The flue pressure was increased by 5.87%during the verification process,achieving a good optimization effect.展开更多
1.Introduction Climate change mitigation pathways aimed at limiting global anthropogenic carbon dioxide(CO_(2))emissions while striving to constrain the global temperature increase to below 2℃—as outlined by the Int...1.Introduction Climate change mitigation pathways aimed at limiting global anthropogenic carbon dioxide(CO_(2))emissions while striving to constrain the global temperature increase to below 2℃—as outlined by the Intergovernmental Panel on Climate Change(IPCC)—consistently predict the widespread implementation of CO_(2)geological storage on a global scale.展开更多
Present of wind power is sporadically and cannot be utilized as the only fundamental load of energy sources.This paper proposes a wind-solar hybrid energy storage system(HESS)to ensure a stable supply grid for a longe...Present of wind power is sporadically and cannot be utilized as the only fundamental load of energy sources.This paper proposes a wind-solar hybrid energy storage system(HESS)to ensure a stable supply grid for a longer period.A multi-objective genetic algorithm(MOGA)and state of charge(SOC)region division for the batteries are introduced to solve the objective function and configuration of the system capacity,respectively.MATLAB/Simulink was used for simulation test.The optimization results show that for a 0.5 MW wind power and 0.5 MW photovoltaic system,with a combination of a 300 Ah lithium battery,a 200 Ah lead-acid battery,and a water storage tank,the proposed strategy reduces the system construction cost by approximately 18,000 yuan.Additionally,the cycle count of the electrochemical energy storage systemincreases from4515 to 4660,while the depth of discharge decreases from 55.37%to 53.65%,achieving shallow charging and discharging,thereby extending battery life and reducing grid voltage fluctuations significantly.The proposed strategy is a guide for stabilizing the grid connection of wind and solar power generation,capability allocation,and energy management of energy conservation systems.展开更多
With the increasing complexity of the current electromagnetic environment,excessive microwave radi-ation not only does harm to human health but also forms various electromagnetic interference to so-phisticated electro...With the increasing complexity of the current electromagnetic environment,excessive microwave radi-ation not only does harm to human health but also forms various electromagnetic interference to so-phisticated electronic instruments.Therefore,the design and preparation of electromagnetic absorbing composites represent an efficient approach to mitigate the current hazards of electromagnetic radiation.However,traditional electromagnetic absorbers are difficult to satisfy the demands of actual utilization in the face of new challenges,and emerging absorbents have garnered increasing attention due to their structure and performance-based advantages.In this review,several emerging composites of Mxene-based,biochar-based,chiral,and heat-resisting are discussed in detail,including their synthetic strategy,structural superiority and regulation method,and final optimization of electromagnetic absorption ca-pacity.These insights provide a comprehensive reference for the future development of new-generation electromagnetic-wave absorption composites.Moreover,the potential development directions of these emerging absorbers have been proposed as well.展开更多
In the area of reservoir engineering,the optimization of oil and gas production is a complex task involving a myriad of interconnected decision variables shaping the production system's infrastructure.Traditionall...In the area of reservoir engineering,the optimization of oil and gas production is a complex task involving a myriad of interconnected decision variables shaping the production system's infrastructure.Traditionally,this optimization process was centered on a single objective,such as net present value,return on investment,cumulative oil production,or cumulative water production.However,the inherent complexity of reservoir exploration necessitates a departure from this single-objective approach.Mul-tiple conflicting production and economic indicators must now be considered to enable more precise and robust decision-making.In response to this challenge,researchers have embarked on a journey to explore field development optimization of multiple conflicting criteria,employing the formidable tools of multi-objective optimization algorithms.These algorithms delve into the intricate terrain of production strategy design,seeking to strike a delicate balance between the often-contrasting objectives.Over the years,a plethora of these algorithms have emerged,ranging from a priori methods to a posteriori approach,each offering unique insights and capabilities.This survey endeavors to encapsulate,catego-rize,and scrutinize these invaluable contributions to field development optimization,which grapple with the complexities of multiple conflicting objective functions.Beyond the overview of existing methodologies,we delve into the persisting challenges faced by researchers and practitioners alike.Notably,the application of multi-objective optimization techniques to production optimization is hin-dered by the resource-intensive nature of reservoir simulation,especially when confronted with inherent uncertainties.As a result of this survey,emerging opportunities have been identified that will serve as catalysts for pivotal research endeavors in the future.As intelligent and more efficient algo-rithms continue to evolve,the potential for addressing hitherto insurmountable field development optimization obstacles becomes increasingly viable.This discussion on future prospects aims to inspire critical research,guiding the way toward innovative solutions in the ever-evolving landscape of oil and gas production optimization.展开更多
Considering the uncertainty of grid connection of electric vehicle charging stations and the uncertainty of new energy and residential electricity load,a spatio-temporal decoupling strategy of dynamic reactive power o...Considering the uncertainty of grid connection of electric vehicle charging stations and the uncertainty of new energy and residential electricity load,a spatio-temporal decoupling strategy of dynamic reactive power optimization based on clustering-local relaxation-correction is proposed.Firstly,the k-medoids clustering algorithm is used to divide the reduced power scene into periods.Then,the discrete variables and continuous variables are optimized in the same period of time.Finally,the number of input groups of parallel capacitor banks(CB)in multiple periods is fixed,and then the secondary static reactive power optimization correction is carried out by using the continuous reactive power output device based on the static reactive power compensation device(SVC),the new energy grid-connected inverter,and the electric vehicle charging station.According to the characteristics of the model,a hybrid optimization algorithm with a cross-feedback mechanism is used to solve different types of variables,and an improved artificial hummingbird algorithm based on tent chaotic mapping and adaptive mutation is proposed to improve the solution efficiency.The simulation results show that the proposed decoupling strategy can obtain satisfactory optimization resultswhile strictly guaranteeing the dynamic constraints of discrete variables,and the hybrid algorithm can effectively solve the mixed integer nonlinear optimization problem.展开更多
The multi-objective particle swarm optimization algorithm(MOPSO)is widely used to solve multi-objective optimization problems.In the article,amulti-objective particle swarm optimization algorithmbased on decomposition...The multi-objective particle swarm optimization algorithm(MOPSO)is widely used to solve multi-objective optimization problems.In the article,amulti-objective particle swarm optimization algorithmbased on decomposition and multi-selection strategy is proposed to improve the search efficiency.First,two update strategies based on decomposition are used to update the evolving population and external archive,respectively.Second,a multiselection strategy is designed.The first strategy is for the subspace without a non-dominated solution.Among the neighbor particles,the particle with the smallest penalty-based boundary intersection value is selected as the global optimal solution and the particle far away fromthe search particle and the global optimal solution is selected as the personal optimal solution to enhance global search.The second strategy is for the subspace with a non-dominated solution.In the neighbor particles,two particles are randomly selected,one as the global optimal solution and the other as the personal optimal solution,to enhance local search.The third strategy is for Pareto optimal front(PF)discontinuity,which is identified by the cumulative number of iterations of the subspace without non-dominated solutions.In the subsequent iteration,a new probability distribution is used to select from the remaining subspaces to search.Third,an adaptive inertia weight update strategy based on the dominated degree is designed to further improve the search efficiency.Finally,the proposed algorithmis compared with fivemulti-objective particle swarm optimization algorithms and five multi-objective evolutionary algorithms on 22 test problems.The results show that the proposed algorithm has better performance.展开更多
This study investigates the potential of Prosopis cineraria Leaves Powder(PCLP)as a biosorbent for removing lead(Pb)and zinc(Zn)from aqueous solutions,optimizing the process using Response Surface Methodology(RSM).Pro...This study investigates the potential of Prosopis cineraria Leaves Powder(PCLP)as a biosorbent for removing lead(Pb)and zinc(Zn)from aqueous solutions,optimizing the process using Response Surface Methodology(RSM).Prosopis cineraria,commonly known as Khejri,is a drought-resistant tree with significant promise in environmental applications.The research employed a Central Composite Design(CCD)to examine the independent and combined effects of key process variables,including initial metal ion concentration,contact time,pH,and PCLP dosage.RSM was used to develop mathematical models that explain the relationship between these factors and the efficiency of metal removal,allowing the determination of optimal operating conditions.The experimental results indicated that the Langmuir isotherm model was the most appropriate for describing the biosorption of both metals,suggesting favorable adsorption characteristics.Additionally,the D-R isotherm confirmed that chemisorption was the primary mechanism involved in the biosorption process.For lead removal,the optimal conditions were found to be 312.23 K temperature,pH 4.72,58.5 mg L-1 initial concentration,and 0.27 g biosorbent dosage,achieving an 83.77%removal efficiency.For zinc,the optimal conditions were 312.4 K,pH 5.86,53.07 mg L-1 initial concentration,and the same biosorbent dosage,resulting in a 75.86%removal efficiency.These findings highlight PCLP’s potential as an effective,eco-friendly biosorbent for sustainable heavy metal removal in water treatment.展开更多
The wireless signals emitted by base stations serve as a vital link connecting people in today’s society and have been occupying an increasingly important role in real life.The development of the Internet of Things(I...The wireless signals emitted by base stations serve as a vital link connecting people in today’s society and have been occupying an increasingly important role in real life.The development of the Internet of Things(IoT)relies on the support of base stations,which provide a solid foundation for achieving a more intelligent way of living.In a specific area,achieving higher signal coverage with fewer base stations has become an urgent problem.Therefore,this article focuses on the effective coverage area of base station signals and proposes a novel Evolutionary Particle Swarm Optimization(EPSO)algorithm based on collective prediction,referred to herein as ECPPSO.Introducing a new strategy called neighbor-based evolution prediction(NEP)addresses the issue of premature convergence often encountered by PSO.ECPPSO also employs a strengthening evolution(SE)strategy to enhance the algorithm’s global search capability and efficiency,ensuring enhanced robustness and a faster convergence speed when solving complex optimization problems.To better adapt to the actual communication needs of base stations,this article conducts simulation experiments by changing the number of base stations.The experimental results demonstrate thatunder the conditionof 50 ormore base stations,ECPPSOconsistently achieves the best coverage rate exceeding 95%,peaking at 99.4400%when the number of base stations reaches 80.These results validate the optimization capability of the ECPPSO algorithm,proving its feasibility and effectiveness.Further ablative experiments and comparisons with other algorithms highlight the advantages of ECPPSO.展开更多
基金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.
文摘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.
基金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.
基金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.
基金supported in part by the Central Government Guides Local Science and TechnologyDevelopment Funds(Grant No.YDZJSX2021A038)in part by theNational Natural Science Foundation of China under(Grant No.61806138)in part by the China University Industry-University-Research Collaborative Innovation Fund(Future Network Innovation Research and Application Project)(Grant 2021FNA04014).
文摘The large-scale multi-objective optimization algorithm(LSMOA),based on the grouping of decision variables,is an advanced method for handling high-dimensional decision variables.However,in practical problems,the interaction among decision variables is intricate,leading to large group sizes and suboptimal optimization effects;hence a large-scale multi-objective optimization algorithm based on weighted overlapping grouping of decision variables(MOEAWOD)is proposed in this paper.Initially,the decision variables are perturbed and categorized into convergence and diversity variables;subsequently,the convergence variables are subdivided into groups based on the interactions among different decision variables.If the size of a group surpasses the set threshold,that group undergoes a process of weighting and overlapping grouping.Specifically,the interaction strength is evaluated based on the interaction frequency and number of objectives among various decision variables.The decision variable with the highest interaction in the group is identified and disregarded,and the remaining variables are then reclassified into subgroups.Finally,the decision variable with the strongest interaction is added to each subgroup.MOEAWOD minimizes the interactivity between different groups and maximizes the interactivity of decision variables within groups,which contributed to the optimized direction of convergence and diversity exploration with different groups.MOEAWOD was subjected to testing on 18 benchmark large-scale optimization problems,and the experimental results demonstrate the effectiveness of our methods.Compared with the other algorithms,our method is still at an advantage.
文摘This paper presents a comprehensive review of recent advances in reconfigurable electromagnetic(EM)surfaces.The discussion is organized around three key aspects of reconfigurable EM surfaces:unit cell engineering design,full-wave numerical analysis,and large-scale optimization techniques.Numerous references are provided to facilitate further exploration of this compelling and timely subject.To address the above three key aspects,we conduct an extensive examination of the design process for metasurfaces in reconfigurable devices.This involves evaluating the design methodology of unit cells,EM simulation techniques tailored for highly complex structures,and innovative optimization methods suitable for scenarios with numerous variables.In scenarios featuring reconfigurability for real-time manipulation of EM waves to meet the requirements of emerging communication environments,the optimization cost function is defined with multiple variables,exhibiting intricate behavior in the design space.Consequently,it necessitates an optimization methodology capable of handling high-dimensional functions without getting trapped in local minima.Moreover,the intricate geometries of metasurface devices preclude analytical solutions,necessitating high-performance full-wave solvers capable of providing highly accurate simulations with minimal computational expense.Key concepts and details pertaining to the aforementioned design stages are presented in a unified manner,along with representative examples.
基金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.
基金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 General Program of the National Natural Science Foundation of China(No.52274326)the China Baowu Low Carbon Metallurgy Innovation Foundation(No.BWLCF202109)the Seventh Batch of Ten Thousand Talents Plan of China(No.ZX20220553).
文摘Sinter is the core raw material for blast furnaces.Flue pressure,which is an important state parameter,affects sinter quality.In this paper,flue pressure prediction and optimization were studied based on the shapley additive explanation(SHAP)to predict the flue pressure and take targeted adjustment measures.First,the sintering process data were collected and processed.A flue pressure prediction model was then constructed after comparing different feature selection methods and model algorithms using SHAP+extremely random-ized trees(ET).The prediction accuracy of the model within the error range of±0.25 kPa was 92.63%.SHAP analysis was employed to improve the interpretability of the prediction model.The effects of various sintering operation parameters on flue pressure,the relation-ship between the numerical range of key operation parameters and flue pressure,the effect of operation parameter combinations on flue pressure,and the prediction process of the flue pressure prediction model on a single sample were analyzed.A flue pressure optimization module was also constructed and analyzed when the prediction satisfied the judgment conditions.The operating parameter combination was then pushed.The flue pressure was increased by 5.87%during the verification process,achieving a good optimization effect.
基金supported by the National Key Research and Development Program of China(2022YFE0206700)。
文摘1.Introduction Climate change mitigation pathways aimed at limiting global anthropogenic carbon dioxide(CO_(2))emissions while striving to constrain the global temperature increase to below 2℃—as outlined by the Intergovernmental Panel on Climate Change(IPCC)—consistently predict the widespread implementation of CO_(2)geological storage on a global scale.
基金supported by a Horizontal Project on the Development of a Hybrid Energy Storage Simulation Model for Wind Power Based on an RT-LAB Simulation System(PH2023000190)the Inner Mongolia Natural Science Foundation Project and the Optimization of Exergy Efficiency of a Hybrid Energy Storage System with Crossover Control for Wind Power(2023JQ04).
文摘Present of wind power is sporadically and cannot be utilized as the only fundamental load of energy sources.This paper proposes a wind-solar hybrid energy storage system(HESS)to ensure a stable supply grid for a longer period.A multi-objective genetic algorithm(MOGA)and state of charge(SOC)region division for the batteries are introduced to solve the objective function and configuration of the system capacity,respectively.MATLAB/Simulink was used for simulation test.The optimization results show that for a 0.5 MW wind power and 0.5 MW photovoltaic system,with a combination of a 300 Ah lithium battery,a 200 Ah lead-acid battery,and a water storage tank,the proposed strategy reduces the system construction cost by approximately 18,000 yuan.Additionally,the cycle count of the electrochemical energy storage systemincreases from4515 to 4660,while the depth of discharge decreases from 55.37%to 53.65%,achieving shallow charging and discharging,thereby extending battery life and reducing grid voltage fluctuations significantly.The proposed strategy is a guide for stabilizing the grid connection of wind and solar power generation,capability allocation,and energy management of energy conservation systems.
基金supported by the Surface Project of Local De-velopment in Science and Technology Guided by Central Govern-ment(No.2021ZYD0041)the National Natural Science Founda-tion of China(Nos.52377026 and 52301192)+3 种基金the Natural Science Foundation of Shandong Province(No.ZR2019YQ24)the Taishan Scholars and Young Experts Program of Shandong Province(No.tsqn202103057)the Special Financial of Shandong Province(Struc-tural Design of High-efficiency Electromagnetic Wave-absorbing Composite Materials and Construction of Shandong Provincial Tal-ent Teams)the“Sanqin Scholars”Innovation Teams Project of Shaanxi Province(Clean Energy Materials and High-Performance Devices Innovation Team of Shaanxi Dongling Smelting Co.,Ltd.).
文摘With the increasing complexity of the current electromagnetic environment,excessive microwave radi-ation not only does harm to human health but also forms various electromagnetic interference to so-phisticated electronic instruments.Therefore,the design and preparation of electromagnetic absorbing composites represent an efficient approach to mitigate the current hazards of electromagnetic radiation.However,traditional electromagnetic absorbers are difficult to satisfy the demands of actual utilization in the face of new challenges,and emerging absorbents have garnered increasing attention due to their structure and performance-based advantages.In this review,several emerging composites of Mxene-based,biochar-based,chiral,and heat-resisting are discussed in detail,including their synthetic strategy,structural superiority and regulation method,and final optimization of electromagnetic absorption ca-pacity.These insights provide a comprehensive reference for the future development of new-generation electromagnetic-wave absorption composites.Moreover,the potential development directions of these emerging absorbers have been proposed as well.
基金the support of EPIC - Energy Production Innovation Center, hosted by the University of Campinas (UNICAMP) and sponsored by Equinor Brazil and FAPESP - Sao Paulo Research Foundation (2021/04878- 7 and 2017/15736-3)financed in part by the Coordenacao de Aperfeicoamento de Pessoal de Nível Superior Brasil (CAPES) - Financing Code 001
文摘In the area of reservoir engineering,the optimization of oil and gas production is a complex task involving a myriad of interconnected decision variables shaping the production system's infrastructure.Traditionally,this optimization process was centered on a single objective,such as net present value,return on investment,cumulative oil production,or cumulative water production.However,the inherent complexity of reservoir exploration necessitates a departure from this single-objective approach.Mul-tiple conflicting production and economic indicators must now be considered to enable more precise and robust decision-making.In response to this challenge,researchers have embarked on a journey to explore field development optimization of multiple conflicting criteria,employing the formidable tools of multi-objective optimization algorithms.These algorithms delve into the intricate terrain of production strategy design,seeking to strike a delicate balance between the often-contrasting objectives.Over the years,a plethora of these algorithms have emerged,ranging from a priori methods to a posteriori approach,each offering unique insights and capabilities.This survey endeavors to encapsulate,catego-rize,and scrutinize these invaluable contributions to field development optimization,which grapple with the complexities of multiple conflicting objective functions.Beyond the overview of existing methodologies,we delve into the persisting challenges faced by researchers and practitioners alike.Notably,the application of multi-objective optimization techniques to production optimization is hin-dered by the resource-intensive nature of reservoir simulation,especially when confronted with inherent uncertainties.As a result of this survey,emerging opportunities have been identified that will serve as catalysts for pivotal research endeavors in the future.As intelligent and more efficient algo-rithms continue to evolve,the potential for addressing hitherto insurmountable field development optimization obstacles becomes increasingly viable.This discussion on future prospects aims to inspire critical research,guiding the way toward innovative solutions in the ever-evolving landscape of oil and gas production optimization.
基金funded by the“Research and Application Project of Collaborative Optimization Control Technology for Distribution Station Area for High Proportion Distributed PV Consumption(4000-202318079A-1-1-ZN)”of the Headquarters of the State Grid Corporation.
文摘Considering the uncertainty of grid connection of electric vehicle charging stations and the uncertainty of new energy and residential electricity load,a spatio-temporal decoupling strategy of dynamic reactive power optimization based on clustering-local relaxation-correction is proposed.Firstly,the k-medoids clustering algorithm is used to divide the reduced power scene into periods.Then,the discrete variables and continuous variables are optimized in the same period of time.Finally,the number of input groups of parallel capacitor banks(CB)in multiple periods is fixed,and then the secondary static reactive power optimization correction is carried out by using the continuous reactive power output device based on the static reactive power compensation device(SVC),the new energy grid-connected inverter,and the electric vehicle charging station.According to the characteristics of the model,a hybrid optimization algorithm with a cross-feedback mechanism is used to solve different types of variables,and an improved artificial hummingbird algorithm based on tent chaotic mapping and adaptive mutation is proposed to improve the solution efficiency.The simulation results show that the proposed decoupling strategy can obtain satisfactory optimization resultswhile strictly guaranteeing the dynamic constraints of discrete variables,and the hybrid algorithm can effectively solve the mixed integer nonlinear optimization problem.
基金supported by National Natural Science Foundations of China(nos.12271326,62102304,61806120,61502290,61672334,61673251)China Postdoctoral Science Foundation(no.2015M582606)+2 种基金Industrial Research Project of Science and Technology in Shaanxi Province(nos.2015GY016,2017JQ6063)Fundamental Research Fund for the Central Universities(no.GK202003071)Natural Science Basic Research Plan in Shaanxi Province of China(no.2022JM-354).
文摘The multi-objective particle swarm optimization algorithm(MOPSO)is widely used to solve multi-objective optimization problems.In the article,amulti-objective particle swarm optimization algorithmbased on decomposition and multi-selection strategy is proposed to improve the search efficiency.First,two update strategies based on decomposition are used to update the evolving population and external archive,respectively.Second,a multiselection strategy is designed.The first strategy is for the subspace without a non-dominated solution.Among the neighbor particles,the particle with the smallest penalty-based boundary intersection value is selected as the global optimal solution and the particle far away fromthe search particle and the global optimal solution is selected as the personal optimal solution to enhance global search.The second strategy is for the subspace with a non-dominated solution.In the neighbor particles,two particles are randomly selected,one as the global optimal solution and the other as the personal optimal solution,to enhance local search.The third strategy is for Pareto optimal front(PF)discontinuity,which is identified by the cumulative number of iterations of the subspace without non-dominated solutions.In the subsequent iteration,a new probability distribution is used to select from the remaining subspaces to search.Third,an adaptive inertia weight update strategy based on the dominated degree is designed to further improve the search efficiency.Finally,the proposed algorithmis compared with fivemulti-objective particle swarm optimization algorithms and five multi-objective evolutionary algorithms on 22 test problems.The results show that the proposed algorithm has better performance.
文摘This study investigates the potential of Prosopis cineraria Leaves Powder(PCLP)as a biosorbent for removing lead(Pb)and zinc(Zn)from aqueous solutions,optimizing the process using Response Surface Methodology(RSM).Prosopis cineraria,commonly known as Khejri,is a drought-resistant tree with significant promise in environmental applications.The research employed a Central Composite Design(CCD)to examine the independent and combined effects of key process variables,including initial metal ion concentration,contact time,pH,and PCLP dosage.RSM was used to develop mathematical models that explain the relationship between these factors and the efficiency of metal removal,allowing the determination of optimal operating conditions.The experimental results indicated that the Langmuir isotherm model was the most appropriate for describing the biosorption of both metals,suggesting favorable adsorption characteristics.Additionally,the D-R isotherm confirmed that chemisorption was the primary mechanism involved in the biosorption process.For lead removal,the optimal conditions were found to be 312.23 K temperature,pH 4.72,58.5 mg L-1 initial concentration,and 0.27 g biosorbent dosage,achieving an 83.77%removal efficiency.For zinc,the optimal conditions were 312.4 K,pH 5.86,53.07 mg L-1 initial concentration,and the same biosorbent dosage,resulting in a 75.86%removal efficiency.These findings highlight PCLP’s potential as an effective,eco-friendly biosorbent for sustainable heavy metal removal in water treatment.
基金supported by the National Natural Science Foundation of China(Nos.62272418,62102058)Basic Public Welfare Research Program of Zhejiang Province(No.LGG18E050011)the Major Open Project of Key Laboratory for Advanced Design and Intelligent Computing of the Ministry of Education under Grant ADIC2023ZD001,National Undergraduate Training Program on Innovation and Entrepreneurship(No.202410345054).
文摘The wireless signals emitted by base stations serve as a vital link connecting people in today’s society and have been occupying an increasingly important role in real life.The development of the Internet of Things(IoT)relies on the support of base stations,which provide a solid foundation for achieving a more intelligent way of living.In a specific area,achieving higher signal coverage with fewer base stations has become an urgent problem.Therefore,this article focuses on the effective coverage area of base station signals and proposes a novel Evolutionary Particle Swarm Optimization(EPSO)algorithm based on collective prediction,referred to herein as ECPPSO.Introducing a new strategy called neighbor-based evolution prediction(NEP)addresses the issue of premature convergence often encountered by PSO.ECPPSO also employs a strengthening evolution(SE)strategy to enhance the algorithm’s global search capability and efficiency,ensuring enhanced robustness and a faster convergence speed when solving complex optimization problems.To better adapt to the actual communication needs of base stations,this article conducts simulation experiments by changing the number of base stations.The experimental results demonstrate thatunder the conditionof 50 ormore base stations,ECPPSOconsistently achieves the best coverage rate exceeding 95%,peaking at 99.4400%when the number of base stations reaches 80.These results validate the optimization capability of the ECPPSO algorithm,proving its feasibility and effectiveness.Further ablative experiments and comparisons with other algorithms highlight the advantages of ECPPSO.
