Multi-Objective Optimization Algorithm for Grouping Decision Variables Based on Extreme Point Pareto Frontier

The existing algorithms for solving multi-objective optimization problems fall into three main categories:Decomposition-based,dominance-based,and indicator-based.Traditional multi-objective optimization problemsmainly focus on objectives,treating decision variables as a total variable to solve the problem without consideringthe critical role of decision variables in objective optimization.As seen,a variety of decision variable groupingalgorithms have been proposed.However,these algorithms are relatively broad for the changes of most decisionvariables in the evolution process and are time-consuming in the process of finding the Pareto frontier.To solvethese problems,a multi-objective optimization algorithm for grouping decision variables based on extreme pointPareto frontier(MOEA-DV/EPF)is proposed.This algorithm adopts a preprocessing rule to solve the Paretooptimal solution set of extreme points generated by simultaneous evolution in various target directions,obtainsthe basic Pareto front surface to determine the convergence effect,and analyzes the convergence and distributioneffects of decision variables.In the later stages of algorithm optimization,different mutation strategies are adoptedaccording to the nature of the decision variables to speed up the rate of evolution to obtain excellent individuals,thusenhancing the performance of the algorithm.Evaluation validation of the test functions shows that this algorithmcan solve the multi-objective optimization problem more efficiently.

An Efficient Reliability-Based Optimization Method Utilizing High-Dimensional Model Representation and Weight-Point Estimation Method

The objective of reliability-based design optimization(RBDO)is to minimize the optimization objective while satisfying the corresponding reliability requirements.However,the nested loop characteristic reduces the efficiency of RBDO algorithm,which hinders their application to high-dimensional engineering problems.To address these issues,this paper proposes an efficient decoupled RBDO method combining high dimensional model representation(HDMR)and the weight-point estimation method(WPEM).First,we decouple the RBDO model using HDMR and WPEM.Second,Lagrange interpolation is used to approximate a univariate function.Finally,based on the results of the first two steps,the original nested loop reliability optimization model is completely transformed into a deterministic design optimization model that can be solved by a series of mature constrained optimization methods without any additional calculations.Two numerical examples of a planar 10-bar structure and an aviation hydraulic piping system with 28 design variables are analyzed to illustrate the performance and practicability of the proposed method.

Optimization of the Use of Spherical Targets for Point Cloud Registration Using Monte Carlo Simulation

Registrations based on the manual placement of spherical targets are still being employed by many professionals in the industry.However,the placement of those targets usually relies solely on personal experience without scientific evidence supported by numerical analysis.This paper presents a comprehensive investigation,based on Monte Carlo simulation,into determining the optimal number and positions for efficient target placement in typical scenes consisting of a pair of facades.It demonstrates new check-up statistical rules and geometrical constraints that can effectively extract and analyze massive simulations of unregistered point clouds and their corresponding registrations.More than 6×10^(7) sets of the registrations were simulated,whereas more than IOO registrations with real data were used to verify the results of simulation.The results indicated that using five spherical targets is the best choice for the registration of a large typical registration site consisting of two vertical facades and a ground,when there is only a box set of spherical targets available.As a result,the users can avoid placing extra targets to achieve insignificant improvements in registration accuracy.The results also suggest that the higher registration accuracy can be obtained when the ratio between the facade-to-target distance and target-to-scanner distance is approximately 3:2.Therefore,the targets should be placed closer to the scanner rather than in the middle between the facades and the scanner,contradicting to the traditional thought. Besides,the results reveal that the accuracy can be increased by setting the largest projected triangular area of the targets to be large.

Slope deformation partitioning and monitoring points optimization based on cluster analysis

The scientific and fair positioning of monitoring locations for surface displacement on slopes is a prerequisite for early warning and forecasting.However,there is no specific provision on how to effectively determine the number and location of monitoring points according to the actual deformation characteristics of the slope.There are still some defects in the layout of monitoring points.To this end,based on displacement data series and spatial location information of surface displacement monitoring points,by combining displacement series correlation and spatial distance influence factors,a spatial deformation correlation calculation model of slope based on clustering analysis was proposed to calculate the correlation between different monitoring points,based on which the deformation area of the slope was divided.The redundant monitoring points in each partition were eliminated based on the partition's outcome,and the overall optimal arrangement of slope monitoring points was then achieved.This method scientifically addresses the issues of slope deformation zoning and data gathering overlap.It not only eliminates human subjectivity from slope deformation zoning but also increases the efficiency and accuracy of slope monitoring.In order to verify the effectiveness of the method,a sand-mudstone interbedded CounterTilt excavation slope in the Chongqing city of China was used as the research object.Twenty-four monitoring points deployed on this slope were monitored for surface displacement for 13 months.The spatial location of the monitoring points was discussed.The results show that the proposed method of slope deformation zoning and the optimized placement of monitoring points are feasible.

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.

