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.

An Adaptive Hybrid Optimization Strategy for Resource Allocation in Network Function Virtualization

With the rapid development of Network Function Virtualization(NFV),the problem of low resource utilizationin traditional data centers is gradually being addressed.However,existing research does not optimize both localand global allocation of resources in data centers.Hence,we propose an adaptive hybrid optimization strategy thatcombines dynamic programming and neural networks to improve resource utilization and service quality in datacenters.Our approach encompasses a service function chain simulation generator,a parallel architecture servicesystem,a dynamic programming strategy formaximizing the utilization of local server resources,a neural networkfor predicting the global utilization rate of resources and a global resource optimization strategy for bottleneck andredundant resources.With the implementation of our local and global resource allocation strategies,the systemperformance is significantly optimized through simulation.

A non-probabilistic reliability topology optimization method based on aggregation function and matrix multiplication considering buckling response constraints

A non-probabilistic reliability topology optimization method is proposed based on the aggregation function and matrix multiplication.The expression of the geometric stiffness matrix is derived,the finite element linear buckling analysis is conducted,and the sensitivity solution of the linear buckling factor is achieved.For a specific problem in linear buckling topology optimization,a Heaviside projection function based on the exponential smooth growth is developed to eliminate the gray cells.The aggregation function method is used to consider the high-order eigenvalues,so as to obtain continuous sensitivity information and refined structural design.With cyclic matrix programming,a fast topology optimization method that can be used to efficiently obtain the unit assembly and sensitivity solution is conducted.To maximize the buckling load,under the constraint of the given buckling load,two types of topological optimization columns are constructed.The variable density method is used to achieve the topology optimization solution along with the moving asymptote optimization algorithm.The vertex method and the matching point method are used to carry out an uncertainty propagation analysis,and the non-probability reliability topology optimization method considering buckling responses is developed based on the transformation of non-probability reliability indices based on the characteristic distance.Finally,the differences in the structural topology optimization under different reliability degrees are illustrated by examples.

A Hybrid Level Set Optimization Design Method of Functionally Graded Cellular Structures Considering Connectivity

With the continuous advancement in topology optimization and additive manufacturing(AM)technology,the capability to fabricate functionally graded materials and intricate cellular structures with spatially varying microstructures has grown significantly.However,a critical challenge is encountered in the design of these structures–the absence of robust interface connections between adjacent microstructures,potentially resulting in diminished efficiency or macroscopic failure.A Hybrid Level Set Method(HLSM)is proposed,specifically designed to enhance connectivity among non-uniform microstructures,contributing to the design of functionally graded cellular structures.The HLSM introduces a pioneering algorithm for effectively blending heterogeneous microstructure interfaces.Initially,an interpolation algorithm is presented to construct transition microstructures seamlessly connected on both sides.Subsequently,the algorithm enables the morphing of non-uniform unit cells to seamlessly adapt to interconnected adjacent microstructures.The method,seamlessly integrated into a multi-scale topology optimization framework using the level set method,exhibits its efficacy through numerical examples,showcasing its prowess in optimizing 2D and 3D functionally graded materials(FGM)and multi-scale topology optimization.In essence,the pressing issue of interface connections in complex structure design is not only addressed but also a robust methodology is introduced,substantiated by numerical evidence,advancing optimization capabilities in the realm of functionally graded materials and cellular structures.

Interface Design and Functional Optimization of Chinese Learning Apps Based on User Experience

This research paper investigates the interface design and functional optimization of Chinese learning apps through the lens of user experience.With the increasing popularity of Chinese language learning apps in the era of rapid mobile internet development,users'demands for enhanced interface design and interaction experience have grown significantly.The study aims to explore the influence of user feedback on the design and functionality of Chinese learning apps,proposing optimization strategies to improve user experience and learning outcomes.By conducting a comprehensive literature review,utilizing methods such as surveys and user interviews for data collection,and analyzing user feedback,this research identifies existing issues in the interface design and interaction experience of Chinese learning apps.The results present user opinions,feedback analysis,identified problems,improvement directions,and specific optimization strategies.The study discusses the potential impact of these optimization strategies on enhancing user experience and learning outcomes,compares findings with previous research,addresses limitations,and suggests future research directions.In conclusion,this research contributes to enriching the design theory of Chinese learning apps,offering practical optimization recommendations for developers,and supporting the continuous advancement of Chinese language learning apps.

Synergistic Swarm Optimization Algorithm

