Search

This paper proposes a novel nature-inspired meta-heuristic algorithm, named Snow Geese Algorithm. It is inspired by the migratory behavior of snow geese and emulates the distinctive "Herringbone" and "Straight Line" shaped flight patterns observed during their migration. The algorithm is structured into three main phases for benchmark testing. In the first phase, the Snow Geese Algorithm's numerical results are compared with those of several classical meta-heuristic algorithms using the same test functions and original data from these algorithms. In the second phase, in order to minimize potential variations during the comparison, all algorithms undergo evaluation on a standardized testing platform. In the third phase, this paper applies the Snow Geese Algorithm to solve four widely recognized engineering optimization problems: the tubular column design, piston lever optimization design, reinforced concrete beam design and car side impact design. These real-world engineering problems serve as test cases to assess Snow Geese Algorithm problem-solving capabilities. The primary objective of the Snow Geese Algorithm is to provide an alternative perspective for tackling complex optimization problems. Please note that the complete source code for the Snow Geese Algorithm is publicly available at https://github.com/stones3421/SGA-project. • Snow Geese Algorithm: A novel meta-heuristic approach inspired by snow geese flight behavior, tackling optimization problems. • Two-stage Strategy: Mimics snow geese exploration and exploitation patterns, setting it apart from traditional methods. • Performance Evaluation: Multiple algorithms are assessed on different problems. • Algorithm Features: Experimental results validate the effectiveness of the Snow Geese Algorithm. • Practical Applications: Snow Geese Algorithm shows potential in engineering optimization, aiding accurate decision-making. [ABSTRACT FROM AUTHOR]

This paper proposes the Love Evolution Algorithm (LEA), a novel evolutionary algorithm inspired by the stimulus–value–role theory. The optimization process of the LEA includes three phases: stimulus, value, and role. Both partners evolve through these phases and benefit from them regardless of the outcome of the relationship. This inspiration is abstracted into mathematical models for global optimization. The efficiency of the LEA is validated through numerical experiments with CEC2017 benchmark functions, outperforming seven metaheuristic algorithms as evidenced by the Wilcoxon signed-rank test and the Friedman test. Further tests using the CEC2022 benchmark functions confirm the competitiveness of the LEA compared to seven state-of-the-art metaheuristics. Lastly, the study extends to real-world problems, demonstrating the performance of the LEA across eight diverse engineering problems. Source codes of the LEA are publicly available at https://ww2.mathworks.cn/matlabcentral/fileexchange/159101-love-evolution-algorithm. [ABSTRACT FROM AUTHOR]

Community structure is a very interesting attribute and feature in complex networks, which has attracted scholars' attention and research on community detection. Many single-objective optimization algorithms have been migrated and modified to serve community detection problems. Due to the limitation of resolution, the final algorithm implementation effect is not ideal. In this paper, a multi-objective community detection method based on a pigeon-inspired optimization algorithm, MOPIO-Net, is proposed. Firstly, the PIO algorithm is discretized in terms of the solution space representation, position, and velocity-updating strategies to adapt to discrete community detection scenarios. Secondly, by minimizing the two objective functions of community score and community fitness at the same time, the community structure with a tight interior and sparse exterior is obtained. Finally, for the misclassification caused by boundary nodes, a mutation strategy is added to improve the accuracy of the final community recognition. Experiments on synthetic and real networks verify that the proposed algorithm is more accurate in community recognition compared to 11 benchmark algorithms, confirming the effectiveness of the proposed method. [ABSTRACT FROM AUTHOR]

In numerous scientific disciplines and practical applications, addressing optimization challenges is a common imperative. Nature-inspired optimization algorithms represent a highly valuable and pragmatic approach to tackling these complexities. This paper introduces Dendritic Growth Optimization (DGO), a novel algorithm inspired by natural branching patterns. DGO offers a novel solution for intricate optimization problems and demonstrates its efficiency in exploring diverse solution spaces. The algorithm has been extensively tested with a suite of machine learning algorithms, deep learning algorithms, and metaheuristic algorithms, and the results, both before and after optimization, unequivocally support the proposed algorithm's feasibility, effectiveness, and generalizability. Through empirical validation using established datasets like diabetes and breast cancer, the algorithm consistently enhances model performance across various domains. Beyond its working and experimental analysis, DGO's wide-ranging applications in machine learning, logistics, and engineering for solving real-world problems have been highlighted. The study also considers the challenges and practical implications of implementing DGO in multiple scenarios. As optimization remains crucial in research and industry, DGO emerges as a promising avenue for innovation and problem solving. [ABSTRACT FROM AUTHOR]