Current optimization-based control of dual three-phase PMSM for low-frequency temperature swing reduction

In this paper,a control scheme based on current optimization is proposed for dual three-phase permanent-magnet synchronous motor(DTP-PMSM)drive to reduce the low-frequency temperature swing.The reduction of temperature swing can be equivalent to reducing maximum instantaneous phase copper loss in this paper.First,a two-level optimization aiming at minimizing maximum instantaneous phase copper loss at each electrical angle is proposed.Then,the optimization is transformed to a singlelevel optimization by introducing the auxiliary variable for easy solving.Considering that singleobjective optimization trades a great total copper loss for a small reduction of maximum phase copper loss,the optimization considering both instantaneous total copper loss and maximum phase copper loss is proposed,which has the same performance of temperature swing reduction but with lower total loss.In this way,the proposed control scheme can reduce maximum junction temperature by 11%.Both simulation and experimental results are presented to prove the effectiveness and superiority of the proposed control scheme for low-frequency temperature swing reduction.

Multi-strategy hybrid whale optimization algorithms for complex constrained optimization problems

A multi-strategy hybrid whale optimization algorithm(MSHWOA)for complex constrained optimization problems is proposed to overcome the drawbacks of easily trapping into local optimum,slow convergence speed and low optimization precision.Firstly,the population is initialized by introducing the theory of good point set,which increases the randomness and diversity of the population and lays the foundation for the global optimization of the algorithm.Then,a novel linearly update equation of convergence factor is designed to coordinate the abilities of exploration and exploitation.At the same time,the global exploration and local exploitation capabilities are improved through the siege mechanism of Harris Hawks optimization algorithm.Finally,the simulation experiments are conducted on the 6 benchmark functions and Wilcoxon rank sum test to evaluate the optimization performance of the improved algorithm.The experimental results show that the proposed algorithm has more significant improvement in optimization accuracy,convergence speed and robustness than the comparison algorithm.

GNN Representation Learning and Multi-Objective Variable Neighborhood Search Algorithm for Wind Farm Layout Optimization

With the increasing demand for electrical services,wind farm layout optimization has been one of the biggest challenges that we have to deal with.Despite the promising performance of the heuristic algorithm on the route network design problem,the expressive capability and search performance of the algorithm on multi-objective problems remain unexplored.In this paper,the wind farm layout optimization problem is defined.Then,a multi-objective algorithm based on Graph Neural Network(GNN)and Variable Neighborhood Search(VNS)algorithm is proposed.GNN provides the basis representations for the following search algorithm so that the expressiveness and search accuracy of the algorithm can be improved.The multi-objective VNS algorithm is put forward by combining it with the multi-objective optimization algorithm to solve the problem with multiple objectives.The proposed algorithm is applied to the 18-node simulation example to evaluate the feasibility and practicality of the developed optimization strategy.The experiment on the simulation example shows that the proposed algorithm yields a reduction of 6.1% in Point of Common Coupling(PCC)over the current state-of-the-art algorithm,which means that the proposed algorithm designs a layout that improves the quality of the power supply by 6.1%at the same cost.The ablation experiments show that the proposed algorithm improves the power quality by more than 8.6% and 7.8% compared to both the original VNS algorithm and the multi-objective VNS algorithm.

Perceptual Optimization for Point-Based Point Cloud Rendering

