scholarly journals A Novel Method for Source Tracking of Chemical Gas Leakage: Outlier Mutation Optimization Algorithm

Sensors ◽  
2021 ◽  
Vol 22 (1) ◽  
pp. 71
Author(s):  
Zhiyu Xia ◽  
Zhengyi Xu ◽  
Dan Li ◽  
Jianming Wei
Keyword(s):  
Swarm Intelligence ◽  
Optimization Algorithm ◽  
Search Algorithm ◽  
Test Session ◽  
Source Tracking ◽  
Gas Leakage ◽  
Industrial Parks ◽  
Source Tracing ◽  
Direct Search Algorithm ◽  
Novel Method

Chemical industrial parks, which act as critical infrastructures in many cities, need to be responsive to chemical gas leakage accidents. Once a chemical gas leakage accident occurs, risks of poisoning, fire, and explosion will follow. In order to meet the primary emergency response demands in chemical gas leakage accidents, source tracking technology of chemical gas leakage has been proposed and evolved. This paper proposes a novel method, Outlier Mutation Optimization (OMO) algorithm, aimed to quickly and accurately track the source of chemical gas leakage. The OMO algorithm introduces a random walk exploration mode and, based on Swarm Intelligence (SI), increases the probability of individual mutation. Compared with other optimization algorithms, the OMO algorithm has the advantages of a wider exploration range and more convergence modes. In the algorithm test session, a series of chemical gas leakage accident application examples with random parameters are first assumed based on the Gaussian plume model; next, the qualitative experiments and analysis of the OMO algorithm are conducted, based on the application example. The test results show that the OMO algorithm with default parameters has superior comprehensive performance, including the extremely high average calculation accuracy: the optimal value, which represents the error between the final objective function value obtained by the optimization algorithm and the ideal value, reaches 2.464e-15 when the number of sensors is 16; 2.356e-13 when the number of sensors is 9; and 5.694e-23 when the number of sensors is 4. There is a satisfactory calculation time: 12.743 s/50 times when the number of sensors is 16; 10.304 s/50 times when the number of sensors is 9; and 8.644 s/50 times when the number of sensors is 4. The analysis of the OMO algorithm’s characteristic parameters proves the flexibility and robustness of this method. In addition, compared with other algorithms, the OMO algorithm can obtain an excellent leakage source tracing result in the application examples of 16, 9 and 4 sensors, and the accuracy exceeds the direct search algorithm, evolutionary algorithm, and other swarm intelligence algorithms.

scholarly journals Binary Spring Search Algorithm for Solving Various Optimization Problems

2021 ◽  
Vol 11 (3) ◽  
pp. 1286 ◽  
Author(s):  
Mohammad Dehghani ◽  
Zeinab Montazeri ◽  
Ali Dehghani ◽  
Om P. Malik ◽  
Ruben Morales-Menendez ◽  
...  
Keyword(s):  
Optimization Algorithm ◽  
High Performance ◽  
Optimization Problems ◽  
Search Algorithm ◽  
Gravitational Search Algorithm ◽  
Bat Algorithm ◽  
Search Space ◽  
Binary Particle Swarm Optimization ◽  
Dragonfly Algorithm ◽  
Grasshopper Optimization Algorithm

One of the most powerful tools for solving optimization problems is optimization algorithms (inspired by nature) based on populations. These algorithms provide a solution to a problem by randomly searching in the search space. The design’s central idea is derived from various natural phenomena, the behavior and living conditions of living organisms, laws of physics, etc. A new population-based optimization algorithm called the Binary Spring Search Algorithm (BSSA) is introduced to solve optimization problems. BSSA is an algorithm based on a simulation of the famous Hooke’s law (physics) for the traditional weights and springs system. In this proposal, the population comprises weights that are connected by unique springs. The mathematical modeling of the proposed algorithm is presented to be used to achieve solutions to optimization problems. The results were thoroughly validated in different unimodal and multimodal functions; additionally, the BSSA was compared with high-performance algorithms: binary grasshopper optimization algorithm, binary dragonfly algorithm, binary bat algorithm, binary gravitational search algorithm, binary particle swarm optimization, and binary genetic algorithm. The results show the superiority of the BSSA. The results of the Friedman test corroborate that the BSSA is more competitive.

