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.

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.

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.

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.

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.

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.

An Improved JSO and Its Application in Spreader Optimization of Large Span Corridor Bridge

In this paper,given the shortcomings of jellyfish search algorithmwith low search ability in the early stage and easy to fall into local optimal solution,this paper introduces adaptive weight function and elite strategy,improving the global search scope in the early stage and the ability to refine the local development in the later stage.In the numerical study,the benchmark problem of dimensional optimization with a 10-bar truss structure and simultaneous dimensional shape optimization with a 15-bar truss structure is adopted,and the corresponding penalty method is used for constraint treatment.The test results show that the improved jellyfish search algorithm can provide better truss sections as well as weights.Because when the steel main truss of the large-span covered bridge is lifted,the site is limited and the large lifting equipment cannot enter the site,and the original structure does not meet the problem of stress concentration and large deformation of the bolt group,so the spreader is used to lift,and the improved jellyfish search algorithm is introduced into the design optimization of the spreader.The results show that the improved jellyfish algorithm can efficiently and accurately find out the optimal shape and weight of the spreader,and throughMidas Civil simulation,the spreader used canmeet the requirements of weight and safety.

Multi-Stage Multidisciplinary Design Optimization Method for Enhancing Complete Artillery Internal Ballistic Firing Performance

To enhance the comprehensive performance of artillery internal ballistics—encompassing power,accuracy,and service life—this study proposed a multi-stage multidisciplinary design optimization(MS-MDO)method.First,the comprehensive artillery internal ballistic dynamics(AIBD)model,based on propellant combustion,rotation band engraving,projectile axial motion,and rifling wear models,was established and validated.This model was systematically decomposed into subsystems from a system engineering perspective.The study then detailed the MS-MDO methodology,which included Stage I(MDO stage)employing an improved collaborative optimization method for consistent design variables,and Stage II(Performance Optimization)focusing on the independent optimization of local design variables and performance metrics.The methodology was applied to the AIBD problem.Results demonstrated that the MS-MDO method in Stage I effectively reduced iteration and evaluation counts,thereby accelerating system-level convergence.Meanwhile,Stage II optimization markedly enhanced overall performance.These comprehensive evaluation results affirmed the effectiveness of the MS-MDO method.

A Subdivision-Based Combined Shape and Topology Optimization in Acoustics

We propose a combined shape and topology optimization approach in this research for 3D acoustics by using the isogeometric boundary element method with subdivision surfaces.The existing structural optimization methods mainly contain shape and topology schemes,with the former changing the surface geometric profile of the structure and the latter changing thematerial distribution topology or hole topology of the structure.In the present acoustic performance optimization,the coordinates of the control points in the subdivision surfaces fine mesh are selected as the shape design parameters of the structure,the artificial density of the sound absorbing material covered on the structure surface is set as the topology design parameter,and the combined topology and shape optimization approach is established through the sound field analysis of the subdivision surfaces boundary element method as a bridge.The topology and shape sensitivities of the approach are calculated using the adjoint variable method,which ensures the efficiency of the optimization.The geometric jaggedness and material distribution discontinuities that appear in the optimization process are overcome to a certain degree by the multiresolution method and solid isotropic material with penalization.Numerical examples are given to validate the effectiveness of the presented optimization approach.

Enhancing Renewable Energy Integration:A Gaussian-Bare-Bones Levy Cheetah Optimization Approach to Optimal Power Flow in Electrical Networks

In the contemporary era,the global expansion of electrical grids is propelled by various renewable energy sources(RESs).Efficient integration of stochastic RESs and optimal power flow(OPF)management are critical for network optimization.This study introduces an innovative solution,the Gaussian Bare-Bones Levy Cheetah Optimizer(GBBLCO),addressing OPF challenges in power generation systems with stochastic RESs.The primary objective is to minimize the total operating costs of RESs,considering four functions:overall operating costs,voltage deviation management,emissions reduction,voltage stability index(VSI)and power loss mitigation.Additionally,a carbon tax is included in the objective function to reduce carbon emissions.Thorough scrutiny,using modified IEEE 30-bus and IEEE 118-bus systems,validates GBBLCO’s superior performance in achieving optimal solutions.Simulation results demonstrate GBBLCO’s efficacy in six optimization scenarios:total cost with valve point effects,total cost with emission and carbon tax,total cost with prohibited operating zones,active power loss optimization,voltage deviation optimization and enhancing voltage stability index(VSI).GBBLCO outperforms conventional techniques in each scenario,showcasing rapid convergence and superior solution quality.Notably,GBBLCO navigates complexities introduced by valve point effects,adapts to environmental constraints,optimizes costs while considering prohibited operating zones,minimizes active power losses,and optimizes voltage deviation by enhancing the voltage stability index(VSI)effectively.This research significantly contributes to advancing OPF,emphasizing GBBLCO’s improved global search capabilities and ability to address challenges related to local minima.GBBLCO emerges as a versatile and robust optimization tool for diverse challenges in power systems,offering a promising solution for the evolving needs of renewable energy-integrated power grids.

