Search

Algorithms for machine learning have found extensive use in numerous fields and applications. One important aspect of effectively utilizing these algorithms is tuning the hyperparameters to match the specific task at hand. The selection and configuration of hyperparameters directly impact the performance of machine learning models. Achieving optimal hyperparameter settings often requires a deep understanding of the underlying models and the appropriate optimization techniques. While there are many automatic optimization techniques available, each with its own advantages and disadvantages, this article focuses on hyperparameter optimization for well-known machine learning models. It explores cutting-edge optimization methods such as metaheuristic algorithms, deep learning-based optimization, Bayesian optimization, and quantum optimization, and our paper focused mainly on metaheuristic and Bayesian optimization techniques and provides guidance on applying them to different machine learning algorithms. The article also presents real-world applications of hyperparameter optimization by conducting tests on spatial data collections for landslide susceptibility mapping. Based on the experiment's results, both Bayesian optimization and metaheuristic algorithms showed promising performance compared to baseline algorithms. For instance, the metaheuristic algorithm boosted the random forest model's overall accuracy by 5% and 3%, respectively, from baseline optimization methods GS and RS, and by 4% and 2% from baseline optimization methods GA and PSO. Additionally, for models like KNN and SVM, Bayesian methods with Gaussian processes had good results. When compared to the baseline algorithms RS and GS, the accuracy of the KNN model was enhanced by BO-TPE by 1% and 11%, respectively, and by BO-GP by 2% and 12%, respectively. For SVM, BO-TPE outperformed GS and RS by 6% in terms of performance, while BO-GP improved results by 5%. The paper thoroughly discusses the reasons behind the efficiency of these algorithms. By successfully identifying appropriate hyperparameter configurations, this research paper aims to assist researchers, spatial data analysts, and industrial users in developing machine learning models more effectively. The findings and insights provided in this paper can contribute to enhancing the performance and applicability of machine learning algorithms in various domains. [ABSTRACT FROM AUTHOR]

Precision object handling and manipulation require the accurate positioning of industrial robots. A common practice for performing end effector positioning is to read joint angles and use industrial robot forward kinematics (FKs). However, industrial robot FKs rely on the robot Denavit–Hartenberg (DH) parameter values, which include uncertainties. Sources of uncertainty associated with industrial robot FKs include mechanical wear, manufacturing and assembly tolerances, and robot calibration errors. It is therefore necessary to increase the accuracy of DH parameter values to reduce the impact of uncertainties on industrial robot FKs. In this paper, we use differential evolution, particle swarm optimization, an artificial bee colony, and a gravitational search algorithm to calibrate industrial robot DH parameters. A laser tracker system, Leica AT960-MR, is utilized to register accurate positional measurements. The nominal accuracy of this non-contact metrology equipment is less than 3 μm/m. Metaheuristic optimization approaches such as differential evolution, particle swarm optimization, an artificial bee colony and a gravitational search algorithm are used as optimization methods to perform the calibration using laser tracker position data. It is observed that, using the proposed approach with an artificial bee colony optimization algorithm, the accuracy of industrial robot FKs in terms of mean absolute errors of static and near-static motion over all three dimensions for the test data decreases from its measured value of 75.4 μm to 60.1 μm (a 20.3% improvement). [ABSTRACT FROM AUTHOR]

This study proposed a separation method to identify the temperature-induced response from the long-term monitoring data with noise and other action-induced effects. In the proposed method, the original measured data are transformed using the local outlier factor (LOF), and the threshold of the LOF is determined by minimizing the variance of the modified data. The Savitzky–Golay convolution smoothing is also utilized to filter the noise of the modified data. Furthermore, this study proposes an optimization algorithm, namely the AOHHO, which hybridizes the Aquila Optimizer (AO) and the Harris Hawks Optimization (HHO) to identify the optimal value of the threshold of the LOF. The AOHHO employs the exploration ability of the AO and the exploitation ability of the HHO. Four benchmark functions illustrate that the proposed AOHHO owns a stronger search ability than the other four metaheuristic algorithms. A numerical example and in situ measured data are utilized to evaluate the performances of the proposed separation method. The results show that the separation accuracy of the proposed method is better than the wavelet-based method and is based on machine learning methods in different time windows. The maximum separation errors of the two methods are about 2.2 times and 5.1 times that of the proposed method, respectively. [ABSTRACT FROM AUTHOR]