Point-based rendering is a common method widely used in point cloud rendering.It realizes rendering by turning the points into the base geometry.The critical step in point-based rendering is to set an appropriate rendering radius for the base geometry,usually calculated using the average Euclidean distance of the N nearest neighboring points to the rendered point.This method effectively reduces the appearance of empty spaces between points in rendering.However,it also causes the problem that the rendering radius of outlier points far away from the central region of the point cloud sequence could be large,which impacts the perceptual quality.To solve the above problem,we propose an algorithm for point-based point cloud rendering through outlier detection to optimize the perceptual quality of rendering.The algorithm determines whether the detected points are outliers using a combination of local and global geometric features.For the detected outliers,the minimum radius is used for rendering.We examine the performance of the proposed method in terms of both objective quality and perceptual quality.The experimental results show that the peak signal-to-noise ratio(PSNR)of the point cloud sequences is improved under all geometric quantization,and the PSNR improvement ratio is more evident in dense point clouds.Specifically,the PSNR of the point cloud sequences is improved by 3.6%on average compared with the original algorithm.The proposed method significantly improves the perceptual quality of the rendered point clouds and the results of ablation studies prove the feasibility and effectiveness of the proposed method.

2D Minimum Compliance Topology Optimization Based on a Region Partitioning Strategy

This paper presents an extended sequential element rejection and admission(SERA)topology optimizationmethod with a region partitioning strategy.Based on the partitioning of a design domain into solid regions and weak regions,the proposed optimizationmethod sequentially implements finite element analysis(FEA)in these regions.After standard FEA in the solid regions,the boundary displacement of the weak regions is constrained using the numerical solution of the solid regions as Dirichlet boundary conditions.This treatment can alleviate the negative effect of the material interpolation model of the topology optimization method in the weak regions,such as the condition number of the structural global stiffness matrix.For optimization,in which the forward problem requires nonlinear structural analysis,a linear solver can be applied in weak regions to avoid numerical singularities caused by the over-deformedmesh.To enhance the robustness of the proposedmethod,the nonmanifold point and island are identified and handled separately.The performance of the proposed method is verified by three 2D minimum compliance examples.

Prediction of Flash Point Temperature of Organic Compounds Using a Hybrid Method of Group Contribution ＋ Neural Network ＋ Particle Swarm Optimization

The flash points of organic compounds were estimated using a hybrid method that includes a simple group contribution method (GCM) implemented in an artificial neural network (ANN) with particle swarm optimization (PSO). Different topologies of a multilayer neural network were studied and the optimum architecture was determined. Property data of 350 compounds were used for training the network. To discriminate different substances the molecular structures defined by the concept of the classical group contribution method were given as input variables. The capabilities of the network were tested with 155 substances not considered in the training step. The study shows that the proposed GCM+ANN+PSO method represent an excellent alternative for the estimation of flash points of organic compounds with acceptable accuracy (AARD = 1.8%; AAE = 6.2 K).

NEW APPROACH FOR RELIABILITY-BASED DESIGN OPTIMIZATION:MINIMUM ERROR POINT

Conventional reliability-based design optimization （RBDO） requires to use the most probable point （MPP） method for a probabilistic analysis of the reliability constraints. A new approach is presented, called as the minimum error point （MEP） method or the MEP based method, for reliability-based design optimization, whose idea is to minimize the error produced by approximating performance functions. The MEP based method uses the first order Taylor＇s expansion at MEP instead of MPP. Examples demonstrate that the MEP based design optimization can ensure product reliability at the required level, which is very imperative for many important engineering systems. The MEP based reliability design optimization method is feasible and is considered as an alternative for solving reliability design optimization problems. The MEP based method is more robust than the commonly used MPP based method for some irregular performance functions.

基于PointCloudTransformer和优化集成学习的三维点云分类

针对三维点云的不规则性和无序性所导致的难于提取特征并进行分类的问题,提出了一种融合深度学习和集成学习的三维点云分类方法。首先,训练深度学习点云分类网络PointCloudTransformer,并使用主干网络提取点云特征,进而训练基分类器,获得基分类器集合;然后,针对集成学习算法设计基分类器选择模型,模型的优化目标为基分类器组合的差异性和平均总体精度。为了降低集成规模,本文基于增强后的白鲸优化算法提出了二元多目标白鲸优化算法,并使用该算法优化基分类器选择模型,获得集成剪枝方案集合;最后,采用多数投票法集成每个基分类器组合在测试集点云特征上的分类结果,获得最优基分类器组合,从而构建基于多目标优化剪枝的集成学习点云分类模型。在点云分类数据集上的实验结果表明,本文方法使用了更小的集成规模,获得了更高的集成精度,能够对多类别三维点云进行准确分类。

DETERMINATION OF PERMANENT OPTIMAL DATA POINTS AND AN EFFICIENT ALGORITHM FOR LAD PROBLEM