An Optimal Node Localization in WSN Based on Siege Whale Optimization Algorithm

Localization or positioning scheme in Wireless sensor networks (WSNs) is one of the most challenging andfundamental operations in various monitoring or tracking applications because the network deploys a large areaand allocates the acquired location information to unknown devices. The metaheuristic approach is one of themost advantageous ways to deal with this challenging issue and overcome the disadvantages of the traditionalmethods that often suffer from computational time problems and small network deployment scale. This studyproposes an enhanced whale optimization algorithm that is an advanced metaheuristic algorithm based on thesiege mechanism (SWOA) for node localization inWSN. The objective function is modeled while communicatingon localized nodes, considering variables like delay, path loss, energy, and received signal strength. The localizationapproach also assigns the discovered location data to unidentified devices with the modeled objective functionby applying the SWOA algorithm. The experimental analysis is carried out to demonstrate the efficiency of thedesigned localization scheme in terms of various metrics, e.g., localization errors rate, converges rate, and executedtime. Compared experimental-result shows that theSWOA offers the applicability of the developed model forWSNto perform the localization scheme with excellent quality. Significantly, the error and convergence values achievedby the SWOA are less location error, faster in convergence and executed time than the others compared to at least areduced 1.5% to 4.7% error rate, and quicker by at least 4%and 2% in convergence and executed time, respectivelyfor the experimental scenarios.

Smart Gait:A Gait Optimization Framework for Hexapod Robots

The current gait planning for legged robots is mostly based on human presets,which cannot match the flexible characteristics of natural mammals.This paper proposes a gait optimization framework for hexapod robots called Smart Gait.Smart Gait contains three modules:swing leg trajectory optimization,gait period&duty optimization,and gait sequence optimization.The full dynamics of a single leg,and the centroid dynamics of the overall robot are considered in the respective modules.The Smart Gait not only helps the robot to decrease the energy consumption when in locomotion,mostly,it enables the hexapod robot to determine its gait pattern transitions based on its current state,instead of repeating the formalistic clock-set step cycles.Our Smart Gait framework allows the hexapod robot to behave nimbly as a living animal when in 3D movements for the first time.The Smart Gait framework combines offline and online optimizations without any fussy data-driven training procedures,and it can run efficiently on board in real-time after deployment.Various experiments are carried out on the hexapod robot LittleStrong.The results show that the energy consumption is reduced by 15.9%when in locomotion.Adaptive gait patterns can be generated spontaneously both in regular and challenge environments,and when facing external interferences.

Urban Electric Vehicle Charging Station Placement Optimization with Graylag Goose Optimization Voting Classifier

To reduce the negative effects that conventional modes of transportation have on the environment,researchers are working to increase the use of electric vehicles.The demand for environmentally friendly transportation may be hampered by obstacles such as a restricted range and extended rates of recharge.The establishment of urban charging infrastructure that includes both fast and ultra-fast terminals is essential to address this issue.Nevertheless,the powering of these terminals presents challenges because of the high energy requirements,whichmay influence the quality of service.Modelling the maximum hourly capacity of each station based on its geographic location is necessary to arrive at an accurate estimation of the resources required for charging infrastructure.It is vital to do an analysis of specific regional traffic patterns,such as road networks,route details,junction density,and economic zones,rather than making arbitrary conclusions about traffic patterns.When vehicle traffic is simulated using this data and other variables,it is possible to detect limits in the design of the current traffic engineering system.Initially,the binary graylag goose optimization(bGGO)algorithm is utilized for the purpose of feature selection.Subsequently,the graylag goose optimization(GGO)algorithm is utilized as a voting classifier as a decision algorithm to allocate demand to charging stations while taking into consideration the cost variable of traffic congestion.Based on the results of the analysis of variance(ANOVA),a comprehensive summary of the components that contribute to the observed variability in the dataset is provided.The results of the Wilcoxon Signed Rank Test compare the actual median accuracy values of several different algorithms,such as the voting GGO algorithm,the voting grey wolf optimization algorithm(GWO),the voting whale optimization algorithm(WOA),the voting particle swarm optimization(PSO),the voting firefly algorithm(FA),and the voting genetic algorithm(GA),to the theoretical median that would be expected that there is no difference.

