A Two-Layer Encoding Learning Swarm Optimizer Based on Frequent Itemsets for Sparse Large-Scale Multi-Objective Optimization

Traditional large-scale multi-objective optimization algorithms(LSMOEAs)encounter difficulties when dealing with sparse large-scale multi-objective optimization problems(SLM-OPs)where most decision variables are zero.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.

Enhancing Evolutionary Algorithms With Pattern Mining for Sparse Large-Scale Multi-Objective Optimization Problems

Sparse large-scale multi-objective optimization problems(SLMOPs)are common in science and engineering.However,the large-scale problem represents the high dimensionality of the decision space,requiring algorithms to 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.

Large-Scale Multi-Objective Optimization Algorithm Based on Weighted Overlapping Grouping of Decision Variables

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.

Recent Advances in Reconfigurable Electromagnetic Surfaces:Engineering Design,Full-Wave Analysis,and Large-Scale Optimization

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.

A Fast Clustering Based Evolutionary Algorithm for Super-Large-Scale Sparse Multi-Objective Optimization

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.

A Chaotic Local Search-Based Particle Swarm Optimizer for Large-Scale Complex Wind Farm Layout Optimization

Wind energy has been widely applied in power generation to alleviate climate problems.The wind turbine layout of a wind farm is a primary factor of impacting power conversion efficiency due to the wake effect that reduces the power outputs of wind turbines located in downstream.Wind farm layout optimization(WFLO)aims to reduce the wake effect for maximizing the power outputs of the wind farm.Nevertheless,the wake effect among wind turbines increases significantly as the number of wind turbines increases in the wind farm,which severely affect power conversion efficiency.Conventional heuristic algorithms suffer from issues of low solution quality and local optimum for large-scale WFLO under complex wind scenarios.Thus,a chaotic local search-based genetic learning particle swarm optimizer(CGPSO)is proposed to optimize large-scale WFLO problems.CGPSO is tested on four larger-scale wind farms under four complex wind scenarios and compares with eight state-of-the-art algorithms.The experiment results indicate that CGPSO significantly outperforms its competitors in terms of performance,stability,and robustness.To be specific,a success and failure memories-based selection is proposed to choose a chaotic map for chaotic search local.It improves the solution quality.The parameter and search pattern of chaotic local search are also analyzed for WFLO problems.

A SUPERLINEARLY CONVERGENT SPLITTING FEASIBLE SEQUENTIAL QUADRATIC OPTIMIZATION METHOD FOR TWO-BLOCK LARGE-SCALE SMOOTH OPTIMIZATION

This paper discusses the two-block large-scale nonconvex optimization problem with general linear constraints.Based on the ideas of splitting and sequential quadratic optimization(SQO),a new feasible descent method for the discussed problem is proposed.First,we consider the problem of quadratic optimal(QO)approximation associated with the current feasible iteration point,and we split the QO into two small-scale QOs which can be solved in parallel.Second,a feasible descent direction for the problem is obtained and a new SQO-type method is proposed,namely,splitting feasible SQO(SF-SQO)method.Moreover,under suitable conditions,we analyse the global convergence,strong convergence and rate of superlinear convergence of the SF-SQO method.Finally,preliminary numerical experiments regarding the economic dispatch of a power system are carried out,and these show that the SF-SQO method is promising.

Applying Analytical Derivative and Sparse Matrix Techniques to Large-Scale Process Optimization Problems

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.

Enhanced Butterfly Optimization Algorithm for Large-Scale Optimization Problems

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.

Assessment of Wet Season Precipitation in the Central United States by the Regional Climate Simulation of the WRFG Member in NARCCAP and Its Relationship with Large-Scale Circulation Biases

Assessment of past-climate simulations of regional climate models(RCMs)is important for understanding the reliability of RCMs when used to project future regional climate.Here,we assess the performance and discuss possible causes of biases in a WRF-based RCM with a grid spacing of 50 km,named WRFG,from the North American Regional Climate Change Assessment Program(NARCCAP)in simulating wet season precipitation over the Central United States for a period when observational data are available.The RCM reproduces key features of the precipitation distribution characteristics during late spring to early summer,although it tends to underestimate the magnitude of precipitation.This dry bias is partially due to the model’s lack of skill in simulating nocturnal precipitation related to the lack of eastward propagating convective systems in the simulation.Inaccuracy in reproducing large-scale circulation and environmental conditions is another contributing factor.The too weak simulated pressure gradient between the Rocky Mountains and the Gulf of Mexico results in weaker southerly winds in between,leading to a reduction of warm moist air transport from the Gulf to the Central Great Plains.The simulated low-level horizontal convergence fields are less favorable for upward motion than in the NARR and hence,for the development of moist convection as well.Therefore,a careful examination of an RCM’s deficiencies and the identification of the source of errors are important when using the RCM to project precipitation changes in future climate scenarios.