Vibration-based damage detection methods are a subcategory of Structural Health Monitoring (SHM) methods that rely on the fact that structural damage will affect the dynamic characteristic of a structure. The presented methodology uses Finite Element Models coupled with a metaheuristic optimization algorithm in order to locate the damage in a structure. The search domains of the optimization algorithm are the variables that control a parametric area, which is inserted into the FE model. During the optimization procedure, this area changes location, stiffness, and mass to simulate the effect of the physical damage. The final output is a damaged FE model which can approximate the dynamic response of the damaged structure and indicate the damaged area. For the current implementation of this Damage Detection Framework, the Particle Swarm Optimization algorithm is used. As an effective metric of the comparison between the FE model and the experimental structure, Transmittance Functions (TF) are used that require output only acceleration signals. As with most model-based methods, a common concern is the modeling error and how this can be surpassed. For this reason, the Dynamic Time Wrapping (DTW) algorithm is applied. When damage occurs in a structure it creates some differences between the Transmittance Functions (TF) of the healthy and the damaged state. With the use of DTW, the damaged pattern is recreated around the TF of the FE model, while creating the same differences and, thus, minimizing the modeling error. The effectiveness of the proposed methodology is tested on a small truss structure that consists of Carbon-Fiber Reinforced Polymer (CFRP) filament wound beams and aluminum connectors, where four cases are examined with the damage to be located on the composite material. [ABSTRACT FROM AUTHOR]

Vehicular ad hoc networks (VANETs) are a fundamental component of intelligent transportation systems in smart cities. With the support of open and real-time data, these networks of inter-connected vehicles constitute an 'Internet of vehicles' with the potential to significantly enhance citizens' mobility and last-mile delivery in urban, peri-urban, and metropolitan areas. However, the proper coordination and logistics of VANETs raise a number of optimization challenges that need to be solved. After reviewing the state of the art on the concepts of VANET optimization and open data in smart cities, this paper discusses some of the most relevant optimization challenges in this area. Since most of the optimization problems are related to the need for real-time solutions or to the consideration of uncertainty and dynamic environments, the paper also discusses how some VANET challenges can be addressed with the use of agile optimization algorithms and the combination of metaheuristics with simulation and machine learning methods. The paper also offers a numerical analysis that measures the impact of using these optimization techniques in some related problems. Our numerical analysis, based on real data from Open Data Barcelona, demonstrates that the constructive heuristic outperforms the random scenario in the CDP combined with vehicular networks, resulting in maximizing the minimum distance between facilities while meeting capacity requirements with the fewest facilities. [ABSTRACT FROM AUTHOR]

In recent years, detecting credit card fraud transactions has been a difficult task due to the high dimensions and imbalanced datasets. Selecting a subset of important features from a high-dimensional dataset has proven to be the most prominent approach for solving high-dimensional dataset issues, and the selection of features is critical for improving classification performance, such as the fraud transaction identification process. To contribute to the field, this paper proposes a novel feature selection (FS) approach based on a metaheuristic algorithm called Rock Hyrax Swarm Optimization Feature Selection (RHSOFS), inspired by the actions of rock hyrax swarms in nature, and implements supervised machine learning techniques to improve credit card fraud transaction identification approaches. This approach is used to select a subset of optimal relevant features from a high-dimensional dataset. In a comparative efficiency analysis, RHSOFS is compared with Differential Evolutionary Feature Selection (DEFS), Genetic Algorithm Feature Selection (GAFS), Particle Swarm Optimization Feature Selection (PSOFS), and Ant Colony Optimization Feature Selection (ACOFS) in a comparative efficiency analysis. The proposed RHSOFS outperforms existing approaches, such as DEFS, GAFS, PSOFS, and ACOFS, according to the experimental results. Various statistical tests have been used to validate the statistical significance of the proposed model. [ABSTRACT FROM AUTHOR]

