Global Search Strategy Research Articles

A hybrid metaheuristic algorithm for antimicrobial peptide toxicity prediction.

The development of new algorithms can aid researchers and professionals in resolving problems that were once unsolvable or discovering superior solutions to problems that were already settled. By recognizing the importance of continuous research on creating novel algorithms, this paper introduced a hybrid metaheuristic algorithm-h-PSOGNDO, which is a combination of Particle Swarm Optimization (PSO) and Generalized Normal Distribution Optimization (GNDO). The proposed algorithm utilizes the Particle Swarm Optimization's strategy for exploitation and the Generalized Normal Distribution Optimization's global search strategy for exploration. Through this combination, h-PSOGNDO is believed to be an effective algorithm that can promote the advantages of its parents' algorithms. Different assessment methods are used to assess the proposed novel algorithm. First, the h-PSOGNDO is set to conduct experiments on two sets of mathematical functions, including twenty-eight IEEE CEC2017 and ten IEEE CEC2019 benchmark test functions, respectively. Then, the h-PSOGNDO algorithm is applied to a case study on the prediction of antimicrobial peptides' toxicity to evaluate its performance on real-life problems. The statistical findings collected from both the test function sets and the case study show that the h-PSOGNDO algorithm works effectively, proving its astonishing ability to yield highly competitive outcomes for complex problems.

Adaptive interacting multiple model particle filter based on a dual-pattern bat algorithm for maneuvering target tracking

The interacting multiple model particle filter (IMM-PF) is a filtering method commonly used for nonlinear non-Gaussian radar systems. Its transfer probabilities are usually fixed and dependent on prior information. When tracking maneuvering targets, the IMM-PF may cause excessive tracking errors due to the model switching lag. In addition, the particle impoverishment caused by the resampling of the particle filter seriously affects the filtering accuracy. Therefore, the IMM-PF has difficulty meeting the accuracy and speed requirements of modern high-performance radar target tracking systems. To address these problems, an adaptive interacting multiple model particle filter based on the dual-pattern bat algorithm (ADIMM-DPBA-PF) is proposed for tracking maneuvering targets under nonlinear and non-Gaussian conditions. First, the adaptive model switching mechanism is established to adjust the transition probabilities using the model probability posterior information at consecutive times, improving the model switching efficiency. Second, a particle filter based on the dual-pattern bat algorithm (DPBA-PF) is proposed. The filter exploits global search and local search strategies to optimize the particles and intelligently move the particles to the high likelihood region. Finally, a particle filter based on the dual-pattern bat algorithm is used to form the adaptive interacting multiple model method. The experimental results show that the proposed algorithm has better comprehensive performance than the IMM-PF.

A hybrid particle swarm optimisation for flexible casting job shop scheduling problem with batch processing machine

AbstractA flexible casting job shop scheduling problem (FCJSP) with batch processing machines is proposed based on the analysis of the flexible job shop scheduling problem (FJSP) and the study of the expendable casting process. Considering the makespan under the influence of the energy consumption, the authors apply the time execution window to the FCJSP model in conjunction with the characteristics of casting production. A hybrid particle swarm optimisation algorithm (HPSO) is developed to solve the FCJSP. The HPSO employs a block integration decoding rule to address scheduling integration. Particle swarm optimisation is used for global search, employing both discrete and continuous search strategies. Furthermore, the local search employs tabu search with neighbourhood operations based on knowledge‐driven techniques. Simulation experiments demonstrate the feasibility of the proposed optimisation model. In the end, the HPSO algorithm has been successfully applied to the real expendable casting scheduling. The results demonstrate that it is more efficient and robust than previously reported algorithms.

Network anomaly detection using Deep Autoencoder and parallel Artificial Bee Colony algorithm-trained neural network