This paper presents the minimization of total harmonic distortion in a seven-level cascaded H-bridge multilevel inverter with resistive load using the teaching–learning-based optimization algorithm. The minimization of Total Harmonic Distortion (THD)is a challenging optimization problem due to the fact that nonlinear equations are involved. Recently, bio-inspired algorithms have become very popular approaches to solving various optimization problems in different areas of engineering. For this reason, the results obtained with the Teaching–Learning-Based Optimization (TLBO)algorithm were compared with three other popular bio-inspired algorithms, the genetic algorithm, differential evolution, and particle swarm optimization. The comparative analysis, conducted by sweeping the modulation index, made it possible to obtain graphs and data on the behavior of the four analyzed algorithms. Finally, it was concluded that the TLBO algorithm is very effective and is able to solve the THD-minimization problem. Its main advantage over the other algorithms is the fact that it does not require control parameters for its correct operation in the solution of the problem. [ABSTRACT FROM AUTHOR]

To cope with increasingly complex models of engineering design problems and to obtain more accurate design solutions, this paper proposed an improved population-based, bio-inspired optimization algorithm, called the pity beetle algorithm based on pheromone dispersion model (PBA-PDM). PBA-PDM enables a local and global search for optimization problems through the pheromone release mechanisms in female beetles and the interaction relationship between male beetles. The experimental results compared with other state-of-the-art metaheuristic optimization algorithms show that PBA-PDM has an ideal performance when dealing with both classical test functions and CEC2017 benchmark test functions. Then, the PBA-PDM is applied in dealing with real-world constrained engineering design problems to verify the effectiveness and applicability. The above experimental results show that the PBA-PDM proposed in this paper is an effective and efficient algorithm for solving real-world optimization problems. [ABSTRACT FROM AUTHOR]

The optimization problems are becoming more complicated, requiring new and efficient optimization techniques to solve them. Many bio-inspired meta-heuristic algorithms have emerged in the last decade to solve these complex problems as most of these algorithms may be trapped into local optima and could not effectively solve all types of optimization problems. Hence, researchers are still trying to develop new and better optimization algorithms. This paper introduces a novel biologically-based optimization algorithm called circulatory system-based optimization (CSBO). CSBO is modeled based on the function of the body's blood vessels with two distinctive circuits, i.e. pulmonary and systemic circuits. The proposed CSBO algorithm is tested on a wide variety of complex functions of the real world and validated with the standard meta-heuristic algorithms. The results indicate that the CSBO algorithm successfully achieves the optimal solutions and avoids local optima. Note that the source code of the CSBO algorithm is publicly available at . [ABSTRACT FROM AUTHOR]

Path planning is an NP-hard problem that is aimed to satisfy multi-constraint optimization requirements. In autonomous robotics applications, path planning together with collision avoidance presents a challenging task. It necessitates the generation of possible search directions from a designated point to a fixed varying destination location satisfying spatial constraints. This paper presents a framework for the design of an intelligent multi-objective robotic path planning algorithm. The algorithm relies on the generation of way-points by hybridizing two meta-heuristics techniques, namely Grey Wolf Algorithm (GWO) and Particle Swarm Optimization (PSO). A frequency-based modification in GWO search operators is introduced to fasten the search process. An improvised search strategy is employed for collision detection and avoidance, which converts non-desired points into the desired point. Sensors are deployed around the robot vicinity for search optimization. Mutation operators are then introduced to improve path length by smoothing out the trajectory. The proposed algorithm's effectivity is then validated through extensive simulations, in which different condition environments are simulated. To validate the effectiveness of the proposed methodology, the results are compared with contemporary algorithms namely Minimum Angle Artificial Bee Colony (MAABC) algorithms, Hybrid Cuckoo Search-Bat Algorithm (BA-CSA), Bacterial Bolony (BC) and Genetic Algorithm (GA) algorithms. The results conclusively demonstrated that the proposed algorithm ensures effective performance in path smoothness and safety under a wide range of conditions. • A novel intelligent multi-objective framework for robotic path planning algorithm. • A hybridizing two meta-heuristics techniques to solve the path planning. • An improvised search strategy is employed for collision detection and avoidance. • The proposed algorithm's effectively validated through extensive simulations. [ABSTRACT FROM AUTHOR]

