Individual Disturbance and Attraction Repulsion Strategy Enhanced Seagull Optimization for Engineering Design

The seagull optimization algorithm (SOA) is a novel swarm intelligence algorithm proposed in recent years. The algorithm has some defects in the search process. To overcome the problem of poor convergence accuracy and easy to fall into local optimality of seagull optimization algorithm, this paper proposed a new variant SOA based on individual disturbance (ID) and attraction-repulsion (AR) strategy, called IDARSOA, which employed ID to enhance the ability to jump out of local optimum and adopted AR to increase the diversity of population and make the exploration of solution space more efficient. The effectiveness of the IDARSOA has been verified using representative comprehensive benchmark functions and six practical engineering optimization problems. The experimental results show that the proposed IDARSOA has the advantages of better convergence accuracy and a strong optimization ability than the original SOA.

Comparison of parallel infill sampling criteria based on Kriging surrogate model

One of the key issues that affect the optimization effect of the efficient global optimization (EGO) algorithm is to determine the infill sampling criterion. Therefore, this paper compares the common efficient parallel infill sampling criterion. In addition, the pseudo-expected improvement (EI) criterion is introduced to minimizing the predicted (MP) criterion and the probability of improvement (PI) criterion, which helps to improve the problem of MP criterion that is easy to fall into local optimum. An adaptive distance function is proposed, which is used to avoid the concentration problem of update points and also improves the global search ability of the infill sampling criterion. Seven test problems were used to evaluate these criteria to verify the effectiveness of these methods. The results show that the pseudo method is also applicable to PI and MP criteria. The DMP and PEI criteria are the most efficient and robust. The actual engineering optimization problems can more directly show the effects of these methods. So these criteria are applied to the inverse design of RAE2822 airfoil. The results show the criterion including the MP has higher optimization efficiency.

Electricity Substitution Potential Prediction Based on Tent-CSO-CG-SSA-Improved SVM—A Case Study of China

Nowadays, fossil energy continues to dominate China’s energy usage; its inefficient use and large crude emissions of coal and fuel oil in its end-consumption have brought about great pressure to reduce emissions. Electrical power substitution as a development strategy is an important step toward achieving sustainable development, the transformation of the end-use energy consumption structure, and double carbon goals. To better guide the broad promotion of electrical power substitution, and to offer theoretical support for its development, this paper quantifies the amount of electrical power substitution and the influencing factors that affect the potential of electrical energy substitution. This paper proposes a hybrid model, combining Tent chaos mapping (Tent), chicken swarm optimization (CSO), Cauchy–Gaussian mutation (CG), the sparrow search algorithm (SSA), and a support vector machine (SVM), as a Tent-CSO-CG-SSA-SVM model, which first uses the method of Tent chaos mapping to initialize the sparrow population in order to increase population diversity and improve the search ability of the algorithm. Then, the CSO is introduced to update the positions of sparrows, and the CG method is introduced to make the algorithm jump out of the local optimum, in order to improve the global search ability of the SSA. Finally, the final electrical power substitution potential prediction model is obtained by optimizing the SVM through a multi-algorithm combination approach. To verify the validity of the model, two regions in China were used as case studies for the prediction analysis of electrical energy substitution potential, and the prediction results were compared with multiple models. The results of the study show that Tent-CSO-CG-SSA-SVM offers a good improvement in prediction accuracy, and that Tent-CSO-CG-SSA-SVM is a promising method for the prediction of electrical power substitution potential.

On Clustering Detection Based on a Quadratic Program in Hypergraphs

A proper cluster is usually defined as maximally coherent groups from a set of objects using pairwise or more complicated similarities. In general hypergraphs, clustering problem refers to extraction of subhypergraphs with a higher internal density, for instance, maximal cliques in hypergraphs. The determination of clustering structure within hypergraphs is a significant problem in the area of data mining. Various works of detecting clusters on graphs and uniform hypergraphs have been published in the past decades. Recently, it has been shown that the maximum 1,2 -clique size in 1,2 -hypergraphs is related to the global maxima of a certain quadratic program based on the structure of the given nonuniform hypergraphs. In this paper, we first extend this result to relate strict local maxima of this program to certain maximal cliques including 2-cliques or 1,2 -cliques. We also explore the connection between edge-weighted clusters and strictly local optimum solutions of a class of polynomials resulting from nonuniform 1,2 -hypergraphs.

An Elastic Collision Seeker Optimization Algorithm for Optimization Constrained Engineering Problems

To improve the seeker optimization algorithm (SOA), an elastic collision seeker optimization algorithm (ECSOA) was proposed. The ECSOA evolves some individuals in three situations: completely elastic collision, completely inelastic collision, and non-completely elastic collision. These strategies enhance the individuals’ diversity and avert falling into the local optimum. The ECSOA is compared with the particle swarm optimization (PSO), the simulated annealing and genetic algorithm (SA_GA), the gravitational search algorithm (GSA), the sine cosine algorithm (SCA), the multiverse optimizer (MVO), and the seeker optimization algorithm (SOA); then, fifteen benchmark functions, four PID control parameter models, and six constrained engineering optimization problems were selected for the experiment. According to the experimental results, the ECSOA can be used in the benchmark functions, the PID control parameter optimization, and the optimization constrained engineering problems. The optimization ability and robustness of ECSOA are better.

Path planning of patrol robot based on improved discrete electrostatic discharge algorithm