This research paper presents a novel optimization method called the Synergistic Swarm Optimization Algorithm(SSOA).The SSOA combines the principles of swarmintelligence and synergistic cooperation to search for optimal solutions efficiently.A synergistic cooperation mechanism is employed,where particles exchange information and learn from each other to improve their search behaviors.This cooperation enhances the exploitation of promising regions in the search space while maintaining exploration capabilities.Furthermore,adaptive mechanisms,such as dynamic parameter adjustment and diversification strategies,are incorporated to balance exploration and exploitation.By leveraging the collaborative nature of swarm intelligence and integrating synergistic cooperation,the SSOAmethod aims to achieve superior convergence speed and solution quality performance compared to other optimization algorithms.The effectiveness of the proposed SSOA is investigated in solving the 23 benchmark functions and various engineering design problems.The experimental results highlight the effectiveness and potential of the SSOA method in addressing challenging optimization problems,making it a promising tool for a wide range of applications in engineering and beyond.Matlab codes of SSOA are available at:https://www.mathworks.com/matlabcentral/fileexchange/153466-synergistic-swarm-optimization-algorithm.

A Feature Selection Method Based on Hybrid Dung Beetle Optimization Algorithm and Slap Swarm Algorithm

Feature Selection(FS)is a key pre-processing step in pattern recognition and data mining tasks,which can effectively avoid the impact of irrelevant and redundant features on the performance of classification models.In recent years,meta-heuristic algorithms have been widely used in FS problems,so a Hybrid Binary Chaotic Salp Swarm Dung Beetle Optimization(HBCSSDBO)algorithm is proposed in this paper to improve the effect of FS.In this hybrid algorithm,the original continuous optimization algorithm is converted into binary form by the S-type transfer function and applied to the FS problem.By combining the K nearest neighbor(KNN)classifier,the comparative experiments for FS are carried out between the proposed method and four advanced meta-heuristic algorithms on 16 UCI(University of California,Irvine)datasets.Seven evaluation metrics such as average adaptation,average prediction accuracy,and average running time are chosen to judge and compare the algorithms.The selected dataset is also discussed by categorizing it into three dimensions:high,medium,and low dimensions.Experimental results show that the HBCSSDBO feature selection method has the ability to obtain a good subset of features while maintaining high classification accuracy,shows better optimization performance.In addition,the results of statistical tests confirm the significant validity of the method.

Multiobjective Differential Evolution for Higher-Dimensional Multimodal Multiobjective Optimization

In multimodal multiobjective optimization problems(MMOPs),there are several Pareto optimal solutions corre-sponding to the identical objective vector.This paper proposes a new differential evolution algorithm to solve MMOPs with higher-dimensional decision variables.Due to the increase in the dimensions of decision variables in real-world MMOPs,it is diffi-cult for current multimodal multiobjective optimization evolu-tionary algorithms(MMOEAs)to find multiple Pareto optimal solutions.The proposed algorithm adopts a dual-population framework and an improved environmental selection method.It utilizes a convergence archive to help the first population improve the quality of solutions.The improved environmental selection method enables the other population to search the remaining decision space and reserve more Pareto optimal solutions through the information of the first population.The combination of these two strategies helps to effectively balance and enhance conver-gence and diversity performance.In addition,to study the per-formance of the proposed algorithm,a novel set of multimodal multiobjective optimization test functions with extensible decision variables is designed.The proposed MMOEA is certified to be effective through comparison with six state-of-the-art MMOEAs on the test functions.

MetaPINNs:Predicting soliton and rogue wave of nonlinear PDEs via the improved physics-informed neural networks based on meta-learned optimization

Efficiently solving partial differential equations(PDEs)is a long-standing challenge in mathematics and physics research.In recent years,the rapid development of artificial intelligence technology has brought deep learning-based methods to the forefront of research on numerical methods for partial differential equations.Among them,physics-informed neural networks(PINNs)are a new class of deep learning methods that show great potential in solving PDEs and predicting complex physical phenomena.In the field of nonlinear science,solitary waves and rogue waves have been important research topics.In this paper,we propose an improved PINN that enhances the physical constraints of the neural network model by adding gradient information constraints.In addition,we employ meta-learning optimization to speed up the training process.We apply the improved PINNs to the numerical simulation and prediction of solitary and rogue waves.We evaluate the accuracy of the prediction results by error analysis.The experimental results show that the improved PINNs can make more accurate predictions in less time than that of the original PINNs.

Improved Particle Swarm Optimization for Parameter Identification of Permanent Magnet Synchronous Motor