scholarly journals A New “Good and Bad Groups-Based Optimizer” for Solving Various Optimization Problems

2021 ◽  
Vol 11 (10) ◽  
pp. 4382
Author(s):  
Ali Sadeghi ◽  
Sajjad Amiri Doumari ◽  
Mohammad Dehghani ◽  
Zeinab Montazeri ◽  
Pavel Trojovský ◽  
...  
Keyword(s):  
Optimization Algorithm ◽  
Optimization Problems ◽  
Search Algorithm ◽  
Fitness Function ◽  
Optimization Algorithms ◽  
Gravitational Search Algorithm ◽  
Gray Wolf ◽  
Good Group ◽  
Good Ability ◽  
Whale Optimization

Optimization is the science that presents a solution among the available solutions considering an optimization problem’s limitations. Optimization algorithms have been introduced as efficient tools for solving optimization problems. These algorithms are designed based on various natural phenomena, behavior, the lifestyle of living beings, physical laws, rules of games, etc. In this paper, a new optimization algorithm called the good and bad groups-based optimizer (GBGBO) is introduced to solve various optimization problems. In GBGBO, population members update under the influence of two groups named the good group and the bad group. The good group consists of a certain number of the population members with better fitness function than other members and the bad group consists of a number of the population members with worse fitness function than other members of the population. GBGBO is mathematically modeled and its performance in solving optimization problems was tested on a set of twenty-three different objective functions. In addition, for further analysis, the results obtained from the proposed algorithm were compared with eight optimization algorithms: genetic algorithm (GA), particle swarm optimization (PSO), gravitational search algorithm (GSA), teaching–learning-based optimization (TLBO), gray wolf optimizer (GWO), and the whale optimization algorithm (WOA), tunicate swarm algorithm (TSA), and marine predators algorithm (MPA). The results show that the proposed GBGBO algorithm has a good ability to solve various optimization problems and is more competitive than other similar algorithms.

scholarly journals GMBO: Group Mean-Based Optimizer for Solving Various Optimization Problems

Mathematics ◽  
2021 ◽  
Vol 9 (11) ◽  
pp. 1190
Author(s):  
Mohammad Dehghani ◽  
Zeinab Montazeri ◽  
Štěpán Hubálovský
Keyword(s):  
Optimization Algorithm ◽  
Optimization Problems ◽  
Search Algorithm ◽  
Random Search ◽  
Optimization Algorithms ◽  
Gravitational Search Algorithm ◽  
Main Idea ◽  
Population Based ◽  
Grey Wolf Optimizer ◽  
Whale Optimization

There are many optimization problems in the different disciplines of science that must be solved using the appropriate method. Population-based optimization algorithms are one of the most efficient ways to solve various optimization problems. Population-based optimization algorithms are able to provide appropriate solutions to optimization problems based on a random search of the problem-solving space without the need for gradient and derivative information. In this paper, a new optimization algorithm called the Group Mean-Based Optimizer (GMBO) is presented; it can be applied to solve optimization problems in various fields of science. The main idea in designing the GMBO is to use more effectively the information of different members of the algorithm population based on two selected groups, with the titles of the good group and the bad group. Two new composite members are obtained by averaging each of these groups, which are used to update the population members. The various stages of the GMBO are described and mathematically modeled with the aim of being used to solve optimization problems. The performance of the GMBO in providing a suitable quasi-optimal solution on a set of 23 standard objective functions of different types of unimodal, high-dimensional multimodal, and fixed-dimensional multimodal is evaluated. In addition, the optimization results obtained from the proposed GMBO were compared with eight other widely used optimization algorithms, including the Marine Predators Algorithm (MPA), the Tunicate Swarm Algorithm (TSA), the Whale Optimization Algorithm (WOA), the Grey Wolf Optimizer (GWO), Teaching–Learning-Based Optimization (TLBO), the Gravitational Search Algorithm (GSA), Particle Swarm Optimization (PSO), and the Genetic Algorithm (GA). The optimization results indicated the acceptable performance of the proposed GMBO, and, based on the analysis and comparison of the results, it was determined that the GMBO is superior and much more competitive than the other eight algorithms.