Cyberattacks are increasingly becoming more complex, which makes intrusion detection extremely difficult. Several intrusion detection approaches have been developed in the literature and utilized to tackle computer security intrusions. Implementing machine learning and deep learning models for network intrusion detection has been a topic of active research in cybersecurity. In this study, artificial neural networks (ANNs), a type of machine learning algorithm, are employed to determine optimal network weight sets during the training phase. Conventional training algorithms, such as back-propagation, may encounter challenges in optimization due to being entrapped within local minima during the iterative optimization process; global search strategies can be slow at locating global minima, and they may suffer from a low detection rate. In the ANN training, the Artificial Bee Colony (ABC) algorithm enables the avoidance of local minimum solutions by conducting a high-performance search in the solution space but it needs some modifications. To address these challenges, this work suggests a Deep Autoencoder (DAE)-based, vectorized, and parallelized ABC algorithm for training feed-forward artificial neural networks, which is tested on the UNSW-NB15 and NF-UNSW-NB15-v2 datasets. Our experimental results demonstrate that the proposed DAE-based parallel ABC-ANN outperforms existing metaheuristics, showing notable improvements in network intrusion detection. The experimental results reveal a notable improvement in network intrusion detection through this proposed approach, exhibiting an increase in detection rate (DR) by 0.76 to 0.81 and a reduction in false alarm rate (FAR) by 0.016 to 0.005 compared to the ANN-BP algorithm on the UNSW-NB15 dataset. Furthermore, there is a reduction in FAR by 0.006 to 0.0003 compared to the ANN-BP algorithm on the NF-UNSW-NB15-v2 dataset. These findings underscore the effectiveness of our proposed approach in enhancing network security against network intrusions.

SaDENAS: A self-adaptive differential evolution algorithm for neural architecture search

Evolutionary neural architecture search (ENAS) and differentiable architecture search (DARTS) are all prominent algorithms in neural architecture search, enabling the automated design of deep neural networks. To leverage the strengths of both methods, there exists a framework called continuous ENAS, which alternates between using gradient descent to optimize the supernet and employing evolutionary algorithms to optimize the architectural encodings. However, in continuous ENAS, there exists a premature convergence issue accompanied by the small model trap, which is a common issue in NAS. To address this issue, this paper proposes a self-adaptive differential evolution algorithm for neural architecture search (SaDENAS), which can reduce the interference caused by small models to other individuals during the optimization process, thereby avoiding premature convergence. Specifically, SaDENAS treats architectures within the search space as architectural encodings, leveraging vector differences between encodings as the basis for evolutionary operators. To achieve a trade-off between exploration and exploitation, we integrate both local and global search strategies with a mutation scaling factor to adaptively balance these two strategies. Empirical findings demonstrate that our proposed algorithm achieves better performance with superior convergence compared to other algorithms.

A Markovian dynamics for Caenorhabditis elegans behavior across scales

How do we capture the breadth of behavior in animal movement, from rapid body twitches to aging? Using high-resolution videos of the nematode worm Caenorhabditis elegans, we show that a single dynamics connects posture-scale fluctuations with trajectory diffusion and longer-lived behavioral states. We take short posture sequences as an instantaneous behavioral measure, fixing the sequence length for maximal prediction. Within the space of posture sequences, we construct a fine-scale, maximum entropy partition so that transitions among microstates define a high-fidelity Markov model, which we also use as a means of principled coarse-graining. We translate these dynamics into movement using resistive force theory, capturing the statistical properties of foraging trajectories. Predictive across scales, we leverage the longest-lived eigenvectors of the inferred Markov chain to perform a top-down subdivision of the worm's foraging behavior, revealing both "runs-and-pirouettes" as well as previously uncharacterized finer-scale behaviors. We use our model to investigate the relevance of these fine-scale behaviors for foraging success, recovering a trade-off between local and global search strategies.

Optimizing [formula omitted]-coverage in energy-saving wireless sensor networks based on the Elite Global Growth Optimizer