The continuous development of new materials and larger and/or more complex structures drives the need for the development of more robust, accurate, and sensitive Structural Health Monitoring (SHM) techniques. In the present work, a novel vibration-based damage-detection method that contributes into the SHM field is presented using Metaheuristic algorithms coupled with optimal Finite Element Models that can effectively localize damage. The proposed damage-detection framework can be applied in any kind of detailed structural FE model, while requiring only the output information of the dynamic response of the structure. It can effectively localize damage in a structure by highlighting not only the affected part of the structure but also the specific damaged area inside the part. First, the optimal FE model of the healthy structure is developed using appropriate FE model updating techniques and experimental vibration measurements, simulating the undamaged condition. Next, the main goal of the proposed method is to create a damaged FE model that approximates the dynamic response of the damaged structure. To achieve this, a parametric area is inserted into the FE model, changing stiffness and mass to simulate the effect of the physical damage. This area is controlled by the metaheuristic optimization algorithm, which is embedded in the proposed damage-detection framework. On this specific implementation of the framework, the Particle Swarm Optimization (PSO) algorithm is selected which has been used for a wide variety of optimization problems in the past. On the PSO's search space, two parameters control the stiffness and mass of the damaged area while additional location parameters control the exact position of the damaged area through the FE model. For effective damage localization, the Transmittance Functions from acceleration measurements are used which have been shown to be sensitive to structural damage while requiring output-only information. Finally, with proper selection of the objective function, the error that arises from modeling a physical damage with a linear damaged FE model can be minimized, thus creating a more accurate prediction for the damaged location. The effectiveness of the proposed SHM method is demonstrated via two illustrative examples: a simulated small-scale model of a laboratory-tested vehicle-like structure and a real experimental CFRP composite beam structure. In order to check the robustness of the proposed method, two small damage scenarios are examined for each validation model and combined with random excitations. [ABSTRACT FROM AUTHOR]

The PID control algorithm for balancing robot attitude control suffers from the problem of difficult parameter tuning. Previous studies have proposed using metaheuristic algorithms to tune the PID parameters. However, traditional metaheuristic algorithms are subject to the criticism of premature convergence and the possibility of falling into local optimum solutions. Therefore, the present paper proposes a CFHBA-PID algorithm for balancing robot Dual-loop PID attitude control based on Honey Badger Algorithm (HBA) and CF-ITAE. On the one hand, HBA maintains a sufficiently large population diversity throughout the search process and employs a dynamic search strategy for balanced exploration and exploitation, effectively avoiding the problems of classical intelligent optimization algorithms and serving as a global search. On the other hand, a novel complementary factor (CF) is proposed to complement integrated time absolute error (ITAE) with the overshoot amount, resulting in a new rectification indicator CF-ITAE, which balances the overshoot amount and the response time during parameter tuning. Using balancing robot as the experimental object, HBA-PID is compared with AOA-PID, WOA-PID, and PSO-PID, and the results demonstrate that HBA-PID outperforms the other three algorithms in terms of overshoot amount, stabilization time, ITAE, and convergence speed, proving that the algorithm combining HBA with PID is better than the existing mainstream algorithms. The comparative experiments using CF prove that CFHBA-PID is able to effectively control the overshoot amount in attitude control. In conclusion, the CFHBA-PID algorithm has great control and significant results when applied to the balancing robot. [ABSTRACT FROM AUTHOR]

This paper proposed an improved Grey Wolf Optimizer (GWO) to resolve the problem of instability and convergence accuracy when GWO is used as a meta-heuristic algorithm with strong optimal search capability in the path planning for mobile robots. We improved chaotic tent mapping to initialize the wolves to enhance the global search ability and used a nonlinear convergence factor based on the Gaussian distribution change curve to balance the global and local searchability. In addition, an improved dynamic proportional weighting strategy is proposed that can update the positions of grey wolves so that the convergence of this algorithm can be accelerated. The proposed improved GWO algorithm results are compared with the other eight algorithms through several benchmark function test experiments and path planning experiments. The experimental results show that the improved GWO has higher accuracy and faster convergence speed. [ABSTRACT FROM AUTHOR]