The Internet of Things is widely used, which results in the collection of enormous amounts of data with numerous redundant, irrelevant, and noisy features. In addition, many of these features need to be managed. Consequently, developing an effective feature selection (FS) strategy becomes a difficult goal. Many FS techniques, based on bioinspired metaheuristic methods, have been developed to tackle this problem. However, these methods still suffer from limitations; so, in this paper, we developed an alternative FS technique, based on integrating operators of the chameleon swarm algorithm (Cham) with the quantum-based optimization (QBO) technique. With the use of eighteen datasets from various real-world applications, we proposed that QCham is investigated and compared to well-known FS methods. The comparisons demonstrate the benefits of including a QBO operator in the Cham because the proposed QCham can efficiently and accurately detect the most crucial features. Whereas the QCham achieves nearly 92.6%, with CPU time(s) nearly 1.7 overall the tested datasets. This indicates the advantages of QCham among comparative algorithms and high efficiency of integrating the QBO with the operators of Cham algorithm that used to enhance the process of balancing between exploration and exploitation. [ABSTRACT FROM AUTHOR]

Salp swarm algorithm (SSA) is a relatively new bio‐inspired meta‐heuristic optimization algorithm that mimics the navigating and foraging behavior of salps in oceans. This paper presents an orthogonal quasi‐opposition‐based learning‐driven dynamic SSA (OBDSSA) for solving global optimization problems. The proposed methodology integrates orthogonal quasi‐opposition‐based learning (OQOBL) tactic and dynamic learning (DL) strategy with SSA to improve its performance. The OQOBL technique is used to enrich the exploration and development capability of the canonical SSA to help the salp chain jump out of local optimum, while the DL mechanism is applied to the basic approach to expand the neighborhood searching capabilities of the search agents. To investigate the proposed operators and OBDSSA algorithm, 18 widely used benchmark functions and parameter extraction problem of photovoltaic (PV) model have been experimented upon. The comparisons reveal that OBDSSA outperforms all competitors, including the standard SSA, SSA variants, and other state‐of‐the‐art algorithms. Finally, the developed approach is applied to path planning and obstacle avoidance (PPOA) tasks in autonomous mobile robots (AMR) and satisfactory results are obtained. [ABSTRACT FROM AUTHOR]

Vehicular Ad-hoc NETworks (VANETs) are very important in the field of Intelligent Transportation system (ITS) for enhancing the safety of road. The communication between the vehicles will be covered under the VANETs. A lot of research works are there in the area of VANET development. The common problem that arises is achieving multiconstrained Quality of Service metrics. In order to solve this problem, this paper proposes an optimal routing discovery algorithm to aid the routing process in the VANET. Firstly, this paper derives a cost model for vehicle routing problems by considering the network quality metrics such as travel cost, collision, congestion, and the awareness about the quality of service (QoS). The QoS awareness is fuzzified into cost model to be included in the total routing cost. Since the routing cost model is a minimization function, a recently introduced bio-inspired optimization algorithm, called lion algorithm (LA), is used to solve the function. The performance is investigated using three renowned analyses such as convergence analysis, cost analysis, and complexity analysis. The simulated results obtained using MATLAB are compared with the existing Genetic algorithm (GA) based solution. It is found that the Lion algorithm performs better than the GA with a decrease in routing cost and complexity. [ABSTRACT FROM AUTHOR]

Selective harmonics elimination (SHE) is a widely applied control strategy in multilvel inverters for harmonics reduction. SHE is designed for the elimination of low-order harmonics while keeping the fundamental component equal to any previously specified amplitude. This paper proposes a novel bio-inspired metaheuristic optimization algorithm called Black Widow Optimization Algorithm (BWOA) for solving the SHE set of equations. BWOA mimics the spiders' different movement strategies for courtship-mating, guaranteeing the exploration and exploitation of the search space. The optimization results show the reliability of BWOA compared to the state-of-the-art metaheuristic algorithms and show competitive results as a microalgorithm, opening its future application for an on-line optimization calculation in low requirement hardware. [ABSTRACT FROM AUTHOR]