For energy-constrained wireless sensor networks, enhancing network fault tolerance and extending lifetime are of paramount importance. In this study, we focus on addressing the Minimum Power k-Coverage (MinPKC) problem. The objective of MinPKC is to minimize and balance the transmission (Tx) power by sensor nodes (SNs), thus extending network lifetime. Furthermore, MinPKC requires satisfying the constraints of k-coverage for the targets to enhance network fault tolerance. The problem is non-convex, multimodal, and NP-hard. To address this problem, we propose a novel metaheuristic algorithm named Elite Global Growth Optimizer (EGGO), which incorporates efficient global search and elite evolution strategies into the GO and utilizes time-varying multi-strategies for population updates. This study extensively compares EGGO with ten popular algorithms on 20 classic benchmark test functions using the Friedman and Wilcoxon rank-sum tests. The results indicate that EGGO significantly outperforms all the compared algorithms. Ablative experiments confirm the crucial role of the proposed mechanisms in EGGO for improving algorithm performance. Meanwhile, the study implements ten MinPKC methods based on comparative algorithms and compares them with the EGGO-based MinPKC method in terms of total Tx power, network lifetime, and simulation time. The experimental results indicate that the EGGO-based MinPKC method significantly increases the network lifetime by approximately 14.2%, 38.2%, and 1.9% compared to the second-best algorithm, and by 57%, 451%, and 84.8% compared to the GO, while balancing the Tx power among SNs and reducing the total Tx power by approximately 28%, 12.7%, and 0.5% compared to the second-best algorithm, and by 47.1%, 72%, and 30% compared to the GO, respectively, when k=1,2,3. Additionally, a detailed analysis is conducted on the impact of the number of SNs, the maximum target coverage capacity of each SN, as well as the effects of obstacles and their distribution on signal strength attenuation in reducing Tx power. The source code is available at https://github.com/iNet-WZU/EGGO.

A multi-population-based marine predators algorithm to train artificial neural network

Marine predators algorithm (MPA) is one of the recently proposed metaheuristic algorithms. In the MPA, position update mechanisms are implemented, emphasizing global search in the first part of the search process, balanced search in the middle, and local search in the last part. This may adversely affect the local search capability of the algorithm in the first part of the search process and the global search capability in the last part of the search process. To overcome these issues, an algorithm called MultiPopMPA with a multi-population and multi-search strategy is proposed in this study. Thanks to the proposed algorithm, local, balanced, and global search strategies of the original MPA were utilized from the beginning to the end of the search process. Thus, it is aimed to contribute to a more detailed search of the parameter space. In this study, the proposed algorithm has been applied in training artificial neural networks for 21 different classification datasets. The success of the algorithm has been scored on precision, sensitivity, specificity, and F1-score metrics and compared with eight different metaheuristic algorithms, including the original MPA. In terms of the mean rank of success, the proposed MultiPopMPA has been ranked first in precision, sensitivity, and F1-score metrics and ranked second in the specificity metric. In addition, it has been observed that the proposed algorithm outperforms its competitors in most cases in terms of convergence and stability. Finally, Wilcoxon’s signed-rank test results calculated through the MSE metric showed that the proposed algorithm produced statistically significant results in most cases.

Design and Development of Fractional Order Convolutional Neural Network Based Fractional Order Nonlinear Reactor Power Simulator for CANDU-PHWR

A highly complex nonlinear Reactor Regulating System (RRS) of Canadian Deuterium Uranium Pressurized Heavy Water Reactor (CANDU-PHWR) based Nuclear Power Plant (NPP) simulated in the present research. The internal design of RRS is secured and vendor controlled which is embedded in AC-132 Programmable Logic Controller (PLC). Therefore, the problem of the identification of the RRS controller model is addressed. A data-driven Fractional Order Nonlinear MIMO Hammerstein Model (FO-NC-MIMO-HM) of NPP is identified using an Adaptive Immune Algorithm (AIA) based on a Global Search Strategy (GSS) and Auxiliary Model Recursive Least Square Method (AMRLSM). Parameters of FO-MIMO-HM are identified using Innovative Real-Time Plant Operational Data (IRTPOD). The original PLC-based controller is replaced with a new Fractional Order Convolutional Neural Network (FO-CNN) based Fractional Order Nonlinear Controller (FO-NC). Therefore, a visual Simulator is developed for detailed modeling, control, simulation, and analysis of the proposed design scheme for RRS in Visual Basic (VB) Software. The performance of the proposed design scheme is tested and validated for different modes of RRS against benchmark data obtained from Plant Data Recorder (PDR) and found in close agreement well within the design bounds.

Moboa: a proposal for multiple objective bean optimization algorithm