Underwater wireless sensor networks (UWSNs) comprise numerous underwater wireless sensor nodes dispersed in the marine environment, which find applicability in several areas like data collection, navigation, resource investigation, surveillance, and disaster prediction. Because of the usage of restricted battery capacity and the difficulty in replacing or charging the inbuilt batteries, energy efficiency becomes a challenging issue in the design of UWSN. Earlier studies reported that clustering and routing are considered effective ways of attaining energy efficacy in the UWSN. Clustering and routing processes can be treated as nondeterministic polynomial-time (NP) hard optimization problems, and they can be addressed by the use of metaheuristics. This study introduces an improved metaheuristics-based clustering with multihop routing protocol for underwater wireless sensor networks, named the IMCMR-UWSN technique. The major aim of the IMCMR-UWSN technique is to choose cluster heads (CHs) and optimal routes to a destination. The IMCMR-UWSN technique incorporates two major processes, namely the chaotic krill head algorithm (CKHA)-based clustering and self-adaptive glow worm swarm optimization algorithm (SA-GSO)-based multihop routing. The CKHA technique selects CHs and organizes clusters based on different parameters such as residual energy, intra-cluster distance, and inter-cluster distance. Similarly, the SA-GSO algorithm derives a fitness function involving four parameters, namely residual energy, delay, distance, and trust. Utilization of the IMCMR-UWSN technique helps to significantly boost the energy efficiency and lifetime of the UWSN. To ensure the improved performance of the IMCMR-UWSN technique, a series of simulations were carried out, and the comparative results reported the supremacy of the IMCMR-UWSN technique in terms of different measures. [ABSTRACT FROM AUTHOR]

Identifying structural damage is an essential task for ensuring the safety and functionality of civil, mechanical, and aerospace structures. In this study, the structural damage identification scheme is formulated as an optimization problem, and a new meta-heuristic optimization algorithm, called visible particle series search (VPSS), is proposed to tackle that. The proposed VPSS algorithm is inspired by the visibility graph technique, which is a technique used basically to convert a time series into a graph network. In the proposed VPSS algorithm, the population of candidate solutions is regarded as a particle series and is further mapped into a visibility graph network to obtain visible particles. The information captured from the visible particles is then utilized by the algorithm to seek the optimum solution over the search space. The general performance of the proposed VPSS algorithm is first verified on a set of mathematical benchmark functions, and, afterward, its ability to identify structural damage is assessed by conducting various numerical simulations. The results demonstrate the high accuracy, reliability, and computational efficiency of the VPSS algorithm for identifying the location and the extent of damage in structures. [ABSTRACT FROM AUTHOR]

Optimization is an important and fundamental challenge to solve optimization problems in different scientific disciplines. In this paper, a new stochastic nature-inspired optimization algorithm called Pelican Optimization Algorithm (POA) is introduced. The main idea in designing the proposed POA is simulation of the natural behavior of pelicans during hunting. In POA, search agents are pelicans that search for food sources. The mathematical model of the POA is presented for use in solving optimization issues. The performance of POA is evaluated on twenty-three objective functions of different unimodal and multimodal types. The optimization results of unimodal functions show the high exploitation ability of POA to approach the optimal solution while the optimization results of multimodal functions indicate the high ability of POA exploration to find the main optimal area of the search space. Moreover, four engineering design issues are employed for estimating the efficacy of the POA in optimizing real-world applications. The findings of POA are compared with eight well-known metaheuristic algorithms to assess its competence in optimization. The simulation results and their analysis show that POA has a better and more competitive performance via striking a proportional balance between exploration and exploitation compared to eight competitor algorithms in providing optimal solutions for optimization problems. [ABSTRACT FROM AUTHOR]