Optimization Design of the Multi-Layer Cross-Sectional Layout of An Umbilical Based on the GA-GLM

Marine umbilical is one of the key equipment for subsea oil and gas exploitation,which is usually integrated by a great number of different functional components with multi-layers.The layout of these components directly affects manufacturing,operation and storage performances of the umbilical.For the multi-layer cross-sectional layout design of the umbilical,a quantifiable multi-objective optimization model is established according to the operation and storage requirements.Considering the manufacturing factors,the multi-layering strategy based on contact point identification is introduced for a great number of functional components.Then,the GA-GLM global optimization algorithm is proposed combining the genetic algorithm and the generalized multiplier method,and the selection operator of the genetic algorithm is improved based on the steepest descent method.Genetic algorithm is used to find the optimal solution in the global space,which can converge from any initial layout to the feasible layout solution.The feasible layout solution is taken as the initial value of the generalized multiplier method for fast and accurate solution.Finally,taking umbilicals with a great number of components as examples,the results show that the cross-sectional performance of the umbilical obtained by optimization algorithm is better and the solution efficiency is higher.Meanwhile,the multi-layering strategy is effective and feasible.The design method proposed in this paper can quickly obtain the optimal multi-layer cross-sectional layout,which replaces the manual design,and provides useful reference and guidance for the umbilical industry.

Frilled Lizard Optimization: A Novel Bio-Inspired Optimizer for Solving Engineering Applications

This research presents a novel nature-inspired metaheuristic algorithm called Frilled Lizard Optimization(FLO),which emulates the unique hunting behavior of frilled lizards in their natural habitat.FLO draws its inspiration from the sit-and-wait hunting strategy of these lizards.The algorithm’s core principles are meticulously detailed and mathematically structured into two distinct phases:(i)an exploration phase,which mimics the lizard’s sudden attack on its prey,and(ii)an exploitation phase,which simulates the lizard’s retreat to the treetops after feeding.To assess FLO’s efficacy in addressing optimization problems,its performance is rigorously tested on fifty-two standard benchmark functions.These functions include unimodal,high-dimensional multimodal,and fixed-dimensional multimodal functions,as well as the challenging CEC 2017 test suite.FLO’s performance is benchmarked against twelve established metaheuristic algorithms,providing a comprehensive comparative analysis.The simulation results demonstrate that FLO excels in both exploration and exploitation,effectively balancing these two critical aspects throughout the search process.This balanced approach enables FLO to outperform several competing algorithms in numerous test cases.Additionally,FLO is applied to twenty-two constrained optimization problems from the CEC 2011 test suite and four complex engineering design problems,further validating its robustness and versatility in solving real-world optimization challenges.Overall,the study highlights FLO’s superior performance and its potential as a powerful tool for tackling a wide range of optimization problems.

Towards the performance limit of catenary meta-optics via field-driven optimization

Catenary optics enables metasurfaces with higher efficiency and wider bandwidth,and is highly anticipated in the imaging system,super-resolution lithography,and broadband absorbers.However,the periodic boundary approximation without considering aperiodic electromagnetic crosstalk poses challenges for catenary optical devices to reach their performance limits.Here,perfect control of both local geometric and propagation phases is realized through field-driven optimization,in which the field distribution is calculated under real boundary conditions.Different from other optimization methods requiring a mass of iterations,the proposed design method requires less than ten iterations to get the efficiency close to the optimal value.Based on the library of shape-optimized catenary structures,centimeter-scale devices can be designed in ten seconds,with the performance improved by ~15%.Furthermore,this method has the ability to extend catenary-like continuous structures to arbitrary polarization,including both linear and elliptical polarizations,which is difficult to achieve with traditional design methods.It provides a way for the development of catenary optics and serves as a potent tool for constructing high-performance optical devices.