In the process of identifying parameters for a permanent magnet synchronous motor,the particle swarm optimization method is prone to being stuck in local optima in the later stages of iteration,resulting in low parameter accuracy.This work proposes a fuzzy particle swarm optimization approach based on the transformation function and the filled function.This approach addresses the topic of particle swarmoptimization in parameter identification from two perspectives.Firstly,the algorithm uses a transformation function to change the form of the fitness function without changing the position of the extreme point of the fitness function,making the extreme point of the fitness function more prominent and improving the algorithm’s search ability while reducing the algorithm’s computational burden.Secondly,on the basis of themulti-loop fuzzy control systembased onmultiplemembership functions,it is merged with the filled function to improve the algorithm’s capacity to skip out of the local optimal solution.This approach can be used to identify the parameters of permanent magnet synchronous motors by sampling only the stator current,voltage,and speed data.The simulation results show that the method can effectively identify the electrical parameters of a permanent magnet synchronous motor,and it has superior global convergence performance and robustness.

Distributed Stochastic Optimization with Compression for Non-Strongly Convex Objectives

We are investigating the distributed optimization problem,where a network of nodes works together to minimize a global objective that is a finite sum of their stored local functions.Since nodes exchange optimization parameters through the wireless network,large-scale training models can create communication bottlenecks,resulting in slower training times.To address this issue,CHOCO-SGD was proposed,which allows compressing information with arbitrary precision without reducing the convergence rate for strongly convex objective functions.Nevertheless,most convex functions are not strongly convex(such as logistic regression or Lasso),which raises the question of whether this algorithm can be applied to non-strongly convex functions.In this paper,we provide the first theoretical analysis of the convergence rate of CHOCO-SGD on non-strongly convex objectives.We derive a sufficient condition,which limits the fidelity of compression,to guarantee convergence.Moreover,our analysis demonstrates that within the fidelity threshold,this algorithm can significantly reduce transmission burden while maintaining the same convergence rate order as its no-compression equivalent.Numerical experiments further validate the theoretical findings by demonstrating that CHOCO-SGD improves communication efficiency and keeps the same convergence rate order simultaneously.And experiments also show that the algorithm fails to converge with low compression fidelity and in time-varying topologies.Overall,our study offers valuable insights into the potential applicability of CHOCO-SGD for non-strongly convex objectives.Additionally,we provide practical guidelines for researchers seeking to utilize this algorithm in real-world scenarios.

An adaptive machine learning-based optimization method in the aerodynamic analysis of a finite wing under various cruise conditions

Conventional wing aerodynamic optimization processes can be time-consuming and imprecise due to the complexity of versatile flight missions.Plenty of existing literature has considered two-dimensional infinite airfoil optimization,while three-dimensional finite wing optimizations are subject to limited study because of high computational costs.Here we create an adaptive optimization methodology built upon digitized wing shape deformation and deep learning algorithms,which enable the rapid formulation of finite wing designs for specific aerodynamic performance demands under different cruise conditions.This methodology unfolds in three stages:radial basis function interpolated wing generation,collection of inputs from computational fluid dynamics simulations,and deep neural network that constructs the surrogate model for the optimal wing configuration.It has been demonstrated that the proposed methodology can significantly reduce the computational cost of numerical simulations.It also has the potential to optimize various aerial vehicles undergoing different mission environments,loading conditions,and safety requirements.

A Cautionary Note on the Application of GIS in Spatial Optimization Modeling

Spatial optimization as part of spatial modeling has been facilitated significantly by integration with GIS techniques. However, for certain research topics, applying standard GIS techniques may create problems which require attention. This paper serves as a cautionary note to demonstrate two problems associated with applying GIS in spatial optimization, using a capacitated p-median facility location optimization problem as an example. The first problem involves errors in interpolating spatial variations of travel costs from using kriging, a common set of techniques for raster files. The second problem is inaccuracy in routing performed on a graph directly created from polyline shapefiles, a common vector file type. While revealing these problems, the paper also suggests remedies. Specifically, interpolation errors can be eliminated by using agent-based spatial modeling while the inaccuracy in routing can be improved through altering the graph topology by splitting the long edges of the shapefile. These issues suggest the need for caution in applying GIS in spatial optimization study.

Optimization and Characterization of Combined Degumming Process of Typha angustata L. Stem Fibers