The primary objective of multi-objective evolutionary algorithms (MOEAs) is to find a set of evenly distributed nondominated solutions that approximate the Pareto front (PF) of a multi-objective optimization problem (MOP) or a many-objective optimization problem (MaOP). This implies that the approximated solution set obtained by MOEAs should be as close to PF as possible while remaining diverse, adhering to criteria of convergence and diversity. However, existing MOEAs exhibit an imbalance between achieving convergence and maintaining diversity in the objective space. As far as the diversity criterion is concerned, it is still a challenge to achieve an evenly distributed approximation set with different sizes for a problem with a complicated PF shape. Furthermore, Pareto dominance has its own weaknesses as the selection criterion in evolutionary multiobjective optimization. Algorithms based on Pareto criterion (PC) can suffer from problems such as slow convergence to the optimal front and inferior performance on problems with many objectives. To effectively address these challenges, we propose a multi-objective bean optimization algorithm (MOBOA). Given that the selection of parent species, representing global optimal solutions, directly influences the convergence and diversity of the algorithm, MOBOA incorporates a preference order equilibrium parent species selection strategy (POEPSS). By extending the Pareto criterion with the preference order optimization criterion, the algorithm effectively enhances parent species selection pressure across multiple objectives. To balance convergence and diversity, MOBOA proposes a multi-population global search strategy explicitly maintaining an external archive during the search process. Leveraging the inherent multi-population advantages of bean optimization algorithm (BOA), the algorithm facilitates information sharing among the main population, auxiliary populations, and historical archive solution sets. Additionally, a diversity enhancement strategy is employed in the environmental selection stage, introducing the environmental selection strategy of the SPEA2 algorithm to generate a set of evenly distributed nondominated solutions. Experimental results on a series of widely used MOPs and MaOPs demonstrate that the proposed algorithm exhibits higher effectiveness and competitiveness compared to state-of-the-art algorithms.

A three-dimensional spring-loaded inverted pendulum walking model considering human movement speed and frequency

The spring-loaded inverted pendulum (SLIP) model is an effective model to capture the essential dynamics during human walking and/or running. However, most of the existing three-dimensional (3D) SLIP model does not explicitly account for human movement speed and frequency. To address this knowledge gap, this paper develops a new SLIP model, which includes a roller foot, massless spring, and concentrated mass. The governing equations-of-motion for the SLIP model during its double support phase are derived. It is noted that in the current formulation, the motion of the roller foot is prescribed; therefore, only the equations for the concentrated mass need to be solved. To yield model parameters leading to a periodic walking gait, a constrained optimization problem is formulated and solved using a gradient-based approach with a global search strategy. The optimization results show that when the attack angle ranges from 68° to 74°, the 3D SLIP model can yield a periodic walking gait with walking speeds varying from 0.5 to 2.0 m s−1. The predicted human walking data are also compared with published experimental data, showing reasonable accuracy.

Combining reinforcement learning algorithm and genetic algorithm to solve the traveling salesman problem

AbstractWith the growing recognition of the unique advantages of reinforcement learning and genetic algorithms in addressing combinatorial optimization problems, this study aims to integrate these two methods to collectively tackle the classic combinatorial optimization challenge of the travelling salesman problem (TSP). The TSP stands as a quintessential combinatorial optimization challenge, tasked with determining the shortest path among designated cities. This paper introduces an innovative approach by amalgamating reinforcement learning's path selection prowess with genetic algorithms' global search strategy, aiming to uncover superior solutions in TSP. Specifically, the experiment employs a dual Q‐learning algorithm within reinforcement learning to identify multiple optimal paths, serving as progenitors for the genetic algorithm to further enhance performance. The paper meticulously outlines the problem modelling process, elucidating TSP instance definitions, descriptions, and precise objective function definitions. Experimental findings underscore the substantial enhancements achievable in TSP optimization through this comprehensive approach, offering a fresh perspective and methodology for tackling combinatorial optimization challenges.

Surrogate-assisted evolutionary algorithms for expensive combinatorial optimization: a survey

As potent approaches for addressing computationally expensive optimization problems, surrogate-assisted evolutionary algorithms (SAEAs) have garnered increasing attention. Prevailing endeavors in evolutionary computation predominantly concentrate on expensive continuous optimization problems, with a notable scarcity of investigations directed toward expensive combinatorial optimization problems (ECOPs). Nevertheless, numerous ECOPs persist in practical applications. The widespread prevalence of such problems starkly contrasts the limited development of relevant research. Motivated by this disparity, this paper conducts a comprehensive survey on SAEAs tailored to address ECOPs. This survey comprises two primary segments. The first segment synthesizes prevalent global, local, hybrid, and learning search strategies, elucidating their respective strengths and weaknesses. Subsequently, the second segment furnishes an overview of surrogate-based evaluation technologies, delving into three pivotal facets: model selection, construction, and management. The paper also discusses several potential future directions for SAEAs with a focus towards expensive combinatorial optimization.