Rao Algorithms-Based Structure Optimization for Heterogeneous Wireless Sensor Networks

The structural optimization of wireless sensor networks is a critical issue because it impacts energy consumption and hence the network’s lifetime.Many studies have been conducted for homogeneous networks,but few have been performed for heterogeneouswireless sensor networks.This paper utilizes Rao algorithms to optimize the structure of heterogeneous wireless sensor networks according to node locations and their initial energies.The proposed algorithms lack algorithm-specific parameters and metaphorical connotations.The proposed algorithms examine the search space based on the relations of the population with the best,worst,and randomly assigned solutions.The proposed algorithms can be evaluated using any routing protocol,however,we have chosen the well-known routing protocols in the literature:Low Energy Adaptive Clustering Hierarchy(LEACH),Power-Efficient Gathering in Sensor Information Systems(PEAGSIS),Partitioned-based Energy-efficient LEACH(PE-LEACH),and the Power-Efficient Gathering in Sensor Information Systems Neural Network(PEAGSIS-NN)recent routing protocol.We compare our optimized method with the Jaya,the Particle Swarm Optimization-based Energy Efficient Clustering(PSO-EEC)protocol,and the hybrid Harmony Search Algorithm and PSO(HSA-PSO)algorithms.The efficiencies of our proposed algorithms are evaluated by conducting experiments in terms of the network lifetime(first dead node,half dead nodes,and last dead node),energy consumption,packets to cluster head,and packets to the base station.The experimental results were compared with those obtained using the Jaya optimization algorithm.The proposed algorithms exhibited the best performance.The proposed approach successfully prolongs the network lifetime by 71% for the PEAGSIS protocol,51% for the LEACH protocol,10% for the PE-LEACH protocol,and 73% for the PEGSIS-NN protocol;Moreover,it enhances other criteria such as energy conservation,fitness convergence,packets to cluster head,and packets to the base station.

Falcon Optimization Algorithm-Based Energy Efficient Communication Protocol for Cluster-Based Vehicular Networks

Rapid development in Information Technology(IT)has allowed several novel application regions like large outdoor vehicular networks for Vehicle-to-Vehicle(V2V)transmission.Vehicular networks give a safe and more effective driving experience by presenting time-sensitive and location-aware data.The communication occurs directly between V2V and Base Station(BS)units such as the Road Side Unit(RSU),named as a Vehicle to Infrastructure(V2I).However,the frequent topology alterations in VANETs generate several problems with data transmission as the vehicle velocity differs with time.Therefore,the scheme of an effectual routing protocol for reliable and stable communications is significant.Current research demonstrates that clustering is an intelligent method for effectual routing in a mobile environment.Therefore,this article presents a Falcon Optimization Algorithm-based Energy Efficient Communication Protocol for Cluster-based Routing(FOA-EECPCR)technique in VANETS.The FOA-EECPCR technique intends to group the vehicles and determine the shortest route in the VANET.To accomplish this,the FOA-EECPCR technique initially clusters the vehicles using FOA with fitness functions comprising energy,distance,and trust level.For the routing process,the Sparrow Search Algorithm(SSA)is derived with a fitness function that encompasses two variables,namely,energy and distance.A series of experiments have been conducted to exhibit the enhanced performance of the FOA-EECPCR method.The experimental outcomes demonstrate the enhanced performance of the FOA-EECPCR approach over other current methods.

Cooperative User-Scheduling and Resource Allocation Optimization for Intelligent Reflecting Surface Enhanced LEO Satellite Communication

Lower Earth Orbit(LEO) satellite becomes an important part of complementing terrestrial communication due to its lower orbital altitude and smaller propagation delay than Geostationary satellite. However, the LEO satellite communication system cannot meet the requirements of users when the satellite-terrestrial link is blocked by obstacles. To solve this problem, we introduce Intelligent reflect surface(IRS) for improving the achievable rate of terrestrial users in LEO satellite communication. We investigated joint IRS scheduling, user scheduling, power and bandwidth allocation(JIRPB) optimization algorithm for improving LEO satellite system throughput.The optimization problem of joint user scheduling and resource allocation is formulated as a non-convex optimization problem. To cope with this problem, the nonconvex optimization problem is divided into resource allocation optimization sub-problem and scheduling optimization sub-problem firstly. Second, we optimize the resource allocation sub-problem via alternating direction multiplier method(ADMM) and scheduling sub-problem via Lagrangian dual method repeatedly.Third, we prove that the proposed resource allocation algorithm based ADMM approaches sublinear convergence theoretically. Finally, we demonstrate that the proposed JIRPB optimization algorithm improves the LEO satellite communication system throughput.