scholarly journals A Comparative Study of Machine Learning Models with Hyperparameter Optimization Algorithm for Mapping Mineral Prospectivity

Minerals ◽  
2021 ◽  
Vol 11 (2) ◽  
pp. 159
Author(s):  
Nan Lin ◽  
Yongliang Chen ◽  
Haiqi Liu ◽  
Hanlin Liu
Keyword(s):  
Machine Learning ◽  
Swarm Intelligence ◽  
Optimization Algorithm ◽  
Geochemical Data ◽  
Support Vector ◽  
Learning Models ◽  
Hyperparameter Optimization ◽  
Mineral Prospectivity ◽  
Swarm Intelligence Optimization ◽  
Machine Learning Models

Selecting internal hyperparameters, which can be set by the automatic search algorithm, is important to improve the generalization performance of machine learning models. In this study, the geological, remote sensing and geochemical data of the Lalingzaohuo area in Qinghai province were researched. A multi-source metallogenic information spatial data set was constructed by calculating the Youden index for selecting potential evidence layers. The model for mapping mineral prospectivity of the study area was established by combining two swarm intelligence optimization algorithms, namely the bat algorithm (BA) and the firefly algorithm (FA), with different machine learning models. The receiver operating characteristic (ROC) and prediction-area (P-A) curves were used for performance evaluation and showed that the two algorithms had an obvious optimization effect. The BA and FA differentiated in improving multilayer perceptron (MLP), AdaBoost and one-class support vector machine (OCSVM) models; thus, there was no optimization algorithm that was consistently superior to the other. However, the accuracy of the machine learning models was significantly enhanced after optimizing the hyperparameters. The area under curve (AUC) values of the ROC curve of the optimized machine learning models were all higher than 0.8, indicating that the hyperparameter optimization calculation was effective. In terms of individual model improvement, the accuracy of the FA-AdaBoost model was improved the most significantly, with the AUC value increasing from 0.8173 to 0.9597 and the prediction/area (P/A) value increasing from 3.156 to 10.765, where the mineral targets predicted by the model occupied 8.63% of the study area and contained 92.86% of the known mineral deposits. The targets predicted by the improved machine learning models are consistent with the metallogenic geological characteristics, indicating that the swarm intelligence optimization algorithm combined with the machine learning model is an efficient method for mineral prospectivity mapping.

An Image Segmentation Method Based on Two-Dimensional Entropy and Chaotic Lightning Attachment Procedure Optimization Algorithm

2020 ◽  
Vol 34 (11) ◽  
pp. 2054030 ◽  
Author(s):  
Wei Liu ◽  
Shuai Yang ◽  
Zhiwei Ye ◽  
Qian Huang ◽  
Yongkun Huang
Keyword(s):  
Image Segmentation ◽  
Maximum Entropy ◽  
Optimization Algorithm ◽  
Search Algorithm ◽  
Computational Time ◽  
Two Dimensional ◽  
Threshold Segmentation ◽  
Grasshopper Optimization Algorithm ◽  
Grasshopper Optimization ◽  
Competitive Algorithms

Threshold segmentation has been widely used in recent years due to its simplicity and efficiency. The method of segmenting images by the two-dimensional maximum entropy is a species of the useful technique of threshold segmentation. However, the efficiency and stability of this technique are still not ideal and the traditional search algorithm cannot meet the needs of engineering problems. To mitigate the above problem, swarm intelligent optimization algorithms have been employed in this field for searching the optimal threshold vector. An effective technique of lightning attachment procedure optimization (LAPO) algorithm based on a two-dimensional maximum entropy criterion is offered in this paper, and besides, a chaotic strategy is embedded into LAPO to develop a new algorithm named CLAPO. In order to confirm the benefits of the method proposed in this paper, the other seven kinds of competitive algorithms, such as Ant–lion Optimizer (ALO) and Grasshopper Optimization Algorithm (GOA), are compared. Experiments are conducted on four different kinds of images and the simulation results are presented in several indexes (such as computational time, maximum fitness, average fitness, variance of fitness and other indexes) at different threshold levels for each test image. By scrutinizing the results of the experiment, the superiority of the introduced method is demonstrated, which can meet the needs of image segmentation excellently.