The SVD-enhanced bees algorithm, a novel procedure for point cloud registration

Point cloud registration entails the estimation of the rigid transformation which best aligns two point sets. At present, Iterative Closest Point is arguably the best-known and one of the most effective algorithms for point cloud registration. Iterative Closest Point uses singular value decomposition to optimise the alignment of two point sets via least squares fit. However, the algorithm is liable to converge to sub-optimal solutions due to its greedy search strategy. In this study, the problem of point cloud registration is addressed using the popular Bees Algorithm metaheuristic. Thanks to its global search strategy, the Bees Algorithm is known to be impervious to sub-optimal convergence. Singular value decomposition is used as a problem-specific operator within the Bees Algorithm to improve the efficiency of the search. Experimental tests showed that the standard Bees Algorithm outperformed Iterative Closest Point, an Evolutionary Algorithm, and Particle Swarm Optimisation in terms of consistency and precision of the point cloud registration results. The Bees Algorithm also excelled for its robustness to noisy data. When enhanced by singular value decomposition, the Bees Algorithm outperformed the standard Bees Algorithm, and similarly enhanced evolutionary and particle swarm optimisers. The running times of the proposed method were compatible with online implementation. It is concluded that the proposed combination of bees-inspired optimisation and least squares fitting allows accurate, efficient, and consistent registration of point cloud models.

Simulating worm feeding patterns with computational models

Worms create complex paths when moving through sediment to feed. This research applies computer simulation models to provide a unique approach to visualise and quantify the process by which complex worm paths can emerge from simple local movement decisions. A grid environment is proposed in which worms can move with choice of up to 8 directions at each step. This uses a square grid with diagonal paths which has not been investigated before and the resulting number of complex paths is increased compared to triangular grids. Results identify many novel worm paths. Some of the resulting paths are symmetrical, others produce repetitive looping paths, others return to the origin. Interesting worm paths are identified with chaotic movement. Some include oscillating between chaotic and ordered movement for which the outcome is still unknown after millions of steps. A conclusion that may be extrapolated to other creatures is that local movement decisions of a species substantially determine the overall global search strategy that emerges.

An Improved Dung Beetle Optimization Algorithm for High-Dimension Optimization and Its Engineering Applications

One of the limitations of the dung beetle optimization (DBO) is its susceptibility to local optima and its relatively low search accuracy. Several strategies have been utilized to improve the diversity, search precision, and outcomes of the DBO. However, the equilibrium between exploration and exploitation has not been achieved optimally. This paper presents a novel algorithm called the ODBO, which incorporates cat map and an opposition-based learning strategy, which is based on symmetry theory. In addition, in order to enhance the performance of the dung ball rolling phase, this paper combines the global search strategy of the osprey optimization algorithm with the position update strategy of the DBO. Additionally, we enhance the population’s diversity during the foraging phase of the DBO by incorporating vertical and horizontal crossover of individuals. This introduction of asymmetry in the crossover operation increases the exploration capability of the algorithm, allowing it to effectively escape local optima and facilitate global search.

Solving the multi-objective path planning problem for mobile robot using an improved NSGA-II algorithm

Path planning is one of the most concerned problems in mobile robotics. Given the NP-hard nature of path planning problems, the non-dominated sorting genetic algorithm (NSGA-II), as one of the outstanding evolutionary algorithms with robust optimization capabilities, is a good candidate to deal with them. In this study, an improved NSGA-II (INSGA-II) is proposed to solve the multi-objective path planning problems, in which path length, path safety and path smoothness are optimized simultaneously. First, a grid-based environment model is created, and each feasible solution is encoded as a discrete ordered point set. Second, a hybrid initialization strategy is employed to enrich the diversity of initial population. Third, besides the usual selection, crossover and mutation operators, problem-specific evolutionary operators are developed. In addition, an adaptive variable neighborhood local search strategy is designed to increase the exploitation ability of the algorithm. Moreover, a hybrid global search strategy is applied to further improve the algorithm’s the exploration ability. Finally, the proposed INSGA-II is compared with six state-of-the-art algorithms on 16 instances of four representative maps. Simulation results indicate that INSGA-II can solve the multi-objective path planning problems with high efficiency.