Web Layout Design of Large Cavity Structures Based on Topology Optimization

Large cavity structures are widely employed in aerospace engineering, such as thin-walled cylinders, blades andwings. Enhancing performance of aerial vehicles while reducing manufacturing costs and fuel consumptionhas become a focal point for contemporary researchers. Therefore, this paper aims to investigate the topologyoptimization of large cavity structures as a means to enhance their performance, safety, and efficiency. By usingthe variable density method, lightweight design is achieved without compromising structural strength. Theoptimization model considers both concentrated and distributed loads, and utilizes techniques like sensitivityfiltering and projection to obtain a robust optimized configuration. The mechanical properties are checked bycomparing the stress distribution and displacement of the unoptimized and optimized structures under the sameload. The results confirm that the optimized structures exhibit improved mechanical properties, thus offering keyinsights for engineering lightweight, high-strength large cavity structures.

Multi-Material Topology Optimization for Spatial-Varying Porous Structures

This paper aims to propose a topology optimization method on generating porous structures comprising multiple materials.The mathematical optimization formulation is established under the constraints of individual volume fraction of constituent phase or total mass,as well as the local volume fraction of all phases.The original optimization problem with numerous constraints is converted into a box-constrained optimization problem by incorporating all constraints to the augmented Lagrangian function,avoiding the parameter dependence in the conventional aggregation process.Furthermore,the local volume percentage can be precisely satisfied.The effects including the globalmass bound,the influence radius and local volume percentage on final designs are exploited through numerical examples.The numerical results also reveal that porous structures keep a balance between the bulk design and periodic design in terms of the resulting compliance.All results,including those for irregular structures andmultiple volume fraction constraints,demonstrate that the proposedmethod can provide an efficient solution for multiple material infill structures.

Recent advances in cobalt phosphide-based materials for electrocatalytic water splitting:From catalytic mechanism and synthesis method to optimization design

Electrochemical water splitting has long been considered an effective energy conversion technology for trans-ferring intermittent renewable electricity into hydrogen fuel,and the exploration of cost-effective and high-performance electrocatalysts is crucial in making electrolyzed water technology commercially viable.Cobalt phosphide(Co-P)has emerged as a catalyst of high potential owing to its high catalytic activity and durability in water splitting.This paper systematically reviews the latest advances in the development of Co-P-based materials for use in water splitting.The essential effects of P in enhancing the catalytic performance of the hydrogen evolution reaction and oxygen evolution reaction are first outlined.Then,versatile synthesis techniques for Co-P electrocatalysts are summarized,followed by advanced strategies to enhance the electrocatalytic performance of Co-P materials,including heteroatom doping,composite construction,integration with well-conductive sub-strates,and structure control from the viewpoint of experiment.Along with these optimization strategies,the understanding of the inherent mechanism of enhanced catalytic performance is also discussed.Finally,some existing challenges in the development of highly active and stable Co-P-based materials are clarified,and pro-spective directions for prompting the wide commercialization of water electrolysis technology are proposed.

Synergetic optimization operation method for distribution network based on SOP and PV

The integration of distributed generation brings in new challenges for the operation of distribution networks,including out-of-limit voltage and power flow control.Soft open points(SOP)are new power electronic devices that can flexibly control active and reactive power flows.With the exception of active power output,photovoltaic(PV)devices can provide reactive power compensation through an inverter.Thus,a synergetic optimization operation method for SOP and PV in a distribution network is proposed.A synergetic optimization model was developed.The voltage deviation,network loss,and ratio of photovoltaic abandonment were selected as the objective functions.The PV model was improved by considering the three reactive power output modes of the PV inverter.Both the load fluctuation and loss of the SOP were considered.Three multi-objective optimization algorithms were used,and a compromise optimal solution was calculated.Case studies were conducted using an IEEE 33-node system.The simulation results indicated that the SOP and PVs complemented each other in terms of active power transmission and reactive power compensation.Synergetic optimization improves power control capability and flexibility,providing better power quality and PV consumption rate.