Wireless sensor networks (WSNs) comprise a large number of tiny sensing nodes, which are battery-powered with limited energy. An energy-efficient routing protocol is of utmost importance to prolong the network lifetime. Clustering is the most common technique to balance energy consumption among all nodes, while minimizing traffic and overhead during the data transmission phases. In this paper, a Multi-Objective nature-inspired algorithm based on Shuffled frog-leaping algorithm and Firefly Algorithm (named MOSFA) as an adaptive application-specific clustering-based multi-hop routing protocol for WSNs is proposed. MOSFA's multi-objective function regards different criteria (e.g., inter- and intra-cluster distances, the residual energy of nodes, distances from the sink, overlap, and load of clusters) to select appropriate cluster heads at each round. Moreover, another multi-objective function is proposed to select the forwarder nodes in the routing phase. The controllable parameters of MOSFA in both clustering and multi-hop phases can be adaptively tuned to achieve the best performance based on the network requirements according to the specific application. Simulation results demonstrate average lifetime improvements of 182%, 68%, 30%, and 28% when compared with LEACH, ERA, SIF, and FSFLA, respectively, in different network scenarios. [ABSTRACT FROM AUTHOR]

G-Protein-Coupled Receptors (GPCR) are the large family of protein membrane; and until now some of them still remain orphans. Predicting GPCR functions is a challenging task, it depends closely to their classification, which requires a digital representation of each protein chain as an attribute vector. A major problem of GPCR databases is their great number of features which can produce combinatorial explosion and increase the complexity of classification algorithms. Feature selection techniques are used to deal with this problem by minimizing features space dimension, and keeping the most relevant ones. In this paper, we propose to use the BAT algorithm for extracting the pertinent features and to improve the classification results. We compared the results obtained by our system with two other bio-inspired algorithms, Evolutionary Algorithm and PSO search. Metrics quality measures used for comparison are Error Rate, Accuracy, MCC and F -measure. Experimental results indicate that our system is more efficient. [ABSTRACT FROM AUTHOR]

Highlights • Two binary variants of the butterfly optimization algorithm (BOA) are proposed. • Two transfer functions are used to map the continuous search space to discrete one. • Twenty one UCI datasets are utilized in the experiments. • A superior performance of the proposed binary variants is proved in the experiments. Abstract In this paper, binary variants of the Butterfly Optimization Algorithm (BOA) are proposed and used to select the optimal feature subset for classification purposes in a wrapper-mode. BOA is a recently proposed algorithm that has not been systematically applied to feature selection problems yet. BOA can efficiently explore the feature space for optimal or near-optimal feature subset minimizing a given fitness function. The two proposed binary variants of BOA are applied to select the optimal feature combination that maximizes classification accuracy while minimizing the number of selected features. In these variants, the native BOA is utilized while its continuous steps are bounded in a threshold using a suitable threshold function after squashing them. The proposed binary algorithms are compared with five state-of-the-art approaches and four latest high performing optimization algorithms. A number of assessment indicators are utilized to properly assess and compare the performance of these algorithms over 21 datasets from the UCI repository. The experimental results confirm the efficiency of the proposed approaches in improving the classification accuracy compared to other wrapper-based algorithms, which proves the ability of BOA algorithm in searching the feature space and selecting the most informative attributes for classification tasks. [ABSTRACT FROM AUTHOR]

Massively complex systems, such as social networks (Camacho, Panizo-LLedot, Bello-Orgaz, Gonzalez-Pardo, & Cambria, 2020; Lara-Cabrera et al., 2017), renewable energy problems (Twidell & Weir, 2015), or Internet-of-Things problems (Lin et al., 2017), generate massive amounts of data. This special issue welcomed submissions of original papers introducing research results on all the aspects covering the application of CI algorithms to massively complex systems, ranging from concepts and theoretical developments to advanced technologies and innovative applications. GRASP algorithm is also used in the paper by Pérez-Peló, Sánchez-Oro, & Duarte (2020), where the authors tackle the I i -separator problem. [Extracted from the article]