Safety is the premise of the stable and sustainable development of the chemical industry, safety accidents will not only cause casualties and economic losses, but also cause panic among workers and nearby residents. Robot safety inspection based on the fire risk level in a chemical industrial park can effectively reduce process accident losses and can even prevent accidents. The optimal inspection path is an important support for patrol efficiency, therefore, in this study, the fire risk level of each location to be inspected, which is obtained by the electrostatic discharge algorithm (ESDA)–nonparallel support vector machine evaluation model, is combined with the optimisation of the inspection path; that is, the fire risk level is used to guide the inspection path planning. The inspection path planning problem is a typical travelling salesman problem (TSP). The discrete ESDA (DESDA), based on the ESDA, is proposed. In view of the shortcomings of the long convergence time and ease of falling into the local optimum of the DESDA, further improvements are proposed in the form of the IDESDA, in which the greedy algorithm is used for the initial population, the 2-opt algorithm is applied to generate new solutions, and the elite set is joined to provide the best segment for jumping out of the local optimum. In the experiments, 11 public calculation examples were used to verify the algorithm performance. The IDESDA exhibited higher accuracy and better stability when solving the TSP. Its application to chemical industrial parks can effectively solve the path optimisation problem of patrol robots.

A Complex-Valued Encoding Multichain Seeker Optimization Algorithm for Engineering Problems

This article comes up with a complex-valued encoding multichain seeker optimization algorithm (CMSOA) for the engineering optimization problems. The complex-valued encoding strategy and the multichain strategy are leaded in the seeker optimization algorithm (SOA). These strategies enhance the individuals’ diversity, enhance the local search, avert falling into the local optimum, and are the influential global optimization strategies. This article chooses fifteen benchmark functions, four proportional integral derivative (PID) control parameter models, and six constrained engineering problems to test. According to the experimental results, the CMSOA can be used in the benchmark functions, in the PID control parameter optimization, and in the optimization of constrained engineering problems. Compared to the particle swarm optimization (PSO), simulated annealing based on genetic algorithm (SA_GA), gravitational search algorithm (GSA), sine cosine algorithm (SCA), multiverse optimizer (MVO), and seeker optimization algorithm (SOA), the optimization ability and robustness of the CMSOA are better than those of others algorithms.

Jiles-Atherton-Based Hysteresis Identification of Joint Resistant Torque in Active Spacesuit Using SA-PSO Algorithm

To eliminate the influence of spacesuits’ joint resistant torque on the operation of astronauts, an active spacesuit scheme based on the joint-assisted exoskeleton technology is proposed. Firstly, we develop a prototype of the upper limb exoskeleton robot and theoretically analyse the prototype to match astronauts’ motion behavior. Then, the Jiles-Atherton model is adopted to describe the hysteretic characteristic of joint resistant torque. Considering the parameter identification effects in the Jiles-Atherton model and the local optimum problem of the basic PSO (particle swarm optimization) algorithm, a SA- (simulated annealing-) PSO algorithm is proposed to identify the Jiles-Atherton model parameters. Compared with the modified PSO algorithm, the convergence rate of the designed SA-PSO algorithm is advanced by 6.25% and 20.29%, and the fitting accuracy is improved by 14.45% and 46.5% for upper limb joint model. Simulation results show that the identified J-A model can show good agreements with the measured experimental data and well predict the unknown joint resistance torque.

Multimodal Optimization with the Local Optimum Ranking 2 Algorithm

In optimization tasks, it is interesting to achieve a set of efficient solutions instead of one single output, in the case the best solution is not suitable. Many niching methods offer a diversified response, yet some important problems are common: (1) The most interesting solutions of each local optimum are not identified. Thus, the output is the overall population of solutions, which increases the work of the designer in verifying which solution is the most interesting. (2) Existing niching algorithms tend to distribute the solutions on the most promising regions, over-populating some local optima and sub-populating others, which leads to poor optimization.To solve these challenges, a novel niching method is presented, named local optimum ranking 2 (LOR2). This sorting methodology favors the exploration of a defined number of local optima and ranks each local population by objective value within each local optimum. Thus, is performed a multi-focus exploration, with an equalized number of solutions on each local optimum, while identifying which solutions are the local apices. To exemplify its application, the LOR2 algorithm is applied in the design optimization of a metallic cantilever beam. It achieves a set of efficient and diverse design configurations, offering both performance and diversity for structural design challenges.In addition, a second experiment describes how the algorithm can be applied to segment the domain of any function, into a mesh of similar sized or custom-sized elements. Thus, it can significantly simplify metamodels and reduce their computation time.

Multi-Gene Genetic Programming-Based Identification of a Dynamic Prediction Model of an Overhead Traveling Crane

This paper proposes a multi-gene genetic programming (MGGP) approach to identifying the dynamic prediction model for an overhead crane. The proposed method does not rely on expert knowledge of the system and therefore does not require a compromise between accuracy and complex, time-consuming modeling of nonlinear dynamics. MGGP is a multi-objective optimization problem, and both the mean square error (MSE) over the entire prediction horizon as well as the function complexity are minimized. In order to minimize the MSE an initial estimate of the gene weights is obtained by using the least squares approach, after which the Levenberg–Marquardt algorithm is used to find the local optimum for a k-step ahead predictor. The method was tested on both a simulation model obtained from the Euler–Lagrange equation with friction and the experimental stand. The simulation and the experimental stand were trained with varying control inputs, rope lengths and payload masses. The resulting predictor model was then validated on a testing set, and the results show the effectiveness of the proposed method.