In recent trends, wireless sensor networks (WSNs) have become popular because of their cost, simple structure, reliability, and developments in the communication field. The Internet of Things (IoT) refers to the interconnection of everyday objects and sharing of information through the Internet. Congestion in networks leads to transmission delays and packet loss and causes wastage of time and energy on recovery. The routing protocols are adaptive to the congestion status of the network, which can greatly improve the network performance. In this research, collision-aware routing using the multi-objective seagull optimization algorithm (CAR-MOSOA) is designed to meet the efficiency of a scalable WSN. The proposed protocol exploits the clustering process to choose cluster heads to transfer the data from source to endpoint, thus forming a scalable network, and improves the performance of the CAR-MOSOA protocol. The proposed CAR-MOSOA is simulated and examined using the NS-2.34 simulator due to its modularity and inexpensiveness. The results of the CAR-MOSOA are comprehensively investigated with existing algorithms such as fully distributed energy-aware multi-level (FDEAM) routing, energy-efficient optimal multi-path routing protocol (EOMR), tunicate swarm grey wolf optimization (TSGWO), and CoAP simple congestion control/advanced (CoCoA). The simulation results of the proposed CAR-MOSOA for 400 nodes are as follows: energy consumption, 33 J; end-to-end delay, 29 s; packet delivery ratio, 95%; and network lifetime, 973 s, which are improved compared to the FDEAM, EOMR, TSGWO, and CoCoA. [ABSTRACT FROM AUTHOR]

In this paper, a new optimization algorithm called motion-encoded electric charged particles optimization (ECPO-ME) is developed to find moving targets using unmanned aerial vehicles (UAV). The algorithm is based on the combination of the ECPO (i.e., the base algorithm) with the ME mechanism. This study is directly applicable to a real-world scenario, for instance the movement of a misplaced animal can be detected and subsequently its location can be transmitted to its caretaker. Using Bayesian theory, finding the location of a moving target is formulated as an optimization problem wherein the objective function is to maximize the probability of detecting the target. In the proposed ECPO-ME algorithm, the search trajectory is encoded as a series of UAV motion paths. These paths evolve in each iteration of the ECPO-ME algorithm. The performance of the algorithm is tested for six different scenarios with different characteristics. A statistical analysis is carried out to compare the results obtained from ECPO-ME with other well-known metaheuristics, widely used for benchmarking studies. The results found show that the ECPO-ME has great potential in finding moving targets, since it outperforms the base algorithm (i.e., ECPO) by as much as 2.16%, 5.26%, 7.17%, 14.72%, 0.79% and 3.38% for the investigated scenarios, respectively. [ABSTRACT FROM AUTHOR]

Mapping application task graphs on intellectual property (IP) cores into network-on-chip (NoC) is a non-deterministic polynomial-time hard problem. The evolution of network performance mainly depends on an effective and efficient mapping technique and the optimization of performance and cost metrics. These metrics mainly include power, reliability, area, thermal distribution and delay. A state-of-the-art mapping technique for NoC is introduced with the name of sailfish optimization algorithm (SFOA). The proposed algorithm minimizes the power dissipation of NoC via an empirical base applying a shared k-nearest neighbor clustering approach, and it gives quicker mapping over six considered standard benchmarks. The experimental results indicate that the proposed techniques outperform other existing nature-inspired metaheuristic approaches, especially in large application task graphs. [ABSTRACT FROM AUTHOR]

The image stitching process is based on the alignment and composition of multiple images that represent parts of a 3D scene. The automatic construction of panoramas from multiple digital images is a technique of great importance, finding applications in different areas such as remote sensing and inspection and maintenance in many work environments. In traditional automatic image stitching, image alignment is generally performed by the Levenberg–Marquardt numerical-based method. Although these traditional approaches only present minor flaws in the final reconstruction, the final result is not appropriate for industrial grade applications. To improve the final stitching quality, this work uses a RGBD robot capable of precise image positing. To optimize the final adjustment, this paper proposes the use of bio-inspired algorithms such as Bat Algorithm, Grey Wolf Optimizer, Arithmetic Optimization Algorithm, Salp Swarm Algorithm and Particle Swarm Optimization in order verify the efficiency and competitiveness of metaheuristics against the classical Levenberg–Marquardt method. The obtained results showed that metaheuristcs have found better solutions than the traditional approach. [ABSTRACT FROM AUTHOR]