Maximisation of influence propagation is a key ingredient to any viral marketing or socio-political campaigns. However, it is an NP-hard problem, and various approximate algorithms have been suggested to address the issue, though not largely successful. In this paper, we propose a bio-inspired approach to select the initial set of nodes which is significant in rapid convergence towards a sub-optimal solution in minimal runtime. The performance of the algorithm is evaluated using the re-tweet network of the hashtag #KissofLove on Twitter associated with the non-violent protest against the moral policing spread to many parts of India. Comparison with existing centrality based node ranking process the proposed method significant improvement on influence propagation. The proposed algorithm is one of the hardly few bio-inspired algorithms in network theory. We also report the results of the exploratory analysis of the network kiss of love campaign. [ABSTRACT FROM AUTHOR]

• A novel method to improve the performance of population-based optimizers. • The combination lock algorithm used as a pre-processing optimization method. • The combination lock algorithm produces an elite individual. • The elite individual is inserted into the initial population of optimizers. • The new algorithm significantly improves the performance of optimizers. Nature-inspired population-based metaheuristics are promising search methods for solving optimization problems. In this paper, a novel systematic pre-processing approach, called the combination lock algorithm, for obtaining a good starting point for population-based algorithms is proposed. The proposed algorithm is tested on 32 benchmark unconstrained multidimensional optimization problems of different characteristics that are either unimodal or multimodal, continuous or non-continuous, separable or non-separable, differentiable or non-differentiable. The tests also include four engineering constrained optimization benchmark problems. The experimental results of applying the proposed algorithm for the Particle Swarm Optimization, the Ant Colony Optimization for Continuous Domain, and the Grey Wolf Optimization were compared with the results obtained from the conventional approach of initializing the starting population of population-based metaheuristic methods. The simulation results show the potential of the proposed algorithm as an efficient and reliable approach to enhance the performance of population-based optimization algorithms such that, overall, 50% and up to 100% of the tested problems "across various population size" settings, had either improved or equalled the optimal values when the proposed algorithm was applied. [ABSTRACT FROM AUTHOR]

In this paper, a new bio-inspired meta-heuristic algorithm, named artificial rabbits optimization (ARO), is proposed and tested comprehensively. The inspiration of the ARO algorithm is the survival strategies of rabbits in nature, including detour foraging and random hiding. The detour foraging strategy enforces a rabbit to eat the grass near other rabbits' nests, which can prevent its nest from being discovered by predators. The random hiding strategy enables a rabbit to randomly choose one burrow from its own burrows for hiding, which can decrease the possibility of being captured by its enemies. Besides, the energy shrink of rabbits will result in the transition from the detour foraging strategy to the random hiding strategy. This study mathematically models such survival strategies to develop a new optimizer. The effectiveness of ARO is tested by comparison with other well-known optimizers by solving a suite of 31 benchmark functions and five engineering problems. The results show that ARO generally outperforms the tested competitors for solving the benchmark functions and engineering problems. ARO is applied to the fault diagnosis of a rolling bearing, in which the back-propagation (BP) network optimized by ARO is developed. The case study results demonstrate the practicability of the ARO optimizer in solving challenging real-world problems. The source code of ARO is publicly available at https://seyedalimirjalili.com/aro and https://ww2.mathworks.cn/matlabcentral/fileexchange/110250-artificial-rabbits-optimization-aro. • A new bio-inspired artificial rabbits optimization (ARO) algorithm is proposed. • ARO is inspired by the survival strategies of rabbits in nature. • The results on 31 well-known test functions show the efficiency of ARO. • ARO yields superior results over its competitors on 5 engineering problems. • ARO is successfully applied in fault diagnosis of rolling bearing. [ABSTRACT FROM AUTHOR]