ATM Forecasting using Optimized Artificial Neural Networks

Abstract: Running out of money at an ATM or other place results in higher costs for unscheduled currency supplies and less income from lost surcharge fees. However, banks are unable to invest this non-earning assets to produce interest revenue due to oversupply of currency. ATM forecasting automation is therefore urgently needed. Artificial neural networks are utilized as a forecasting method in this study because they function well for automated prediction tasks. The most significant algorithm for neural network training is propagation in reverse. However, it is prone to become stuck in local minima, which might result in incorrect answers. Thereby, in order to hybridize with artificial neural networks, a few global search and optimization strategies were needed. Genetic algorithms that mimic the idea of natural growth are one such method. Therefore, a hybrid intelligent system that combines genetic algorithms and neural networks made up of neurons is presented for ATM forecasting in this study. The suggested mixed approach functioned better than the current back propagation-based system, according to the results

Multi-strategy-based adaptive sine cosine algorithm for engineering optimization problems

Sine Cosine Algorithm(SCA) is a population-based optimization algorithm, to find the optimal solution. However, SCA has problems such as premature convergence, insufficient solution precision for high-dimensional functions, and slow convergence speed. To solve the problems above, this paper proposes a multi-strategy-based Adaptive Sine Cosine Algorithm (ASCA). Firstly, a more uniform initial population is generated by the Halton sequence so that the initial population covers the entire search space to maintain the diversity of the initial population. Secondly, the adaptive grading strategy is adopted to sort according to the fitness value, and the population dynamics are divided into 4 grades: excellent, good, medium and poor. For the purpose of improving the convergence accuracy of the algorithm and enhancing the ability to jump out of the local optimum, hybrid mutation and elite guidance methods are applied to different levels of populations for perturbing mutations. Finally, in order to improve the convergence speed of the algorithm, a dynamic opposition-based learning global search strategy is proposed. The ASCA is tested on a set of 20 functions in low- dimensional and high-dimensional, and the improved algorithm is compared with Particle Swarm Optimization (PSO), Backtracking Search Algorithm(BSA), Genetic Algorithm(GA)and other improved Sine Cosine Algorithms. The results show the improved convergence accuracy and speed of the ASCA. Moreover, the ASCA proposed in this paper is applied to engineering optimization design. The solution results show that the ASCA is better than other algorithms in superiority-seeking ability, and can effectively solve the optimization problems in engineering.

Intelligent learning-based cooperative and competitive multi-objective optimization for energy-aware distributed heterogeneous welding shop scheduling

This research is focused on addressing the energy-aware distributed heterogeneous welding shop scheduling (EADHWS) problem. Our primary objectives are to minimize the maximum finish time and total energy consumption. To accomplish this, we introduce a learning-based cooperative and competitive multi-objective optimization method, which we refer to as LCCMO. We begin by presenting a multi-rule cooperative initialization approach to create a population that combines strong convergence and diversity. This diverse population forms the foundation for our optimization process. Next, we develop a multi-level cooperative global search strategy that explores effective genes within solutions from different angles and sub-problems. This approach enhances our search for optimal solutions. Moreover, we design a competition and cooperation strategy for different populations to expedite convergence. This strategy encourages the exchange of information and ideas among diverse populations, thereby accelerating our progress. We also introduce a multi-operator cooperative local search technique, which investigates elite solutions from various directions, leading to improved convergence and diversity. In addition, we integrate Q-learning into our competitive swarm optimizer to explore different regions of the objective space, enhancing the diversity of the elite archive. Q-learning guides the selection of operators within the small-size population, contributing to more efficient optimization. To evaluate the effectiveness of LCCMO, we conduct numerical experiments on 20 instances. The experimental results unequivocally demonstrate that LCCMO outperforms six state-of-the-art algorithms. This underscores the potential of our learning and knowledge-driven evolutionary framework in enhancing performance and autonomy when it comes to solving EADHWS.