Plant derived natural fibers have been widely investigated as alternatives to synthetic fibers in reinforcing polymers.Researchers over the years have explored many plant fibers using different extraction processes to study their physical,chemical,and mechanical properties.In this context,the present study relates to the extraction,characterization,and optimization of Typha angustata L.stem fibers.For this purpose,desirability functions and response surface methodology were applied to simultaneously optimize the diameter(D),linear density(LD);yield(Y),lignin fraction(L),and tenacity(T)of Typha stem fibers.Typha stems have been subjected to both alkali(NaOH)and enzymatic(pectinex ultra-SPL)treatments.Three levels of process variables including enzyme concentration(10,15,and 20 ml/L)and treatment duration(10,15,and 20 days)were used to design the experiments according to the factorial design.Experimental results were examined by analysis of variance and fitted to second order polynomial model using multiple regression analysis.The Derringer’s desirability function released that the values of process variables generating optimized diameter,linear density,yield,lignin ratio and tenacity are 20 ml/L and 20 days for concentration of pectinex ultra-SPL enzyme and treatment duration,respectively.Confirmation was performed and high degree of correlation was found between the experimental and statistical values.Moreover,the morphological structure has been investigated by the scanning electron microscope,showing a crenelated structure of ultimate fiber bundles of cellulose composing the Typha fiber.Compared to Typha stem non-treated fibers(TSNTF),Typha stem combined treated fibers(TSCTF),brings to improve mechanical properties.This change in mechanical properties is affected by modifying the fiber structure showing alpha cellulose of(66.86%)and lignin ratio of(10.83%)with a crystallinity index of(58.47%).

A Modified Lagrange Method for Solving Convex Quadratic Optimization Problems

In this paper, a modified version of the Classical Lagrange Multiplier method is developed for convex quadratic optimization problems. The method, which is evolved from the first order derivative test for optimality of the Lagrangian function with respect to the primary variables of the problem, decomposes the solution process into two independent ones, in which the primary variables are solved for independently, and then the secondary variables, which are the Lagrange multipliers, are solved for, afterward. This is an innovation that leads to solving independently two simpler systems of equations involving the primary variables only, on one hand, and the secondary ones on the other. Solutions obtained for small sized problems (as preliminary test of the method) demonstrate that the new method is generally effective in producing the required solutions.

An Improved Harris Hawk Optimization Algorithm

Aiming at the problems that the original Harris Hawk optimization algorithm is easy to fall into local optimum and slow in finding the optimum,this paper proposes an improved Harris Hawk optimization algorithm(GHHO).Firstly,we used a Gaussian chaotic mapping strategy to initialize the positions of individuals in the population,which enriches the initial individual species characteristics.Secondly,by optimizing the energy parameter and introducing the cosine strategy,the algorithm's ability to jump out of the local optimum is enhanced,which improves the performance of the algorithm.Finally,comparison experiments with other intelligent algorithms were conducted on 13 classical test function sets.The results show that GHHO has better performance in all aspects compared to other optimization algorithms.The improved algorithm is more suitable for generalization to real optimization problems.

Integrating Conjugate Gradients Into Evolutionary Algorithms for Large-Scale Continuous Multi-Objective Optimization

Large-scale multi-objective optimization problems(LSMOPs)pose challenges to existing optimizers since a set of well-converged and diverse solutions should be found in huge search spaces.While evolutionary algorithms are good at solving small-scale multi-objective optimization problems,they are criticized for low efficiency in converging to the optimums of LSMOPs.By contrast,mathematical programming methods offer fast convergence speed on large-scale single-objective optimization problems,but they have difficulties in finding diverse solutions for LSMOPs.Currently,how to integrate evolutionary algorithms with mathematical programming methods to solve LSMOPs remains unexplored.In this paper,a hybrid algorithm is tailored for LSMOPs by coupling differential evolution and a conjugate gradient method.On the one hand,conjugate gradients and differential evolution are used to update different decision variables of a set of solutions,where the former drives the solutions to quickly converge towards the Pareto front and the latter promotes the diversity of the solutions to cover the whole Pareto front.On the other hand,objective decomposition strategy of evolutionary multi-objective optimization is used to differentiate the conjugate gradients of solutions,and the line search strategy of mathematical programming is used to ensure the higher quality of each offspring than its parent.In comparison with state-of-the-art evolutionary algorithms,mathematical programming methods,and hybrid algorithms,the proposed algorithm exhibits better convergence and diversity performance on a variety of benchmark and real-world LSMOPs.

Modified Augmented Lagrange Multiplier Methods for Large-Scale Chemical Process Optimization

Chemical process optimization can be described as large-scale nonlinear constrained minimization. The modified augmented Lagrange multiplier methods (MALMM) for large-scale nonlinear constrained minimization are studied in this paper. The Lagrange function contains the penalty terms on equality and inequality constraints and the methods can be applied to solve a series of bound constrained sub-problems instead of a series of unconstrained sub-problems. The steps of the methods are examined in full detail. Numerical experiments are made for a variety of problems, from small to very large-scale, which show the stability and effectiveness of the methods in large-scale problems.