Bioinspired intelligent algorithm (BIA) is a kind of intelligent computing method, which is with a more lifelike biological working mechanism than other types. BIAs have made significant progress in both understanding of the neuroscience and biological systems and applying to various fields. Mobile robot control is one of the main application fields of BIAs which has attracted more and more attention, because mobile robots can be used widely and general artificial intelligent algorithms meet a development bottleneck in this field, such as complex computing and the dependence on high-precision sensors. This paper presents a survey of recent research in BIAs, which focuses on the research in the realization of various BIAs based on different working mechanisms and the applications for mobile robot control, to help in understanding BIAs comprehensively and clearly. The survey has four primary parts: a classification of BIAs from the biomimetic mechanism, a summary of several typical BIAs from different levels, an overview of current applications of BIAs in mobile robot control, and a description of some possible future directions for research. [ABSTRACT FROM AUTHOR]

In recent years, new metaheuristic algorithms have been developed taking as reference the inspiration on biological and natural phenomena. This nature-inspired approach for algorithm development has been widely used by many researchers in solving optimization problems. These algorithms have been compared with the traditional ones and have demonstrated to be superior in many complex problems. This paper attempts to describe the algorithms based on nature, which are used in optimizing fuzzy clustering in real-world applications. We briefly describe the optimization methods, the most cited ones, nature-inspired algorithms that have been published in recent years, authors, networks and relationship of the works, etc. We believe the paper can serve as a basis for analysis of the new area of nature and bio-inspired optimization of fuzzy clustering. [ABSTRACT FROM AUTHOR]

Today, incorporating advanced machine learning techniques into intrusion detection systems (IDSs) plays a crucial role in securing mobile edge computing systems. However, the mobility demands of our modern society require more advanced IDSs to make a good trade-off between coping with the rapid growth of traffic data and responding to attacks. Thus, in this paper, we propose a lightweight distributed IDS that exploits the advantages of centralized platforms to train and learn from large amounts of data. We investigate the benefits of two promising bio-inspired optimization algorithms, namely Ant Lion Optimization and Ant Colony Optimization, to find the optimal data representation for the classification process. We use Deep Forest as a classifier to detect intrusive actions more robustly and generate as few false positives as possible. The experiment results show that the proposed approach can enhance the reliability of lightweight intrusion detection systems in terms of accuracy and execution time. [Display omitted] • Hybrid learning model has benefits in supporting intrusion detection in mobile edge computing. • Deep Forest is effective in strengthening attack detection predictability of IDSs in mobile edge computing. • Bio-inspired optimization algorithms improve the classification process. • The employed strategy enhances attack recognition of IDSs to deal with different threats in mobile edge computing. [ABSTRACT FROM AUTHOR]

In the world of optimization, especially concerning metaheuristics, solving complex problems represented by applying big data and constraint instances can be difficult. This is mainly due to the difficulty of implementing efficient solutions that can solve complex optimization problems in adequate time, which do exist in different industries. Big data has demonstrated its efficiency in solving different concerns in information management. In this paper, an approach based on multiprocessing is proposed wherein clusterization and parallelism are used together to improve the search process of metaheuristics when solving large instances of complex optimization problems, incorporating collaborative elements that enhance the quality of the solution. The proposal deals with machine learning algorithms to improve the segmentation of the search space. Particularly, two different clustering methods belonging to automatic learning techniques, are implemented on bio-inspired algorithms to smartly initialize their solution population, and then organize the resolution from the beginning of the search. The results show that this approach is competitive with other techniques in solving a large set of cases of a well-known NP-hard problem without incorporating too much additional complexity into the metaheuristic algorithms. [ABSTRACT FROM AUTHOR]

This paper introduces a novel population-based bio-inspired meta-heuristic optimization algorithm, called Blood Coagulation Algorithm (BCA). BCA derives inspiration from the process of blood coagulation in the human body. The underlying concepts and ideas behind the proposed algorithm are the cooperative behavior of thrombocytes and their intelligent strategy of clot formation. These behaviors are modeled and utilized to underscore intensification and diversification in a given search space. A comparison with various state-of-the-art meta-heuristic algorithms over a test suite of 23 renowned benchmark functions reflects the efficiency of BCA. An extensive investigation is conducted to analyze the performance, convergence behavior and computational complexity of BCA. The comparative study and statistical test analysis demonstrate that BCA offers very competitive and statistically significant results compared to other eminent meta-heuristic algorithms. Experimental results also show the consistent performance of BCA in high dimensional search spaces. Furthermore, we demonstrate the applicability of BCA on real-world applications by solving several real-life engineering problems. [ABSTRACT FROM AUTHOR]

