Article
Multidisciplinary Sciences
Binh Thanh Dang, Tung Khac Truong
Summary: This paper introduces the concept and challenges of the discounted {0-1} knapsack problem, and proposes a new algorithm based on the salp swarm algorithm to solve this problem. Additionally, the paper utilizes an effective data modeling mechanism and a greedy repair operator to enhance the performance of the algorithm.
Article
Computer Science, Artificial Intelligence
Yun Liu, Yanqing Shi, Hao Chen, Ali Asghar Heidari, Wenyong Gui, Mingjing Wang, Huiling Chen, Chengye Li
Summary: The newly proposed MCSSA algorithm, based on the original SSA algorithm, uses chaotic exploitative trends and a multi-population structure to improve its performance. This new strategy significantly enhances the speed of convergence and search ability, resulting in better solutions compared to the basic SSA.
EXPERT SYSTEMS WITH APPLICATIONS
(2021)
Article
Mathematical & Computational Biology
Peng Chen, Ming Liu, Shihua Zhou
Summary: This study proposes a discrete version of the Salp Swarm Algorithm (DSSA), which improves the d-opt algorithm and TPALS algorithm by introducing a decreasing factor d to control the range of neighborhood search and adding a second leader mechanism to increase randomness. DSSA was tested on 23 known TSP instances and compared with other advanced algorithms, showing satisfactory performance in solving TSP.
MATHEMATICAL BIOSCIENCES AND ENGINEERING
(2023)
Article
Biotechnology & Applied Microbiology
Zhang Yi, Zhou Yangkun, Yu Hongda, Wang Hong
Summary: This paper presents an improved Discrete Salp Swarm Algorithm based on the Ant Colony System (DSSACS). The algorithm shows better performance in terms of convergence speed, positive feedback mechanism, and accuracy compared to other algorithms. Moreover, it also achieves shorter paths in the selection of optimal paths in the Wireless rechargeable sensor network (WRSN) problem, saving more time and economic cost.
FRONTIERS IN BIOENGINEERING AND BIOTECHNOLOGY
(2022)
Article
Engineering, Multidisciplinary
Chao Lin, Pengjun Wang, Xuehua Zhao, Huiling Chen
Summary: The Double Mutation Salp Swarm Algorithm (DMSSA) improves the stability and performance in solving optimization problems by incorporating a Cuckoo Mutation Strategy and an Adaptive DE Mutation Strategy. Comparisons and tests on benchmark functions demonstrate the superiority of DMSSA. Experiments on classical engineering design optimization problems further confirm its applicability and scalability.
JOURNAL OF BIONIC ENGINEERING
(2023)
Article
Multidisciplinary Sciences
H. Tran-Ngoc, T. Le-Xuan, S. Khatir, G. De Roeck, T. Bui-Tien, Magd Abdel Wahab
Summary: This paper investigates the feasibility of employing a novel Fibonacy Sequence (FS)-based Optimization Algorithms (OAs) and up-to-date computing techniques for Structural Health Monitoring (SHM) of a large-scale railway bridge. The proposed approach addresses the issues of accuracy and computational cost by using the optimal ability of the golden ratio and superscalar processor. The obtained results show that the approach has great potential for real large-scale structures.
SCIENTIFIC REPORTS
(2023)
Article
Engineering, Multidisciplinary
Ahmed A. Ewees, Mohammed A. A. Al-qaness, Mohamed Abd Elaziz
Summary: This paper proposes a modified salp swarm algorithm (SSAFA) to solve the unrelated parallel machine scheduling problem with sequence-dependent setup times. By using the operators of the firefly algorithm as a local search, the quality of the solution is improved. Evaluation outcomes confirm the competitive performance of SSAFA in various problem instances using different performance measures.
APPLIED MATHEMATICAL MODELLING
(2021)
Article
Computer Science, Artificial Intelligence
Ram Kishan Dewangan, Priyansh Saxena
Summary: This paper investigates the route planning problem for multiple UAVs and proposes a new Salp Swarm Algorithm (SSA) for solving it. The experimental results show that the proposed algorithm outperforms other algorithms in route planning for multiple UAVs in a 3D environment.
JOURNAL OF EXPERIMENTAL & THEORETICAL ARTIFICIAL INTELLIGENCE
(2022)
Article
Computer Science, Information Systems
Nitin Mittal, Harbinder Singh, Vikas Mittal, Shubham Mahajan, Amit Kant Pandit, Mehedi Masud, Mohammed Baz, Mohamed Abouhawwash
Summary: Cognitive Radio is a technology that improves spectral efficiency, and adaptive parameters are important for enhancing the overall performance of the system. The Self-Learning Salp Swarm Algorithm is effective in maximizing secondary user throughput.
CMC-COMPUTERS MATERIALS & CONTINUA
(2022)
Article
Biology
Dongwan Lu, Yinggao Yue, Zhongyi Hu, Minghai Xu, Yinsheng Tong, Hanjie Ma
Summary: In this paper, a fuzzy k-nearest neighbor method based on the improved binary salp swarm algorithm (IBSSA-FKNN) is proposed for the early diagnosis of Alzheimer's disease (AD). The method is validated on multiple benchmark datasets and effectively distinguishes between patients with mild cognitive impairment (MCI), AD, and normal controls (NC).
COMPUTERS IN BIOLOGY AND MEDICINE
(2023)
Article
Multidisciplinary Sciences
Jiahao Fan, Ying Li, Tan Wang
Summary: The study proposed an improved African vultures optimization algorithm (TAVOA) by introducing tent chaotic mapping and a time-varying mechanism to balance exploration and exploitation ability. Experimental results showed that TAVOA outperforms AVOA and other optimization algorithms on multiple benchmark functions and engineering design problems.
Article
Computer Science, Interdisciplinary Applications
Qingwen Cai, Renhuan Yang, Chao Shen, Kelong Yue, Yibin Chen
Summary: This paper develops a modified optimization algorithm based on the Salp Swarm Algorithm (SSA) for parameter estimation in research on fractional-order chaotic systems (FOCSs). The algorithm introduces improvements on the SSA by adding a grouping step, introducing betrayal behavior, and improving the update method of the followers. Experiments were conducted on the fractional-order Lorenz chaotic system (Lorenz-FOCS) and the fractional-order Financial chaotic system (Financial-FOCS) using multiple classical optimization algorithms. The experimental results confirm the feasibility and superiority of the modified Salp Swarm Algorithm (MSSA) in terms of estimation accuracy and convergence rate.
INTERNATIONAL JOURNAL OF MODERN PHYSICS C
(2023)
Article
Computer Science, Information Systems
Laith Abualigah, Nada Khalil Al-Okbi, Mohamed Abd Elaziz, Essam H. Houssein
Summary: This study proposes a method combining the Marine Predators Algorithm and Salp Swarm Algorithm to determine the optimal multilevel threshold image segmentation. The solutions obtained are represented using image histograms, and various standard evaluation measures are employed to assess the effectiveness of the proposed segmentation method. Results indicate that the proposed method outperforms other well-known optimization algorithms in the literature.
MULTIMEDIA TOOLS AND APPLICATIONS
(2022)
Article
Computer Science, Software Engineering
Thimershen Achary, Shivani Pillay, Sarah M. Pillai, Malusi Mqadi, Emma Genders, Absalom E. Ezugwu
Summary: The paper provides a comprehensive review of nature-inspired optimization algorithms for solving the QAP and conducts extensive experiments to compare their performance. The results show that the ant colony optimization algorithm is the most competitive, while the genetic algorithm performs the worst among the six algorithms considered.
CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE
(2021)
Article
Computer Science, Artificial Intelligence
Rahim Fathi, Behrouz Tousi, Sadjad Galvani
Summary: This paper presents an optimal and simultaneous allocation of photovoltaic panel (PV) and wind turbine (WT) with the reconfiguration of radial distribution networks. The improved salp swarm algorithm (ISSA) is used for optimization and it is implemented on IEEE 33 and 69 bus distribution networks. The results show that ISSA can find the optimal location and size of renewable units and achieve the best network configuration.
APPLIED SOFT COMPUTING
(2023)
Article
Computer Science, Artificial Intelligence
Changting Zhong, Gang Li
Summary: The proposed comprehensive learning Harris hawks equilibrium optimization (CLHHEO) algorithm enhances the convergence and exploration capacity of HHO by incorporating comprehensive learning, equilibrium optimizer, and terminal replacement mechanism. Experimental results show that CLHHEO outperforms HHO and other state-of-the-art metaheuristic algorithms in terms of solution quality for both unconstrained and constrained optimization problems.
EXPERT SYSTEMS WITH APPLICATIONS
(2022)
Article
Computer Science, Artificial Intelligence
Changting Zhong, Gang Li, Zeng Meng
Summary: This paper presents a hybrid SMA algorithm called TLSMA, which combines the capacities of exploration and exploitation from SMA and TLBO. The proposed algorithm is shown to outperform several state-of-the-art metaheuristic algorithms in benchmark optimization problems and reliability-based design optimization problems.
NEURAL COMPUTING & APPLICATIONS
(2022)
Article
Computer Science, Artificial Intelligence
Changting Zhong, Gang Li, Zeng Meng
Summary: This paper presents a novel swarm-based metaheuristic algorithm called beluga whale optimization (BWO), which is inspired by the behaviors of beluga whales, for solving optimization problems. BWO consists of three phases: exploration, exploitation, and whale fall, corresponding to pair swim, prey, and whale fall behaviors, respectively. The self-adaptive balance factor and probability of whale fall in BWO play significant roles in controlling the exploration and exploitation capabilities. Additionally, Levy flight is introduced to enhance the global convergence in the exploitation phase. The effectiveness of BWO is evaluated using 30 benchmark functions and compared with 15 other metaheuristic algorithms through qualitative, quantitative, and scalability analysis. The results show that BWO is a competitive algorithm for solving unimodal and multimodal optimization problems. Furthermore, BWO achieves the first overall rank in the scalability analysis of benchmark functions among the compared metaheuristic algorithms. Four engineering problems are also solved to demonstrate the merits and potential of BWO in solving complex real-world optimization problems. The source code of BWO is publicly available.
KNOWLEDGE-BASED SYSTEMS
(2022)
Correction
Computer Science, Artificial Intelligence
Changting Zhong, Gang Li, Zeng Meng
NEURAL COMPUTING & APPLICATIONS
(2022)
Article
Engineering, Industrial
Chao Dang, Pengfei Wei, Matthias G. R. Faes, Marcos A. Valdebenito, Michael Beer
Summary: This study proposes a new method called "Parallel Adaptive Bayesian Quadrature" (PABQ) for quantifying and reducing numerical uncertainty in reliability analysis. The method uses an importance ball sampling technique and a multi-point selection criterion to effectively assess small failure probabilities with a minimum number of iterations, taking advantage of parallel computing.
RELIABILITY ENGINEERING & SYSTEM SAFETY
(2022)
Article
Engineering, Civil
Chao Dang, Marcos A. Valdebenito, Matthias G. R. Faes, Pengfei Wei, Michael Beer
Summary: This study introduces a Bayesian framework for failure probability inference, which quantifies numerical uncertainty behind failure probability through deriving posterior variance and applying an adaptive parallel learning strategy. By utilizing both prior knowledge and parallel computing, the Bayesian approach demonstrates potential benefits in failure probability estimation.
Article
Computer Science, Artificial Intelligence
Changting Zhong, Gang Li, Zeng Meng, Haijiang Li, Wanxin He
Summary: This paper presents a hybrid multi-objective algorithm called MO-SHADE-MRFO for structural design problems. The algorithm combines the updating rules of SHADE and the operators from MRFO to balance exploration and exploitation. It utilizes an external archive to save and update obtained Pareto fronts during the optimization process. Experimental results show that MO-SHADE-MRFO outperforms other compared algorithms in terms of the performance metrics HV, IGD, and STE.
APPLIED SOFT COMPUTING
(2023)
Article
Engineering, Multidisciplinary
Masaru Kitahara, Chao Dang, Michael Beer
Summary: This paper proposes a Bayesian updating approach called parallel Bayesian optimization and quadrature (PBOQ). It applies Gaussian process priors and explores a constant c in BUS through parallel infill sampling strategy. The proposed approach effectively reduces computational burden of model updating by leveraging prior knowledge and parallel computing. Numerical examples are used to demonstrate its potential benefits and advocate a coherent Bayesian fashion for BUS analysis.
COMPUTER METHODS IN APPLIED MECHANICS AND ENGINEERING
(2023)
Article
Biology
Changting Zhong, Gang Li, Zeng Meng, Haijiang Li, Wanxin He
Summary: Feature selection is a popular technique in machine learning to improve classification accuracy by extracting optimal features. This study proposes a self-adaptive quantum equilibrium optimizer with artificial bee colony (SQEOABC) for feature selection. Experimental results on benchmark datasets and a real-world COVID-19 problem demonstrate the effectiveness and superiority of the SQEOABC algorithm compared to other metaheuristic algorithms and variants of equilibrium optimizer.
COMPUTERS IN BIOLOGY AND MEDICINE
(2023)
Article
Engineering, Mechanical
Chen Ding, Chao Dang, Marcos A. Valdebenito, Matthias G. R. Faes, Matteo Broggi, Michael Beer
Summary: This paper proposes a novel approach to estimate the first-passage probability of high-dimensional nonlinear stochastic dynamic systems. The approach captures the extreme value distribution of the system response using the concepts of fractional moment and mixture distribution, and efficiently computes the fractional moments using a parallel adaptive sampling scheme. By fitting a set of fractional moments, the desired extreme value distribution can be recovered, and the first-passage probabilities under different thresholds can be obtained directly.
MECHANICAL SYSTEMS AND SIGNAL PROCESSING
(2023)
Article
Computer Science, Interdisciplinary Applications
Ye Liu, Gang Zhao, Gang Li, Wanxin He, Changting Zhong
Summary: Robust design optimization (RDO) aims to provide an insensitive design configuration in the presence of uncertainties. Surrogate assisted optimization, such as the PC-GK-SBL model, can significantly reduce computational expenses. Active learning function RLGE combines a sigmoid function and geometrical exploration strategy to improve accuracy in RDO solutions.
STRUCTURAL AND MULTIDISCIPLINARY OPTIMIZATION
(2022)
Article
Computer Science, Interdisciplinary Applications
Wanxin He, Gang Li, Changting Zhong, Yixuan Wang
Summary: This study proposes an active learning active subspace-based data-driven sparse polynomial chaos expansion (PCE) method to solve high-dimensional uncertainty problems. The method uses active subspace theory to reduce the dimension of the input space and establish data-driven polynomial chaos bases. It combines sparse Bayesian learning with manifold learning to obtain the subspace mapping matrix without requiring the probability distribution of input variables. The proposed method is verified using numerical examples and shows effectiveness in solving high-dimensional uncertainty quantification problems.
STRUCTURAL AND MULTIDISCIPLINARY OPTIMIZATION
(2023)
Article
Computer Science, Artificial Intelligence
Changting Zhong, Gang Li, Zeng Meng, Wanxin He
Summary: In this work, the EOOBLE algorithm is proposed to solve high-dimensional global optimization problems. It combines the opposition-based learning strategy, the Levy flight strategy, and the evolutionary population dynamics strategy to improve the convergence capacity and performance. Experimental results show that the EOOBLE algorithm outperforms other state-of-the-art metaheuristic algorithms and variants of EO.
EXPERT SYSTEMS WITH APPLICATIONS
(2023)
Article
Engineering, Industrial
Long-Wen Zhang, Chao Dang, Yan-Gang Zhao
Summary: In this paper, an efficient method is proposed to evaluate the large reliability index of an implicit and nonlinear performance function (PF) using multiple techniques. The method selects the optimal transformation parameter (OTP) to approximate the transformed PF to a normal distribution. By introducing maximum likelihood estimation, Jarque-Bera test, and absolute skewness minimization criterion, the selective factors for OTP selection are obtained. Finally, the reliability index is obtained based on the first four moments of the transformed PF and the cubic normal distribution.
RELIABILITY ENGINEERING & SYSTEM SAFETY
(2023)
Article
Engineering, Multidisciplinary
Chao Dang, Marcos A. Valdebenito, Jingwen Song, Pengfei Wei, Michael Beer
Summary: This paper introduces an innovative method called partially Bayesian active learning line sampling (PBAL-LS) for assessing small failure probabilities. The problem of evaluating the failure probability integral in the line sampling method is treated as a Bayesian inference problem, allowing for the incorporation of prior knowledge and modeling of discretization error. The paper proposes a learning function and a stopping criterion based on the posterior statistics of the failure probability, and an efficient algorithm is designed to implement the PBAL-LS method.
COMPUTER METHODS IN APPLIED MECHANICS AND ENGINEERING
(2023)