Lower limb exoskeleton robots’ dynamics parameters identification based on improved beetle swarm optimization algorithm

Robotica ◽  
2022 ◽  
pp. 1-16
Author(s):  
Peng Zhang ◽  
Junxia Zhang
Keyword(s):  
Optimization Algorithm ◽  
Robot Control ◽  
Search Algorithm ◽  
Optimal Solution ◽  
Global Optimum ◽  
Identification Accuracy ◽  
Dynamic Parameters ◽  
Dynamics Modeling ◽  
Swarm Optimization ◽  
Exoskeleton Robot

Abstract Efficient and high-precision identification of dynamic parameters is the basis of model-based robot control. Firstly, this paper designed the structure and control system of the developed lower extremity exoskeleton robot. The dynamics modeling of the exoskeleton robot is performed. The minimum parameter set of the identified parameters is determined. The dynamic model is linearized based on the parallel axis theory. Based on the beetle antennae search algorithm (BAS) and particle swarm optimization (PSO), the beetle swarm optimization algorithm (BSO) was designed and applied to the identification of dynamic parameters. The update rule of each particle originates from BAS, and there is an individual’s judgment on the environment space in each iteration. This method does not rely on the historical best solution in the PSO and the current global optimal solution of the individual particle, thereby reducing the number of iterations and improving the search speed and accuracy. Four groups of test functions with different characteristics were used to verify the performance of the proposed algorithm. Experimental results show that the BSO algorithm has a good balance between exploration and exploitation capabilities to promote the beetle to move to the global optimum. Besides, the test was carried out on the exoskeleton dynamics model. This method can obtain independent dynamic parameters and achieve ideal identification accuracy. The prediction result of torque based on the identification method is in good agreement with the ideal torque of the robot control.

A comparative analysis of the queuing search algorithm, the sine-cosine algorithm, the ant lion algorithm to determine the optimal weight design problem of a spur gear drive system

2021 ◽  
Vol 63 (5) ◽  
pp. 442-447
Author(s):  
Hammoudi Abderazek ◽  
Ferhat Hamza ◽  
Ali Riza Yildiz ◽  
Liang Gao ◽  
Sadiq M. Sait
Keyword(s):  
Optimization Algorithm ◽  
Search Algorithm ◽  
Spur Gear ◽  
Ant Lion Optimization ◽  
Lion Algorithm ◽  
Weight Design ◽  
Sine Cosine Algorithm ◽  
Ant Lion ◽  
Teaching Learning ◽  
Lion Optimization Algorithm

Abstract Metaheuristic optimization algorithms have gained relevance and have effectively been investigated for solving complex real design problems in diverse fields of science and engineering. In this paper, a recent meta-heuristic approach inspired by human social concepts, namely the queuing search algorithm (QSA), is implemented for the first time to optimize the main parameters of the spur gear, in particular, to minimize the weight of a single-stage spur gear. The effectiveness of the algorithm introduced is examined in two steps. First, the algorithm used is compared with descriptions in previous studies and indicates that the final results obtained by QSA lead to a reduction in gear weight by 7.5 %. Furthermore, the outcomes obtained are compared with those for the other five algorithms. The results reveal that the QSA outperforms the techniques with which it is compared such as the sine-cosine optimization algorithm, the ant lion optimization algorithm, the interior search algorithm, the teaching-learning-based algorithm, and the jaya algorithm in terms of robustness, success rate, and convergence capability.

Sign in / Sign up

Export Citation Format

Share Document