Regular optimization techniques have been widely used in landslide-related problems. This paper outlines two novel optimizations of artificial neural network (ANN) using grey wolf optimization (GWO) and biogeography-based optimization (BBO) metaheuristic algorithms in the Ardabil province, Iran. To this end, these algorithms are synthesized with a multi-layer perceptron (MLP) neural network for optimizing its computational parameters. The used spatial database consists of fourteen landslide conditioning factors, namely elevation, slope aspect, land use, plan curvature, profile curvature, soil type, distance to river, distance to road, distance to fault, rainfall, slope degree, stream power index (SPI), topographic wetness index (TWI) and lithology. 70% of the identified landslides are randomly selected to train the proposed models and the remaining 30% is used to evaluate the accuracy of them. Also, the frequency ratio theory is used to analyze the spatial interaction between the landslide and conditioning factors. Obtained values of area under the receiver operating characteristic curve, as well as mean square error and mean absolute error showed that both GWO and BBO hybrid algorithms could efficiently improve the learning capability of the MLP. Besides, the BBO-based ensemble surpasses other implemented models. [ABSTRACT FROM AUTHOR]

Developing metaheuristic algorithms has been paid more recent attention from researchers and scholars to address the optimization problems in many fields of studies. This paper proposes a novel adaptation of the multi-group quasi-affine transformation evolutionary algorithm for global optimization. Enhanced population diversity for adaptation multi-group quasi-affine transformation evolutionary algorithm is implemented by randomly dividing its population into three groups. Each group adopts a mutation strategy differently for improving the efficiency of the algorithm. The scale factor F of mutations is updated adaptively during the search process with the different policies along with proper parameter to make a better trade-off between exploration and exploitation capability. In the experimental section, the CEC2013 test suite and the node localization in wireless sensor networks were used to verify the performance of the proposed algorithm. The experimental results are compared results with three quasi-affine transformation evolutionary algorithm variants, two different evolution variants, and two particle swarm optimization variants show that the proposed adaptation multi-group quasi-affine transformation evolutionary algorithm outperforms the competition algorithms. Moreover, analyzed results of the applied adaptation multi-group quasi-affine transformation evolutionary for node localization in wireless sensor networks showed that the proposed method produces higher localization accuracy than the other competing algorithms. [ABSTRACT FROM AUTHOR]

During the last decade, Wireless sensor networks (WSNs) have attracted interest due to the excellent monitoring capabilities offered. However, WSNs present shortcomings, such as energy cost and reliability, which hinder real-world applications. As a solution, Relay Node (RN) deployment strategies could help to improve WSNs. This fact is known as the Relay Node Placement Problem (RNPP), which is an NP-hard optimization problem. This paper proposes to address two Multi-Objective (MO) formulations of the RNPP. The first one optimizes average energy cost and average sensitivity area. The second one optimizes the two previous objectives and network reliability. The authors propose to solve the two problems through a wide range of MO metaheuristics from the three main groups in the field: evolutionary algorithms, swarm intelligence algorithms, and trajectory algorithms. These algorithms are the Non-dominated Sorting Genetic Algorithm II (NSGA-II), Strength Pareto Evolutionary Algorithm 2 (SPEA2), Multi-Objective Evolutionary Algorithm based on Decomposition (MOEA/D), Multi-Objective Artificial Bee Colony (MO-ABC), Multi-Objective Firefly Algorithm (MO-FA), Multi-Objective Gravitational Search Algorithm (MO-GSA), and Multi-Objective Variable Neighbourhood Search Algorithm (MO-VNS). The results obtained are statistically analysed to determine if there is a robust metaheuristic to be recommended for solving the RNPP independently of the number of objectives. [ABSTRACT FROM AUTHOR]