This paper gives a definition of permanent optimal data point of Least Absolute Deviation(LAD)problem.Some theoretical results on non-degenerate LAD problem are obtained.For computing LAD problem,an efficient,algorithm is given according to the idea of permanent optimal data point.Numerical experience shows that our algorithm is better than many of others,including the famous B R algorithm.

A new primal-dual interior-point algorithm for convex quadratic optimization

In this paper, a new primal-dual interior-point algorithm for convex quadratic optimization （CQO） based on a kernel function is presented. The proposed function has some properties that are easy for checking. These properties enable us to improve the polynomial complexity bound of a large-update interior-point method （IPM） to O（√n log nlog n/e）, which is the currently best known polynomial complexity bound for the algorithm with the large-update method. Numerical tests were conducted to investigate the behavior of the algorithm with different parameters p, q and θ, where p is the growth degree parameter, q is the barrier degree of the kernel function and θ is the barrier update parameter.

THE CHARACTERIZATION OF EFFICIENCY AND SADDLE POINT CRITERIA FOR MULTIOBJECTIVE OPTIMIZATION PROBLEM WITH VANISHING CONSTRAINTS

In this article, we focus to study about modified objective function approach for multiobjective optimization problem with vanishing constraints. An equivalent η-approximated multiobjective optimization problem is constructed by a modification of the objective function in the original considered optimization problem. Furthermore, we discuss saddle point criteria for the aforesaid problem. Moreover, we present some examples to verify the established results.

Complexity analysis of interior-point algorithm based on a new kernel function for semidefinite optimization

Interior-point methods （IPMs） for linear optimization （LO） and semidefinite optimization （SDO） have become a hot area in mathematical programming in the last decades. In this paper, a new kernel function with simple algebraic expression is proposed. Based on this kernel function, a primal-dual interior-point methods （IPMs） for semidefinite optimization （SDO） is designed. And the iteration complexity of the algorithm as O（n^3/4 log n/ε） with large-updates is established. The resulting bound is better than the classical kernel function, with its iteration complexity O（n log n/ε） in large-updates case.

A class of polynomial primal-dual interior-point algorithms for semidefinite optimization

In the present paper we present a class of polynomial primal-dual interior-point algorithms for semidefmite optimization based on a kernel function. This kernel function is not a so-called self-regular function due to its growth term increasing linearly. Some new analysis tools were developed which can be used to deal with complexity ＂analysis of the algorithms which use analogous strategy in [5] to design the search directions for the Newton system. The complexity bounds for the algorithms with large- and small-update methodswere obtained, namely,O（qn^（p＋q/q（P＋1）log n/ε and O（q^2√n）log n/ε,respectlvely.

Optimization of block-floating-point realizations for digital controllers with finite-word-length considerations

The closed-loop stability issue of finite-precision realizations was investigated for digital control-lers implemented in block-floating-point format. The controller coefficient perturbation was analyzed resultingfrom using finite word length (FWL) block-floating-point representation scheme. A block-floating-point FWL closed-loop stability measure was derived which considers both the dynamic range and precision. To facilitate the design of optimal finite-precision controller realizations, a computationally tractable block-floating-point FWL closed-loop stability measure was then introduced and the method of computing the value of this measure for a given controller realization was developed. The optimal controller realization is defined as the solution that maximizes the corresponding measure, and a numerical optimization approach was adopted to solve the resulting optimal realization problem. A numerical example was used to illustrate the design procedure and to compare the optimal controller realization with the initial realization.

Optimization of Intraday Trading Strategy Based on ACD Rules and Pivot Point System in Chinese Market

Various trading strategies are applied in intraday high-frequency market to provide investors with reference signals to be on the right side of market at the right time. In this paper, we apply a trading strategy based on the combination of ACD rules and pivot points system, which is first proposed by Mark B. Fisher, into Chinese market. This strategy has been used by millions of traders to achieve substantial profits in the last two decades, however, discussions concerning on the methods of calculating specific entry point in this trading strategy are rare, which is crucial to this strategy. We suggest an improvement to this popular strategy, providing the calculating and optimizing methods in detail to verify its effectiveness in recent Chinese futures market. Because of the high liquidity and low commissions in stock index futures market, this trading strategy achieves substantial profits .However, given the less liquidity in commodity futures market, profits decrease and even be neutralized by the relatively high commissions.