How to identify influential nodes is a key issue in complex networks. The degree centrality is simple, but is incapable to reflect the global characteristics of networks. Betweenness centrality and closeness centrality do not consider the location of nodes in the networks, and semi-local centrality, leaderRank and pageRank approaches can be only applied in unweighted networks. In this paper, a bio-inspired centrality measure model is proposed, which combines the Physarum centrality with the K-shell index obtained by K-shell decomposition analysis, to identify influential nodes in weighted networks. Then, we use the Susceptible-Infected (SI) model to evaluate the performance. Examples and applications are given to demonstrate the adaptivity and efficiency of the proposed method. In addition, the results are compared with existing methods. [ABSTRACT FROM AUTHOR]

Abstract: In general, times series forecasting is considered as a highly complex problem, which is particularly true for financial time series. In this paper, a fuzzy model evolved through a bio-inspired algorithm is proposed to produce accurate models for the prediction of these time series. The performance of this model is compared to that of a group of state-of-the-art statistical models. A thorough experimental study is designed and carry out in order to assess the merits of the proposal. The experimental results allow us to state that our proposal forecasts consistently outperform the other considered methods. [Copyright &y& Elsevier]

Wireless sensor networks basically consist of low cost sensor nodes which collect data from environment and relay them to a sink, where they will be subsequently processed. Since wireless nodes are severely power-constrained, the major concern is how to conserve the nodes' energy so that network lifetime can be extended significantly. Employing one static sink can rapidly exhaust the energy of sink neighbors. Furthermore, using a non-optimal single path together with a maximum transmission power level may quickly deplete the energy of individual nodes on the route. This all results in unbalanced energy consumption through the sensor field, and hence a negative effect on the network lifetime. In this paper, we present a comprehensive taxonomy of the various mechanisms applied for increasing the network lifetime. These techniques, whether in the routing or cross-layer area, fall within the following types: multi-sink, mobile sink, multi-path, power control and bio-inspired algorithms, depending on the protocol operation. In this taxonomy, special attention has been devoted to the multi-sink, power control and bio-inspired algorithms, which have not yet received much consideration in the literature. Moreover, each class covers a variety of the state-of-the-art protocols, which should provide ideas for potential future works. Finally, we compare these mechanisms and discuss open research issues. [ABSTRACT FROM AUTHOR]

Abstract: In this paper a novel approach is developed for optimization of piezoelectric actuators in vibration suppression. A scaled model of a vertical tail of F/A-18 is developed in which piezoelectric actuators are bounded to the surface. The frequency response function (FRF) of the system is then recorded and maximization of the FRF peaks is considered as the objective function of the optimization algorithm to enhance the actuator authority on the mode, which assigns the optimal placement of the pair of piezoelectric actuators on the smart fin. Six multi-layer perceptron neural networks are employed to perform surface fitting to the discrete data generated by the finite element method (FEM). Invasive weed optimization (IWO), a novel numerical stochastic optimization algorithm, is then employed to maximize the FRF peak which in due reduces the vibration of the smart fin. Results indicated an accurate surface fitting for the FRF peak data as well as the optimal placement of the piezoelectric actuators for vibration suppression. [Copyright &y& Elsevier]

Bio-inspired computing is an engaging area of artificial intelligence which studies how natural phenomena provide a rich source of inspiration in the design of smart procedures able to become powerful algorithms. Many of these procedures have been successfully used in classification, prediction, and optimization problems. Swarm intelligence methods are a kind of bio-inspired algorithm that have been shown to be impressive optimization solvers for a long time. However, for these algorithms to reach their maximum performance, the proper setting of the initial parameters by an expert user is required. This task is extremely comprehensive and it must be done in a previous phase of the search process. Different online methods have been developed to support swarm intelligence techniques, however, this issue remains an open challenge. In this paper, we propose a hybrid approach that allows adjusting the parameters based on a state deducted by the swarm intelligence algorithm. The state deduction is determined by the classification of a chain of observations using the hidden Markov model. The results show that our proposal exhibits good performance compared to the original version. [ABSTRACT FROM AUTHOR]

