Due to the security and scalability features of hybrid cloud architecture,it can bettermeet the diverse requirements of users for cloud services.And a reasonable resource allocation solution is the key to adequately u...Due to the security and scalability features of hybrid cloud architecture,it can bettermeet the diverse requirements of users for cloud services.And a reasonable resource allocation solution is the key to adequately utilize the hybrid cloud.However,most previous studies have not comprehensively optimized the performance of hybrid cloud task scheduling,even ignoring the conflicts between its security privacy features and other requirements.Based on the above problems,a many-objective hybrid cloud task scheduling optimization model(HCTSO)is constructed combining risk rate,resource utilization,total cost,and task completion time.Meanwhile,an opposition-based learning knee point-driven many-objective evolutionary algorithm(OBL-KnEA)is proposed to improve the performance of model solving.The algorithm uses opposition-based learning to generate initial populations for faster convergence.Furthermore,a perturbation-based multipoint crossover operator and a dynamic range mutation operator are designed to extend the search range.By comparing the experiments with other excellent algorithms on HCTSO,OBL-KnEA achieves excellent results in terms of evaluation metrics,initial populations,and model optimization effects.展开更多
In solving many-objective optimization problems(MaO Ps),existing nondominated sorting-based multi-objective evolutionary algorithms suffer from the fast loss of selection pressure.Most candidate solutions become nondo...In solving many-objective optimization problems(MaO Ps),existing nondominated sorting-based multi-objective evolutionary algorithms suffer from the fast loss of selection pressure.Most candidate solutions become nondominated during the evolutionary process,thus leading to the failure of producing offspring toward Pareto-optimal front with diversity.Can we find a more effective way to select nondominated solutions and resolve this issue?To answer this critical question,this work proposes to evolve solutions through line complex rather than solution points in Euclidean space.First,Plücker coordinates are used to project solution points to line complex composed of position vectors and momentum ones.Besides position vectors of the solution points,momentum vectors are used to extend the comparability of nondominated solutions and enhance selection pressure.Then,a new distance function designed for high-dimensional space is proposed to replace Euclidean distance as a more effective distancebased estimator.Based on them,a novel many-objective evolutionary algorithm(MaOEA)is proposed by integrating a line complex-based environmental selection strategy into the NSGAⅢframework.The proposed algorithm is compared with the state of the art on widely used benchmark problems with up to 15 objectives.Experimental results demonstrate its superior competitiveness in solving MaOPs.展开更多
The two-archive 2 algorithm(Two_Arch2) is a manyobjective evolutionary algorithm for balancing the convergence,diversity,and complexity using diversity archive(DA) and convergence archive(CA).However,the individuals i...The two-archive 2 algorithm(Two_Arch2) is a manyobjective evolutionary algorithm for balancing the convergence,diversity,and complexity using diversity archive(DA) and convergence archive(CA).However,the individuals in DA are selected based on the traditional Pareto dominance which decreases the selection pressure in the high-dimensional problems.The traditional algorithm even cannot converge due to the weak selection pressure.Meanwhile,Two_Arch2 adopts DA as the output of the algorithm which is hard to maintain diversity and coverage of the final solutions synchronously and increase the complexity of the algorithm.To increase the evolutionary pressure of the algorithm and improve distribution and convergence of the final solutions,an ε-domination based Two_Arch2 algorithm(ε-Two_Arch2) for many-objective problems(MaOPs) is proposed in this paper.In ε-Two_Arch2,to decrease the computational complexity and speed up the convergence,a novel evolutionary framework with a fast update strategy is proposed;to increase the selection pressure,ε-domination is assigned to update the individuals in DA;to guarantee the uniform distribution of the solution,a boundary protection strategy based on I_(ε+) indicator is designated as two steps selection strategies to update individuals in CA.To evaluate the performance of the proposed algorithm,a series of benchmark functions with different numbers of objectives is solved.The results demonstrate that the proposed method is competitive with the state-of-the-art multi-objective evolutionary algorithms and the efficiency of the algorithm is significantly improved compared with Two_Arch2.展开更多
Many-objective optimization problems take challenges to multi-objective evolutionary algorithms.A number of nondominated solutions in population cause a difficult selection towards the Pareto front.To tackle this issu...Many-objective optimization problems take challenges to multi-objective evolutionary algorithms.A number of nondominated solutions in population cause a difficult selection towards the Pareto front.To tackle this issue,a series of indicatorbased multi-objective evolutionary algorithms(MOEAs)have been proposed to guide the evolution progress and shown promising performance.This paper proposes an indicator-based manyobjective evolutionary algorithm calledε-indicator-based shuffled frog leaping algorithm(ε-MaOSFLA),which adopts the shuffled frog leaping algorithm as an evolutionary strategy and a simple and effectiveε-indicator as a fitness assignment scheme to press the population towards the Pareto front.Compared with four stateof-the-art MOEAs on several standard test problems with up to 50 objectives,the experimental results show thatε-MaOSFLA outperforms the competitors.展开更多
It is still a huge challenge for traditional Pareto-dominatedmany-objective optimization algorithms to solve manyobjective optimization problems because these algorithms hardly maintain the balance between convergence...It is still a huge challenge for traditional Pareto-dominatedmany-objective optimization algorithms to solve manyobjective optimization problems because these algorithms hardly maintain the balance between convergence and diversity and can only find a group of solutions focused on a small area on the Pareto front,resulting in poor performance of those algorithms.For this reason,we propose a reference vector-assisted algorithmwith an adaptive niche dominance relation,for short MaOEA-AR.The new dominance relation forms a niche based on the angle between candidate solutions.By comparing these solutions,the solutionwith the best convergence is found to be the non-dominated solution to improve the selection pressure.In reproduction,a mutation strategy of k-bit crossover and hybrid mutation is used to generate high-quality offspring.On 23 test problems with up to 15-objective,we compared the proposed algorithm with five state-of-the-art algorithms.The experimental results verified that the proposed algorithm is competitive.展开更多
This paper develops a many-objective optimization model, which contains objectives representing the interests of the electricity and gas networks, as well as the distributed district heating and cooling units, to coor...This paper develops a many-objective optimization model, which contains objectives representing the interests of the electricity and gas networks, as well as the distributed district heating and cooling units, to coordinate the benefits of all parties participated in the integrated energy system(IES). In order to solve the many-objective optimization model efficiently, an improved objective reduction(IOR) approach is proposed, aiming at acquiring the smallest set of objectives. The IOR approach utilizes the Spearman’s rank correlation coefficient to measure the relationship between objectives based on the Pareto-optimal front captured by the multi-objective group search optimizer with adaptive covariance and Lévy flights algorithm, and adopts various strategies to reduce the number of objectives gradually. Simulation studies are conducted on an IES consisting of a modified IEEE 30-bus electricity network and a 15-node gas network. The results show that the many-objective optimization problem is transformed into a bi-objective formulation by the IOR. Furthermore,our approach improves the overall quality of dispatch solutions and alleviates the decision making burden.展开更多
Large-scale cooling energy system has developed well in the past decade.However,its optimization is still a problem to be tackled due to the nonlinearity and large scale of existing systems.Reducing the scale of probl...Large-scale cooling energy system has developed well in the past decade.However,its optimization is still a problem to be tackled due to the nonlinearity and large scale of existing systems.Reducing the scale of problems without oversimplifying the actual system model is a big challenge nowadays.This paper proposes a dimension reduction-based many-objective optimization(DRMO)method to solve an accurate nonlinear model of a practical large-scale cooling energy system.In the first stage,many-objective and many-variable of the large system are pre-processed to reduce the overall scale of the optimization problem.The relationships between many objectives are analyzed to find a few representative objectives.Key control variables are extracted to reduce the dimension of variables and the number of equality constraints.In the second stage,the manyobjective group search optimization(GSO)method is used to solve the low-dimensional nonlinear model,and a Pareto-front is obtained.In the final stage,candidate solutions along the Paretofront are graded on many-objective levels of system operators.The candidate solution with the highest average utility value is selected as the best running mode.Simulations are carried out on a 619-node-614-branch cooling system,and results show the ability of the proposed method in solving large-scale system operation problems.展开更多
In this paper, a new preference multi-objective optimization algorithm called immune clone algorithm based on reference direction method （RD-ICA） is proposed for solving many-objective optimization problems. First, ...In this paper, a new preference multi-objective optimization algorithm called immune clone algorithm based on reference direction method （RD-ICA） is proposed for solving many-objective optimization problems. First, an intelligent recombination operator, which performs well on the functions comprising many parameters, is introduced into an immune clone algorithm so as to explore the potentially excellent gene segments of all individuals in the antibody pop- ulation. Second, a reference direction method, a very strict ranking based on the desire of decision makers （DMs）, is used to guide selection and clone of the active population. Then a light beam search （LBS） is borrowed to pick out a small set of individuals filling the external population. The proposed method has been extensively compared with other recently proposed evolutionary multi-objective optimization （EMO） approaches over DTLZ problems with from 4 to 100 objectives. Experimental results indicate RD-ICA can achieve competitive results.展开更多
With the increase of problem dimensions,most solutions of existing many-objective optimization algorithms are non-dominant.Therefore,the selection of individuals and the retention of elite individuals are important.Ex...With the increase of problem dimensions,most solutions of existing many-objective optimization algorithms are non-dominant.Therefore,the selection of individuals and the retention of elite individuals are important.Existing algorithms cannot provide sufficient solution precision and guarantee the diversity and convergence of solution sets when solving practical many-objective industrial problems.Thus,this work proposes an improved many-objective pigeon-inspired optimization(ImMAPIO)algorithm with multiple selection strategies to solve many-objective optimization problems.Multiple selection strategies integrating hypervolume,knee point,and vector angles are utilized to increase selection pressure to the true Pareto Front.Thus,the accuracy,convergence,and diversity of solutions are improved.ImMAPIO is applied to the DTLZ and WFG test functions with four to fifteen objectives and compared against NSGA-III,GrEA,MOEA/D,RVEA,and many-objective Pigeon-inspired optimization algorithm.Experimental results indicate the superiority of ImMAPIO on these test functions.展开更多
Evolutionary algorithm is an effective strategy for solving many-objective optimization problems.At present,most evolutionary many-objective algorithms are designed for solving many-objective optimization problems whe...Evolutionary algorithm is an effective strategy for solving many-objective optimization problems.At present,most evolutionary many-objective algorithms are designed for solving many-objective optimization problems where the objectives conflict with each other.In some cases,however,the objectives are not always in conflict.It consists of multiple independent objective subsets and the relationship between objectives is unknown in advance.The classical evolutionary many-objective algorithms may not be able to effectively solve such problems.Accordingly,we propose an objective set decomposition strategy based on the partial set covering model.It decomposes the objectives into a collection of objective subsets to preserve the nondominance relationship as much as possible.An optimization subproblem is defined on each objective subset.A coevolutionary algorithm is presented to optimize all subproblems simultaneously,in which a nondominance ranking is presented to interact information among these sub-populations.The proposed algorithm is compared with five popular many-objective evolutionary algorithms and four objective set decomposition based evolutionary algorithms on a series of test problems.Numerical experiments demonstrate that the proposed algorithm can achieve promising results for the many-objective optimization problems with independent and harmonious objectives.展开更多
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.展开更多
Multi-objective evolutionary algorithms(MOEAs) are typically used to optimize two or three objectives in the accelerator field and perform well. However, the performance of these algorithms may severely deteriorate wh...Multi-objective evolutionary algorithms(MOEAs) are typically used to optimize two or three objectives in the accelerator field and perform well. However, the performance of these algorithms may severely deteriorate when the optimization objectives for an accelerator are equal to or greater than four. Recently, many-objective evolutionary algorithms(MaOEAs)that can solve problems with four or more optimization objectives have received extensive attention. In this study, two diffraction-limited storage ring(DLSR) lattices of the Extremely Brilliant Source(ESRF-EBS) type with different energies were designed and optimized using three MaOEAs and a widely used MOEA. The initial population was found to have a significant impact on the performance of the algorithms and was carefully studied. The performances of the four algorithms were compared, and the results demonstrated that the grid-based evolutionary algorithm(GrEA) had the best performance.Ma OEAs were applied in many-objective optimization of DLSR lattices for the first time, and lattices with natural emittances of 116 and 23 pm·rad were obtained at energies of 2 and 6 GeV, respectively, both with reasonable dynamic aperture and local momentum aperture(LMA). This work provides a valuable reference for future many-objective optimization of DLSRs.展开更多
In recent years,the development of new types of nuclear reactors,such as transportable,marine,and space reactors,has presented new challenges for the optimization of reactor radiation-shielding design.Shielding struct...In recent years,the development of new types of nuclear reactors,such as transportable,marine,and space reactors,has presented new challenges for the optimization of reactor radiation-shielding design.Shielding structures typically need to be lightweight,miniaturized,and radiation-protected,which is a multi-parameter and multi-objective optimization problem.The conventional multi-objective(two or three objectives)optimization method for radiation-shielding design exhibits limitations for a number of optimization objectives and variable parameters,as well as a deficiency in achieving a global optimal solution,thereby failing to meet the requirements of shielding optimization for newly developed reactors.In this study,genetic and artificial bee-colony algorithms are combined with a reference-point-selection strategy and applied to the many-objective(having four or more objectives)optimal design of reactor radiation shielding.To validate the reliability of the methods,an optimization simulation is conducted on three-dimensional shielding structures and another complicated shielding-optimization problem.The numerical results demonstrate that the proposed algorithms outperform conventional shielding-design methods in terms of optimization performance,and they exhibit their reliability in practical engineering problems.The many-objective optimization algorithms developed in this study are proven to efficiently and consistently search for Pareto-front shielding schemes.Therefore,the algorithms proposed in this study offer novel insights into improving the shielding-design performance and shielding quality of new reactor types.展开更多
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.展开更多
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.展开更多
In this paper,we propose a three-term conjugate gradient method for solving unconstrained optimization problems based on the Hestenes-Stiefel(HS)conjugate gradient method and Polak-Ribiere-Polyak(PRP)conjugate gradien...In this paper,we propose a three-term conjugate gradient method for solving unconstrained optimization problems based on the Hestenes-Stiefel(HS)conjugate gradient method and Polak-Ribiere-Polyak(PRP)conjugate gradient method.Under the condition of standard Wolfe line search,the proposed search direction is the descent direction.For general nonlinear functions,the method is globally convergent.Finally,numerical results show that the proposed method is efficient.展开更多
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.展开更多
Single-pixel imaging(SPI)enables efficient sensing in challenging conditions.However,the requirement for numerous samplings constrains its practicality.We address the challenge of high-quality SPI reconstruction at ul...Single-pixel imaging(SPI)enables efficient sensing in challenging conditions.However,the requirement for numerous samplings constrains its practicality.We address the challenge of high-quality SPI reconstruction at ultra-low sampling rates.We develop an alternative optimization with physics and a data-driven diffusion network(APD-Net).It features alternative optimization driven by the learned task-agnostic natural image prior and the task-specific physics prior.During the training stage,APD-Net harnesses the power of diffusion models to capture data-driven statistics of natural signals.In the inference stage,the physics prior is introduced as corrective guidance to ensure consistency between the physics imaging model and the natural image probability distribution.Through alternative optimization,APD-Net reconstructs data-efficient,high-fidelity images that are statistically and physically compliant.To accelerate reconstruction,initializing images with the inverse SPI physical model reduces the need for reconstruction inference from 100 to 30 steps.Through both numerical simulations and real prototype experiments,APD-Net achieves high-quality,full-color reconstructions of complex natural images at a low sampling rate of 1%.In addition,APD-Net’s tuning-free nature ensures robustness across various imaging setups and sampling rates.Our research offers a broadly applicable approach for various applications,including but not limited to medical imaging and industrial inspection.展开更多
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.展开更多
基金supported by National Natural Science Foundation of China(Grant No.61806138)the Central Government Guides Local Science and Technology Development Funds(Grant No.YDZJSX2021A038)+2 种基金Key RD Program of Shanxi Province(International Cooperation)under Grant No.201903D421048Outstanding Innovation Project for Graduate Students of Taiyuan University of Science and Technology(Project No.XCX211004)China University Industry-University-Research Collaborative Innovation Fund(Future Network Innovation Research and Application Project)(Grant 2021FNA04014).
文摘Due to the security and scalability features of hybrid cloud architecture,it can bettermeet the diverse requirements of users for cloud services.And a reasonable resource allocation solution is the key to adequately utilize the hybrid cloud.However,most previous studies have not comprehensively optimized the performance of hybrid cloud task scheduling,even ignoring the conflicts between its security privacy features and other requirements.Based on the above problems,a many-objective hybrid cloud task scheduling optimization model(HCTSO)is constructed combining risk rate,resource utilization,total cost,and task completion time.Meanwhile,an opposition-based learning knee point-driven many-objective evolutionary algorithm(OBL-KnEA)is proposed to improve the performance of model solving.The algorithm uses opposition-based learning to generate initial populations for faster convergence.Furthermore,a perturbation-based multipoint crossover operator and a dynamic range mutation operator are designed to extend the search range.By comparing the experiments with other excellent algorithms on HCTSO,OBL-KnEA achieves excellent results in terms of evaluation metrics,initial populations,and model optimization effects.
基金supported in part by the National Natural Science Foundation of China(51775385)the Natural Science Foundation of Shanghai(23ZR1466000)+3 种基金the Shanghai Industrial Collaborative Science and Technology Innovation Project(2021-cyxt2-kj10)the Innovation Program of Shanghai Municipal Education Commission(202101070007E00098)the Innovation Project of Engineering Research Center of Integration and Application of Digital Learning Technology of MOE(1221046)the Program to Cultivate Middle-Aged and Young Cadre Teacher of Jiangsu Province。
文摘In solving many-objective optimization problems(MaO Ps),existing nondominated sorting-based multi-objective evolutionary algorithms suffer from the fast loss of selection pressure.Most candidate solutions become nondominated during the evolutionary process,thus leading to the failure of producing offspring toward Pareto-optimal front with diversity.Can we find a more effective way to select nondominated solutions and resolve this issue?To answer this critical question,this work proposes to evolve solutions through line complex rather than solution points in Euclidean space.First,Plücker coordinates are used to project solution points to line complex composed of position vectors and momentum ones.Besides position vectors of the solution points,momentum vectors are used to extend the comparability of nondominated solutions and enhance selection pressure.Then,a new distance function designed for high-dimensional space is proposed to replace Euclidean distance as a more effective distancebased estimator.Based on them,a novel many-objective evolutionary algorithm(MaOEA)is proposed by integrating a line complex-based environmental selection strategy into the NSGAⅢframework.The proposed algorithm is compared with the state of the art on widely used benchmark problems with up to 15 objectives.Experimental results demonstrate its superior competitiveness in solving MaOPs.
基金supported by the National Natural Science Foundation of ChinaNatural Science Foundation of Zhejiang Province (52077203,LY19E070003)the Fundamental Research Funds for the Provincial Universities of Zhejiang (2021YW06)。
文摘The two-archive 2 algorithm(Two_Arch2) is a manyobjective evolutionary algorithm for balancing the convergence,diversity,and complexity using diversity archive(DA) and convergence archive(CA).However,the individuals in DA are selected based on the traditional Pareto dominance which decreases the selection pressure in the high-dimensional problems.The traditional algorithm even cannot converge due to the weak selection pressure.Meanwhile,Two_Arch2 adopts DA as the output of the algorithm which is hard to maintain diversity and coverage of the final solutions synchronously and increase the complexity of the algorithm.To increase the evolutionary pressure of the algorithm and improve distribution and convergence of the final solutions,an ε-domination based Two_Arch2 algorithm(ε-Two_Arch2) for many-objective problems(MaOPs) is proposed in this paper.In ε-Two_Arch2,to decrease the computational complexity and speed up the convergence,a novel evolutionary framework with a fast update strategy is proposed;to increase the selection pressure,ε-domination is assigned to update the individuals in DA;to guarantee the uniform distribution of the solution,a boundary protection strategy based on I_(ε+) indicator is designated as two steps selection strategies to update individuals in CA.To evaluate the performance of the proposed algorithm,a series of benchmark functions with different numbers of objectives is solved.The results demonstrate that the proposed method is competitive with the state-of-the-art multi-objective evolutionary algorithms and the efficiency of the algorithm is significantly improved compared with Two_Arch2.
基金supported by the Shenzhen Innovation Technology Program(JCYJ20160422112909302)
文摘Many-objective optimization problems take challenges to multi-objective evolutionary algorithms.A number of nondominated solutions in population cause a difficult selection towards the Pareto front.To tackle this issue,a series of indicatorbased multi-objective evolutionary algorithms(MOEAs)have been proposed to guide the evolution progress and shown promising performance.This paper proposes an indicator-based manyobjective evolutionary algorithm calledε-indicator-based shuffled frog leaping algorithm(ε-MaOSFLA),which adopts the shuffled frog leaping algorithm as an evolutionary strategy and a simple and effectiveε-indicator as a fitness assignment scheme to press the population towards the Pareto front.Compared with four stateof-the-art MOEAs on several standard test problems with up to 50 objectives,the experimental results show thatε-MaOSFLA outperforms the competitors.
基金supported by the National Natural Science Foundation of China(Grant No.61976101)the University Natural Science Research Project of Anhui Province(Grant No.2023AH040056)+4 种基金the Natural Science Research Project of Anhui Province(Graduate Research Project,Grant No.YJS20210463)the Funding Plan for Scientic Research Activities of Academic and Technical Leaders and Reserve Candidates in Anhui Province(Grant No.2021H264)the Top Talent Project of Disciplines(Majors)in Colleges and Universities in Anhui Province(Grant No.gxbjZD2022021)the University Synergy Innovation Program of Anhui Province,China(GXXT-2022-033)supported by the Innovation Fund for Postgraduates of Huaibei Normal University(Grant Nos.cx2022041,yx2021023,CX2023043).
文摘It is still a huge challenge for traditional Pareto-dominatedmany-objective optimization algorithms to solve manyobjective optimization problems because these algorithms hardly maintain the balance between convergence and diversity and can only find a group of solutions focused on a small area on the Pareto front,resulting in poor performance of those algorithms.For this reason,we propose a reference vector-assisted algorithmwith an adaptive niche dominance relation,for short MaOEA-AR.The new dominance relation forms a niche based on the angle between candidate solutions.By comparing these solutions,the solutionwith the best convergence is found to be the non-dominated solution to improve the selection pressure.In reproduction,a mutation strategy of k-bit crossover and hybrid mutation is used to generate high-quality offspring.On 23 test problems with up to 15-objective,we compared the proposed algorithm with five state-of-the-art algorithms.The experimental results verified that the proposed algorithm is competitive.
基金supported by the State Key Program of National Natural Science Foundation of China(No.51437006)Guangdong Innovative Research Team Program(No.201001N0104744201)
文摘This paper develops a many-objective optimization model, which contains objectives representing the interests of the electricity and gas networks, as well as the distributed district heating and cooling units, to coordinate the benefits of all parties participated in the integrated energy system(IES). In order to solve the many-objective optimization model efficiently, an improved objective reduction(IOR) approach is proposed, aiming at acquiring the smallest set of objectives. The IOR approach utilizes the Spearman’s rank correlation coefficient to measure the relationship between objectives based on the Pareto-optimal front captured by the multi-objective group search optimizer with adaptive covariance and Lévy flights algorithm, and adopts various strategies to reduce the number of objectives gradually. Simulation studies are conducted on an IES consisting of a modified IEEE 30-bus electricity network and a 15-node gas network. The results show that the many-objective optimization problem is transformed into a bi-objective formulation by the IOR. Furthermore,our approach improves the overall quality of dispatch solutions and alleviates the decision making burden.
基金supported by the Key-Area Research and Development Program of Guangdong Province(2020B010166004)Natural Science Foundation of China(52007066).
文摘Large-scale cooling energy system has developed well in the past decade.However,its optimization is still a problem to be tackled due to the nonlinearity and large scale of existing systems.Reducing the scale of problems without oversimplifying the actual system model is a big challenge nowadays.This paper proposes a dimension reduction-based many-objective optimization(DRMO)method to solve an accurate nonlinear model of a practical large-scale cooling energy system.In the first stage,many-objective and many-variable of the large system are pre-processed to reduce the overall scale of the optimization problem.The relationships between many objectives are analyzed to find a few representative objectives.Key control variables are extracted to reduce the dimension of variables and the number of equality constraints.In the second stage,the manyobjective group search optimization(GSO)method is used to solve the low-dimensional nonlinear model,and a Pareto-front is obtained.In the final stage,candidate solutions along the Paretofront are graded on many-objective levels of system operators.The candidate solution with the highest average utility value is selected as the best running mode.Simulations are carried out on a 619-node-614-branch cooling system,and results show the ability of the proposed method in solving large-scale system operation problems.
基金The authors would like to thank the editor and the reviewers for helpful comments that greatly improved the paper. This work was supported by the National Natural Science Foundation of China （Grant Nos. 613731 l 1, 61272279, 61003199 and 61203303） the Fundamental Re- search Funds for the Central Universities （K50511020014, K5051302084, K50510020011, K5051302049 and K5051302023）+1 种基金 the Fund for Foreign Scholars in University Research and Teaching Programs （the 111 Project） （B07048） and the Program for New Century Excellent Talents in University （NCET- 12-0920）.
文摘In this paper, a new preference multi-objective optimization algorithm called immune clone algorithm based on reference direction method （RD-ICA） is proposed for solving many-objective optimization problems. First, an intelligent recombination operator, which performs well on the functions comprising many parameters, is introduced into an immune clone algorithm so as to explore the potentially excellent gene segments of all individuals in the antibody pop- ulation. Second, a reference direction method, a very strict ranking based on the desire of decision makers （DMs）, is used to guide selection and clone of the active population. Then a light beam search （LBS） is borrowed to pick out a small set of individuals filling the external population. The proposed method has been extensively compared with other recently proposed evolutionary multi-objective optimization （EMO） approaches over DTLZ problems with from 4 to 100 objectives. Experimental results indicate RD-ICA can achieve competitive results.
基金This work was supported by the National Key Research and Development Program of China(No.2018YFC1604000)the National Natural Science Foundation of China(Nos.61806138,61772478,U1636220,61961160707,and 61976212)+2 种基金the Key R&D Program of Shanxi Province(High Technology)(No.201903D121119)the Key R&D Program of Shanxi Province(International Cooperation)(No.201903D421048)the Key R&D Program(International Science and Technology Cooperation Project)of Shanxi Province,China(No.201903D421003).
文摘With the increase of problem dimensions,most solutions of existing many-objective optimization algorithms are non-dominant.Therefore,the selection of individuals and the retention of elite individuals are important.Existing algorithms cannot provide sufficient solution precision and guarantee the diversity and convergence of solution sets when solving practical many-objective industrial problems.Thus,this work proposes an improved many-objective pigeon-inspired optimization(ImMAPIO)algorithm with multiple selection strategies to solve many-objective optimization problems.Multiple selection strategies integrating hypervolume,knee point,and vector angles are utilized to increase selection pressure to the true Pareto Front.Thus,the accuracy,convergence,and diversity of solutions are improved.ImMAPIO is applied to the DTLZ and WFG test functions with four to fifteen objectives and compared against NSGA-III,GrEA,MOEA/D,RVEA,and many-objective Pigeon-inspired optimization algorithm.Experimental results indicate the superiority of ImMAPIO on these test functions.
基金supported in part by the National Natural Science Foundation of China(No.62172110)the Natural Science Foundation of Guangdong Province(Nos.2021A1515011839 and 2022A1515010130)the Programme of Science and Technology of Guangdong Province(No.2021A0505110004).
文摘Evolutionary algorithm is an effective strategy for solving many-objective optimization problems.At present,most evolutionary many-objective algorithms are designed for solving many-objective optimization problems where the objectives conflict with each other.In some cases,however,the objectives are not always in conflict.It consists of multiple independent objective subsets and the relationship between objectives is unknown in advance.The classical evolutionary many-objective algorithms may not be able to effectively solve such problems.Accordingly,we propose an objective set decomposition strategy based on the partial set covering model.It decomposes the objectives into a collection of objective subsets to preserve the nondominance relationship as much as possible.An optimization subproblem is defined on each objective subset.A coevolutionary algorithm is presented to optimize all subproblems simultaneously,in which a nondominance ranking is presented to interact information among these sub-populations.The proposed algorithm is compared with five popular many-objective evolutionary algorithms and four objective set decomposition based evolutionary algorithms on a series of test problems.Numerical experiments demonstrate that the proposed algorithm can achieve promising results for the many-objective optimization problems with independent and harmonious objectives.
基金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.
文摘Multi-objective evolutionary algorithms(MOEAs) are typically used to optimize two or three objectives in the accelerator field and perform well. However, the performance of these algorithms may severely deteriorate when the optimization objectives for an accelerator are equal to or greater than four. Recently, many-objective evolutionary algorithms(MaOEAs)that can solve problems with four or more optimization objectives have received extensive attention. In this study, two diffraction-limited storage ring(DLSR) lattices of the Extremely Brilliant Source(ESRF-EBS) type with different energies were designed and optimized using three MaOEAs and a widely used MOEA. The initial population was found to have a significant impact on the performance of the algorithms and was carefully studied. The performances of the four algorithms were compared, and the results demonstrated that the grid-based evolutionary algorithm(GrEA) had the best performance.Ma OEAs were applied in many-objective optimization of DLSR lattices for the first time, and lattices with natural emittances of 116 and 23 pm·rad were obtained at energies of 2 and 6 GeV, respectively, both with reasonable dynamic aperture and local momentum aperture(LMA). This work provides a valuable reference for future many-objective optimization of DLSRs.
基金supported by the National Natural Science Foundation of China(Nos.12475174 and 12175101)Yue Lu Shan Center Industrial Innovation(No.2024YCII0108)。
文摘In recent years,the development of new types of nuclear reactors,such as transportable,marine,and space reactors,has presented new challenges for the optimization of reactor radiation-shielding design.Shielding structures typically need to be lightweight,miniaturized,and radiation-protected,which is a multi-parameter and multi-objective optimization problem.The conventional multi-objective(two or three objectives)optimization method for radiation-shielding design exhibits limitations for a number of optimization objectives and variable parameters,as well as a deficiency in achieving a global optimal solution,thereby failing to meet the requirements of shielding optimization for newly developed reactors.In this study,genetic and artificial bee-colony algorithms are combined with a reference-point-selection strategy and applied to the many-objective(having four or more objectives)optimal design of reactor radiation shielding.To validate the reliability of the methods,an optimization simulation is conducted on three-dimensional shielding structures and another complicated shielding-optimization problem.The numerical results demonstrate that the proposed algorithms outperform conventional shielding-design methods in terms of optimization performance,and they exhibit their reliability in practical engineering problems.The many-objective optimization algorithms developed in this study are proven to efficiently and consistently search for Pareto-front shielding schemes.Therefore,the algorithms proposed in this study offer novel insights into improving the shielding-design performance and shielding quality of new reactor types.
基金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 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 Science and Technology Project of Guangxi(Guike AD23023002)。
文摘In this paper,we propose a three-term conjugate gradient method for solving unconstrained optimization problems based on the Hestenes-Stiefel(HS)conjugate gradient method and Polak-Ribiere-Polyak(PRP)conjugate gradient method.Under the condition of standard Wolfe line search,the proposed search direction is the descent direction.For general nonlinear functions,the method is globally convergent.Finally,numerical results show that the proposed method is efficient.
基金supported by 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.
基金upported by the National Natural Science Foundation of China(Grant No.62305184)the Major Key Project of Pengcheng Laboratory(Grant No.PCL2024A1)+1 种基金the Basic and Applied Basic Research Foundation of Guangdong Province(Grant No.2023A1515012932)the Science,Technology and Innovation Commission of Shenzhen Municipality(Grant No.WDZC20220818100259004).
文摘Single-pixel imaging(SPI)enables efficient sensing in challenging conditions.However,the requirement for numerous samplings constrains its practicality.We address the challenge of high-quality SPI reconstruction at ultra-low sampling rates.We develop an alternative optimization with physics and a data-driven diffusion network(APD-Net).It features alternative optimization driven by the learned task-agnostic natural image prior and the task-specific physics prior.During the training stage,APD-Net harnesses the power of diffusion models to capture data-driven statistics of natural signals.In the inference stage,the physics prior is introduced as corrective guidance to ensure consistency between the physics imaging model and the natural image probability distribution.Through alternative optimization,APD-Net reconstructs data-efficient,high-fidelity images that are statistically and physically compliant.To accelerate reconstruction,initializing images with the inverse SPI physical model reduces the need for reconstruction inference from 100 to 30 steps.Through both numerical simulations and real prototype experiments,APD-Net achieves high-quality,full-color reconstructions of complex natural images at a low sampling rate of 1%.In addition,APD-Net’s tuning-free nature ensures robustness across various imaging setups and sampling rates.Our research offers a broadly applicable approach for various applications,including but not limited to medical imaging and industrial inspection.
基金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.