Multi-Strategy Assisted Multi-Objective Whale Optimization Algorithm for Feature Selection

In classification problems,datasets often contain a large amount of features,but not all of them are relevant for accurate classification.In fact,irrelevant features may even hinder classification accuracy.Feature selection aims to alleviate this issue by minimizing the number of features in the subset while simultaneously minimizing the classification error rate.Single-objective optimization approaches employ an evaluation function designed as an aggregate function with a parameter,but the results obtained depend on the value of the parameter.To eliminate this parameter’s influence,the problem can be reformulated as a multi-objective optimization problem.The Whale Optimization Algorithm(WOA)is widely used in optimization problems because of its simplicity and easy implementation.In this paper,we propose a multi-strategy assisted multi-objective WOA(MSMOWOA)to address feature selection.To enhance the algorithm’s search ability,we integrate multiple strategies such as Levy flight,Grey Wolf Optimizer,and adaptive mutation into it.Additionally,we utilize an external repository to store non-dominant solution sets and grid technology is used to maintain diversity.Results on fourteen University of California Irvine(UCI)datasets demonstrate that our proposed method effectively removes redundant features and improves classification performance.The source code can be accessed from the website:https://github.com/zc0315/MSMOWOA.

Development of Fixture Layout Optimization for Thin-Walled Parts:A Review

An increasing number of researchers have researched fixture layout optimization for thin-walled part assembly during the past decades.However,few papers systematically review these researches.By analyzing existing literature,this paper summarizes the process of fixture layout optimization and the methods applied.The process of optimization is made up of optimization objective setting,assembly variation/deformation modeling,and fixture layout optimization.This paper makes a review of the fixture layout for thin-walled parts according to these three steps.First,two different kinds of optimization objectives are introduced.Researchers usually consider in-plane variations or out-of-plane deformations when designing objectives.Then,modeling methods for assembly variation and deformation are divided into two categories:Mechanism-based and data-based methods.Several common methods are discussed respectively.After that,optimization algorithms are reviewed systematically.There are two kinds of optimization algorithms:Traditional nonlinear programming and heuristic algorithms.Finally,discussions on the current situation are provided.The research direction of fixture layout optimization in the future is discussed from three aspects:Objective setting,improving modeling accuracy and optimization algorithms.Also,a new research point for fixture layout optimization is discussed.This paper systematically reviews the research on fixture layout optimization for thin-walled parts,and provides a reference for future research in this field.

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.

A semantic vector map-based approach for aircraft positioning in GNSS/GPS denied large-scale environment

Accurate positioning is one of the essential requirements for numerous applications of remote sensing data,especially in the event of a noisy or unreliable satellite signal.Toward this end,we present a novel framework for aircraft geo-localization in a large range that only requires a downward-facing monocular camera,an altimeter,a compass,and an open-source Vector Map(VMAP).The algorithm combines the matching and particle filter methods.Shape vector and correlation between two building contour vectors are defined,and a coarse-to-fine building vector matching(CFBVM)method is proposed in the matching stage,for which the original matching results are described by the Gaussian mixture model(GMM).Subsequently,an improved resampling strategy is designed to reduce computing expenses with a huge number of initial particles,and a credibility indicator is designed to avoid location mistakes in the particle filter stage.An experimental evaluation of the approach based on flight data is provided.On a flight at a height of 0.2 km over a flight distance of 2 km,the aircraft is geo-localized in a reference map of 11,025 km~2using 0.09 km~2aerial images without any prior information.The absolute localization error is less than 10 m.