Improved Salp Swarm Algorithm with Space Transformation Search for Training Neural Network

Review of Approaches to Minimise the Cost of Simulation-Based Optimisation for Liquid Composite Moulding Processes

The utilisation of numerical process simulation has greatly facilitated the challenging task of liquid composite moulding (LCM) process optimisation, providing ease of solution evaluation at a significantly reduced cost compared to complete reliance on physical prototyping. However, due to the process complexity, such process simulation is still considerably expensive at present. In this paper, cost-saving approaches to minimising the computational cost of simulation-based optimisation for LCM processes are compiled and discussed. Their specific applicability, efficacy, and suitability for various optimisation/moulding scenarios are extensively explored in detail. The comprehensive analysation and assimilation of their operation alongside applicability for the problem domain of interest are accomplished in this paper to further complement and contribute to future simulation-based optimisation capabilities for composite moulding processes. The importance of balancing the cost-accuracy trade-off is also repeatedly emphasised, allowing for substantial cost reductions while ensuring a desirable level of optimization reliability.

Binary salp swarm algorithm for discounted {0-1} knapsack problem

While the classical knapsack problem has been the object to be solved by optimization algorithm proposals for many years, another version of this problem, discounted {0-1} knapsack problem, is gaining a lot of attention recently. The original knapsack problem requires selecting specific items from an item set to maximize the total benefit while ensuring that the total weight does not exceed the knapsack capacity. Meanwhile, discounted {0-1} knapsack problem has more stringent requirements in which items are divided into groups, and only up to one item from a particular group can be selected. This constraint, which does not exist in the original knapsack problem, makes discounted {0-1} knapsack problem even more challenging. In this paper, we propose a new algorithm based on salp swarm algorithm in the form of four different variants to resolve the discounted {0-1} knapsack problem. In addition, we also make use of an effective data modeling mechanism and a greedy repair operator that helps overcome local optima when finding the global optimal solution. Experimental and statistical results show that our algorithm is superior to currently available algorithms in terms of solution quality, convergence, and other statistical criteria.

Improved Salp Swarm Optimization Algorithm: Application in Feature Weighting for Blind Modulation Identification

In modulation identification issues, like in any other classification problem, the performance of the classification task is significantly impacted by the feature characteristics. Feature weighting boosts the performance of machine learning algorithms, particularly the class of instance-based learning algorithms such as the Minimum Distance (MD) classifier, in which the distance measure is highly sensitive to the magnitude of features. In this paper, we propose an improved version of the Salp Swarm optimization Algorithm (SSA), called ISSA, that will be applied to optimize feature weights for an MD classifier. The aim is to improve the performance of a blind digital modulation detection approach in the context of multiple-antenna systems. The improvements introduced to SSA mainly rely on the opposition-based learning technique. Computer simulations show that the ISSA outperforms the SSA as well as the algorithms that derive from it. The ISSA also exhibits the best performance once it is applied for feature weighting in the above context.

Improved Salp Swarm Algorithm with Simulated Annealing for Solving Engineering Optimization Problems

Swarm-based algorithm can successfully avoid the local optimal constraints, thus achieving a smooth balance between exploration and exploitation. Salp swarm algorithm(SSA), as a swarm-based algorithm on account of the predation behavior of the salp, can solve complex daily life optimization problems in nature. SSA also has the problems of local stagnation and slow convergence rate. This paper introduces an improved salp swarm algorithm, which improve the SSA by using the chaotic sequence initialization strategy and symmetric adaptive population division. Moreover, a simulated annealing mechanism based on symmetric perturbation is introduced to enhance the local jumping ability of the algorithm. The improved algorithm is referred to SASSA. The CEC standard benchmark functions are used to evaluate the efficiency of the SASSA and the results demonstrate that the SASSA has better global search capability. SASSA is also applied to solve engineering optimization problems. The experimental results demonstrate that the exploratory and exploitative proclivities of the proposed algorithm and its convergence patterns are vividly improved.

Predicting Coronary Atherosclerotic Heart Disease: An Extreme Learning Machine with Improved Salp Swarm Algorithm

To provide an available diagnostic model for diagnosing coronary atherosclerotic heart disease to provide an auxiliary function for doctors, we proposed a new evolutionary classification model in this paper. The core of the prediction model is a kernel extreme learning machine (KELM) optimized by an improved salp swarm algorithm (SSA). To get a better subset of parameters and features, the space transformation mechanism is introduced in the optimization core to improve SSA for obtaining an optimal KELM model. The KELM model for the diagnosis of coronary atherosclerotic heart disease (STSSA-KELM) is developed based on the optimal parameters and a subset of features. In the experiment, STSSA-KELM is compared with some widely adopted machine learning methods (MLM) in coronary atherosclerotic heart disease prediction. The experimental results show that STSSA-KELM can realize excellent classification performance and more robust stability under four indications. We also compare the convergence of STSSA-KELM with other MLM; the STSSA-KELM model has demonstrated a higher classification performance. Therefore, the STSSA-KELM model can effectively help doctors to diagnose coronary heart disease.