Three modules are used in the presented solution for biomedical image segmentation: pretraining on a rich dataset for salient detection (P); a segmentation method that is based on the U-Net structure (U); and, an unsupervised self-aware back propagation method to update the U-Net (B). Last but not least, in the paper of Roland Lõuk et al., titled Pavement Defect Segmentation in Orthoframes with a Pipeline of Three Convolutional Neural Networks [[6]], a novel ensemble neural network structure is proposed for highway pavement defect detection. The input data are masked orthoframes, which are processed in a pipeline of three models: road segmentation is followed by defect detection and, finally, defect segmentation. [Extracted from the article]

• We propose a novel metaheuristic based on vapor-liquid equilibrium (VLE) process. • We present a new binary programming model for the PBAP modeled via the COP technique. • We perform a large composition between VLE and different already reported methods. Bio-inspired computing is an emerging paradigm which is based on the basics and inspiration of natural phenomena to design new and robust competing techniques. Various nature science areas have motivated the inspiration for the design of new intelligent systems. Chemical engineering is one of them. In Chemistry, the vapor-liquid equilibrium process describes the distribution of chemical species combining two essential phases: vapor phase and liquid phase. Using a binary system of compounds is possible to simulate a search process based on the equilibrium between both phases. In this paper, we propose a new algorithm inspired by this chemical phenomenon for solving a new patient bed assignment problem. This problem consists of assigning patients to beds by considering relevant medical requirements trying to maximize the most covered soft constraints. For that, we take a traditional model, and we transform it by using the constraint optimization paradigm. We test our algorithm on 30 benchmarks taken of Chilean health services. To verify results, we perform statistical comparatives with artificial bee algorithm, ant colony optimization, the bat method, cuckoo search, genetic algorithm, particle swarm optimization, and a random strategy. Computational experiments illustrate that the VLE algorithm properly solved 30 instances, finding all global optimal. In nineteen instances, VLE converged towards the best solution in its median value. In ten instances, the median, the average and the best value, all of them achieved the global optimal. Now, when comparing VLE against other techniques, we can note that VLE is surpassed by the artificial bee colony in two instances only. The rest of the results show VLE as a robust algorithm able to suppress classical, such as genetic algorithm and particle swarm optimization. [ABSTRACT FROM AUTHOR]

Metaheuristics are smart problem solvers devoted to tackling particularly large optimization problems. During the last 20 years, they have largely been used to solve different problems from the academic as well as from the real-world. However, most of them have originally been designed for operating over real domain variables, being necessary to tailor its internal core, for instance, to be effective in a binary space of solutions. Various works have demonstrated that this internal modification, known as binarization, is not a simple task, since the several existing binarization ways may lead to very different results. This of course forces the user to implement and analyze a large list of binarization schemas for reaching good results. In this paper, we explore two efficient clustering methods, namely KMeans and DBscan to alter a metaheuristic in order to improve it, and thus do not require on the knowledge of an expert user for identifying which binarization strategy works better during the run. Both techniques have widely been applied to solve clustering problems, allowing us to exploit useful information gathered during the search to efficiently control and improve the binarization process. We integrate those techniques to a recent metaheuristic called Crow Search, and we conduct experiments where KMeans and DBscan are contrasted to 32 different binarization methods. The results show that the proposed approaches outperform most of the binarization strategies for a large list of well-known optimization instances. [ABSTRACT FROM AUTHOR]

This paper introduces a bio-inspired metaheuristic optimization algorithm named Tunicate Swarm Algorithm (TSA). The proposed algorithm imitates jet propulsion and swarm behaviors of tunicates during the navigation and foraging process. The performance of TSA is evaluated on seventy-four benchmark test problems employing sensitivity, convergence and scalability analysis along with ANOVA test. The efficacy of this algorithm is further compared with several well-regarded metaheuristic approaches based on the generated optimal solutions. In addition, we also executed the proposed algorithm on six constrained and one unconstrained engineering design problems to further verify its robustness. The simulation results demonstrate that TSA generates better optimal solutions in comparison to other competitive algorithms and is capable of solving real case studies having unknown search spaces. Note that the source codes of the proposed TSA algorithm are available at [ABSTRACT FROM AUTHOR]