The novelty of this research article is to study the effect of new introduced emergency vacation of a single service provider in service system via queueing-theoretic approach and comparative analysis of some metaheur...
详细信息
The novelty of this research article is to study the effect of new introduced emergency vacation of a single service provider in service system via queueing-theoretic approach and comparative analysis of some metaheuristic and heuristic optimization techniques for optimal control. According to this vacation policy, the working state server takes a vacation in an emergency without completing the ongoing service of the waiting customer in the system. For the modeling purpose, it is assumed that the inter-arrival times, service times and vacation times are exponentially distributed. A cost optimization problem is developed to obtain the optimal values of system design parameters. The comparative analysis of proposed metaheuristic technique bat algorithm (BA) with another well-known metaheuristic technique: particle swarm optimization (PSO), and heuristic technique: Quasi-Newton method has been done to achieve the optimal operating conditions with minimal expected cost. Finally, numerical simulations and illustrations are provided to get an understanding of the mathematical modeling in detail and performance analysis of the queueing measures is also done. Numerical results are summarized in tables and graphs to provide a quick insight into critical issues related to the studied model. Concluding remarks are also drawn along with the future scope of the present study. (C) 2019 Elsevier B.V. All rights reserved.
This work proposes a new approach to the well-known method bat algorithm for solving the mobile robots global localization problem. The proposed method is leader-based bat algorithm (LBBA). The LBBA uses a small numbe...
详细信息
This work proposes a new approach to the well-known method bat algorithm for solving the mobile robots global localization problem. The proposed method is leader-based bat algorithm (LBBA). The LBBA uses a small number of better micro-bats as leaders to influence the colony in the search for the best position, dealing satisfactorily with ambiguities during the localization process. The tests covered different scenarios aiming at comparing the proposed algorithm with other methods, such as the standard BA, the particle swarm optimization and particle filter. The results outperformed the compared methods, presenting a fast response and errors below the intended tolerance. The algorithm was tested in the robot kidnapping scenario and shows fast recovery in both simulation and in a real environment. In addition, the proposed technique showed 21% lower average error when compared with an algorithm that presents a variable quantity of particles, i.e. the adaptive Monte Carlo localization algorithm.
Intrusion detection system (IDS) is the process of monitoring and analysing security activities occurring in computer or network systems. The detection method can perform either anomaly-based or misuse-based detection...
详细信息
Intrusion detection system (IDS) is the process of monitoring and analysing security activities occurring in computer or network systems. The detection method can perform either anomaly-based or misuse-based detection. The misuse mechanism aims to detect predefined attack scenarios in the audit trails, whereas the anomaly detection mechanism aims to detect deviations from normal user behaviour. In this paper, we deal with misuse detection. We propose two approaches to solve the NP-hard security audit trail analysis problem. Both rely on the Manhattan distance measure to improve the intrusion detection quality. The first proposed method, named enhanced binary bat algorithm (EBBA), is an improvement of bat algorithm (BA). The second one, named enhanced integer ant colony system (EIACS), is a combination of two metaheuristics: ant colony system (ACS) and simulated annealing (SA). Experiment results indicate that, for large problem size, the performance of EIACS is more significant than EBBA.
Multirobot target searching in unknown environments is a currently trending topic of discussion. In this paper, an improved bat algorithm (BA) for multirobot target searching in unknown environments, named adaptive ro...
详细信息
Multirobot target searching in unknown environments is a currently trending topic of discussion. In this paper, an improved bat algorithm (BA) for multirobot target searching in unknown environments, named adaptive robotic bat algorithm (ARBA), is proposed;it acts as the controlling mechanism for robots. The obstacle avoidance problem is considered in the proposed ARBA. The adaptive inertial weight strategy helps ARBA improve its diversity and provides an effective mechanism for escaping from local optima. In addition, the Doppler effect is introduced to improve ARBA;the effect can be adaptively compensated when the robot moves and helps robots avoid premature convergence. Moreover, the location of the target in an unknown environment is unknown, and a multi-swarm strategy is introduced into the ARBA to improve the diversity and expand the search space of robots so that robots can find the location of the target as well as the target itself faster than the existing algorithms. Experiments were conducted in three aspects to verify the effectiveness and efficiency of AREA. We compared ARBA with the other algorithms in this field;the experimental results demonstrate that ARBA exhibits better performance in multirobot target searching and can be applied to multirobot intelligent systems. (C) 2019 Elsevier Ltd. All rights reserved.
Multi-point shortest path planning problem is a typical problems in discrete optimization. The bat algorithm is a nature-inspired metaheuristic optimization algorithm that is used in a wide range of fields. However, t...
详细信息
Multi-point shortest path planning problem is a typical problems in discrete optimization. The bat algorithm is a nature-inspired metaheuristic optimization algorithm that is used in a wide range of fields. However, there is one problem with the BA, which is easy to premature. To solve multi-point shortest path planning problem, an improved discrete bat algorithm (IDBA) is proposed in this paper. In this algorithm, the Floyd-Warshall algorithm is first used to transform an incomplete connected graph into a complete graph whose vertex set consists of a start point and necessary points. Then the algorithm simulates the bats' foraging and obstacle avoidance process to find the shortest path in the complete graph to satisfy the constraints. Finally, the path is transferred to the original incomplete graph to get the solution. In order to overcome the premature phenomenon of a discrete bat algorithm, the modified neighborhood operator is proposed. To prove the effectiveness of our method, we compared its performance in 26 instances with the results obtained by three different algorithms: DBA, IBA and GSA-ACS-PSOT. We also performed a sensitivity analysis on the parameters. The results indicate that the improved bat algorithm outperforms all the other alternatives in most cases. (C) 2020 Elsevier B.V. All rights reserved.
As one of the most popular and effective image segmentation methods, multi-level thresholding is widely used. However, too much computation is needed to select the optimal thresholds with basic ergodic method. In orde...
详细信息
As one of the most popular and effective image segmentation methods, multi-level thresholding is widely used. However, too much computation is needed to select the optimal thresholds with basic ergodic method. In order to solve this problem, a hybrid bat algorithm (IWBA) which incorporates bat algorithm with invasive weed optimization (IWO) is employed to choose the optimal thresholds. In IWBA algorithm, the local search ability is enhanced by integrating with IWO algorithm. Furthermore, a new inertia weight based on Lagrange interpolation is proposed to balance exploration and exploitation. In IWBA algorithm, scale parameter of normal distribution is adjusted according to the value of fitness. It is established that IWBA algorithm is able to segment the image in more efficient and accurate way than other algorithms. More importantly, IWBA algorithm can also be applied to other fields.
In this paper, a modified version of the bat algorithm (BA), called enhanced Levy flight bat algorithm (ELBA), is proposed for accurate and efficient parameter extraction of different photovoltaic (PV) models from exp...
详细信息
In this paper, a modified version of the bat algorithm (BA), called enhanced Levy flight bat algorithm (ELBA), is proposed for accurate and efficient parameter extraction of different photovoltaic (PV) models from experimental data. Typically, it is formulated as a multimodal nonlinear optimization problem in which the objective function is to minimize the root mean square error verified between the real data and the simulated ones by the PV model at hand, considering certain values for its parameters. In addition, the constraints are associated to the lower and upper bounds of these parameters. From the computational perspective, the main innovations of ELBA lies in the: (i) introduction of a specific mathematical expression to enhance the diversification of new solutions;(ii) adoption of a mathematical expression based on the Levy flight to perform an effective local search;and (iii) selection of new equations for updating certain control parameters, which provide a better balance between the exploration and exploitation mechanisms of the algorithm. Simulation results comprehensively demonstrate that ELBA has a very competitive performance in terms of effectiveness, robustness, stability, convergence speed and time of simulation, in relation to other state-of-the-art metaheuristic algorithms. Therefore, the major contribution of this paper is the ELBA, a modified metaheuristic algorithm which proves to be a promising tool for parameter extraction of different PV models from experimental data.
bat algorithm (BA) turns into the most generally utilized meta-heuristic algorithm to solve the different sort of global optimization problems. In the optimization of continuous data, BA experiences one of the promine...
详细信息
bat algorithm (BA) turns into the most generally utilized meta-heuristic algorithm to solve the different sort of global optimization problems. In the optimization of continuous data, BA experiences one of the prominent difficulties called premature convergence. In order to tackle premature convergence, this study exhibits a new version of BA called Adaptive inertia weight bat algorithm with Sugeno-Function Fuzzy Search (ASF-BA). The proposed algorithm ASF-BA brings two major adjustments in the standard BA. Firstly, we incorporated an adaptive inertia weight to boost up the velocity rate of bats effectively. Secondly, we replaced the random searching method of standard BA with Sugeno-Function fuzzy search, which used Sugeno-Function decline curves to dynamically adjust the fitness of each bat according to their own experience and experience of their neighbour bats. We compared ASF-BA with several old fashioned and new fashioned optimization algorithms. ASF-BA is also tested against top hybridized and enhanced version of DE algorithms. The CEC 2017 benchmark (30 real parameter numerical optimization problems), CEC 2017 (28 constrained optimization problems) and 19 additional benchmark problems have been used to examine and compare the performance of ASF-BA with other state of the art variants. Contrasted with the existing BA and other leading variants of BA, DE, and PSO on CEC 2017 constrained and numerical benchmarks, the ASF-BA is excellent to the state-of-art variants of BA, DE, and PSO in terms of stability, convergence speed and solution quality. The ASF-BA sets stable support for resolving optimization problems of intelligent and expert systems. Furthermore, we also examined the performance of proposed ASF-BA for the weight optimization of Feed Forward Neural Networks (FFNN) and compared ASF-BA with Back Propagation algorithm (BPA), BA and PSO. ASF-BA achieved 94 % of maximum accuracy. The experimental outcomes reveal that the suggested algorithm executed espec
Wireless sensor networks (WSN) have high value in the field of wireless communications. As the earliest WSN clustering protocol, Low Energy Adaptive Clustering Hierarchy (LEACH) can effectively reduce the energy consu...
详细信息
Wireless sensor networks (WSN) have high value in the field of wireless communications. As the earliest WSN clustering protocol, Low Energy Adaptive Clustering Hierarchy (LEACH) can effectively reduce the energy consumption of data transmission in sensor networks. However, LEACH has some problems such as cluster head nodes are unevenly distributed. In this paper, a unified heuristic bat algorithm (UHBA) is proposed to optimize elections in cluster heads. This algorithm guarantees that the election of cluster heads can freely transform both global search and local search. Meanwhile, comparing with several other variants of the bat algorithm in CEC2013 test suite, it can be seen from results that UHBA has better performance. Moreover, the application of the algorithm on LEACH is better than other algorithms, which further proves that the algorithm has better results.
In a neural network, the weights act as parameters to determine the output(s) from a set of inputs. The weights are used to find the activation values of nodes of a layer from the values of the previous layer. Finding...
详细信息
In a neural network, the weights act as parameters to determine the output(s) from a set of inputs. The weights are used to find the activation values of nodes of a layer from the values of the previous layer. Finding the ideal set of these weights for training a Multi-layer Perceptron neural network such that it minimizes the classification error is a widely known optimization problem. The presented article proposes a Hybrid Wolf-bat algorithm, a novel optimization algorithm, as a solution to solve the discussed problem. The proposed algorithm is a hybrid of two already existing nature-inspired algorithms, Grey Wolf Optimization algorithm and bat algorithm. The novel introduced approach is tested on ten different datasets of the medical field, obtained from the UCI machine learning repository. The performance of the proposed algorithm is compared with the recently developed nature-inspired algorithms: Grey Wolf Optimization algorithm, Cuckoo Search, bat algorithm, and Whale Optimization algorithm, along with the standard Back-propagation training method available in the literature. The obtained results demonstrate that the proposed method outperforms other bio-inspired algorithms in terms of both speed of convergence and accuracy.
暂无评论