scholarly journals Robust Optimization of Signal Control Parameters for Unsaturated Intersection Based on Tabu Search-Artificial Bee Colony Algorithm

IEEE Access ◽  
2018 ◽  
Vol 6 ◽  
pp. 32015-32022 ◽  
Author(s):  
Wei Hao ◽  
Changxi Ma ◽  
Bahman Moghimi ◽  
Yuanyuan Fan ◽  
Zhibo Gao
Keyword(s):  
Tabu Search ◽  
Robust Optimization ◽  
Artificial Bee Colony Algorithm ◽  
Artificial Bee Colony ◽  
Signal Control ◽  
Control Parameters ◽  
Bee Colony

scholarly journals Multiobjective Cognitive Cooperative Jamming Decision-Making Method Based on Tabu Search-Artificial Bee Colony Algorithm

2018 ◽  
Vol 2018 ◽  
pp. 1-10 ◽  
Author(s):  
Fang Ye ◽  
Fei Che ◽  
Lipeng Gao
Keyword(s):  
Tabu Search ◽  
Artificial Bee Colony Algorithm ◽  
Artificial Bee Colony ◽  
Optimal Solution ◽  
Local Optimum ◽  
Tabu List ◽  
Cooperative Jamming ◽  
Bee Colony ◽  
Local Optimal Solution ◽  
The One

For the future information confrontation, a single jamming mode is not effective due to the complex electromagnetic environment. Selecting the appropriate jamming decision to coordinately allocate the jamming resources is the development direction of the electronic countermeasures. Most of the existing studies about jamming decision only pay attention to the jamming benefits, while ignoring the jamming cost. In addition, the conventional artificial bee colony algorithm takes too many iterations, and the improved ant colony (IAC) algorithm is easy to fall into the local optimal solution. Against the issue, this paper introduces the concept of jamming cost in the cognitive collaborative jamming decision model and refines it as a multiobjective one. Furthermore, this paper proposes a tabu search-artificial bee colony (TSABC) algorithm to cognitive cooperative-jamming decision. It introduces the tabu list into the artificial bee colony (ABC) algorithm and stores the solution that has not been updated after a certain number of searches into the tabu list to avoid meeting them when generating a new solution, so that this algorithm reduces the unnecessary iterative process, and it is not easy to fall into a local optimum. Simulation results show that the search ability and probability of finding the optimal solution of the new algorithm are better than the other two. It has better robustness, which is better in the “one-to-many” jamming mode.

scholarly journals A review on Artificial Bee Colony algorithm

2013 ◽  
Vol 2 (3) ◽  
pp. 175 ◽  
Author(s):  
Balwant Kumar Verma ◽  
Dharmender Kumar
Keyword(s):  
Honey Bees ◽  
Artificial Bee Colony Algorithm ◽  
Artificial Bee Colony ◽  
Travelling Salesman Problem ◽  
Control Parameters ◽  
Travelling Salesman ◽  
Abc Algorithm ◽  
Bee Colony ◽  
Large Numbers ◽  
Short Span

In recent years large number of algorithms based on the swarm intelligence has been proposed by various researchers. The Artificial Bee Colony (ABC) algorithm is one of most popular stochastic, swarm based algorithm proposed by Karaboga in 2005 inspired from the foraging behavior of honey bees. In short span of time, ABC algorithm has gain wide popularity among researchers due to its simplicity, easy to implementation and fewer control parameters. Large numbers of problems have been solved using ABC algorithm such as travelling salesman problem, clustering, routing, scheduling etc. the aim of this paper is to provide up to date enlightenment in the field of ABC algorithm and its applications.

Path Planning of Mobile Robot Using Improved Artificial Bee Colony Algorithm

2020 ◽  
Vol 38 (9A) ◽  
pp. 1384-1395
Author(s):  
Rakaa T. Kamil ◽  
Mohamed J. Mohamed ◽  
Bashra K. Oleiwi
Keyword(s):  
Mobile Robot ◽  
Comparative Research ◽  
Artificial Bee Colony Algorithm ◽  
Artificial Bee Colony ◽  
Dynamic Control ◽  
Computational Time ◽  
Bee Colony ◽  
Shortest Distance ◽  
Minimum Number ◽  
Cubic Polynomial

A modified version of the artificial Bee Colony Algorithm (ABC) was suggested namely Adaptive Dimension Limit- Artificial Bee Colony Algorithm (ADL-ABC). To determine the optimum global path for mobile robot that satisfies the chosen criteria for shortest distance and collision–free with circular shaped static obstacles on robot environment. The cubic polynomial connects the start point to the end point through three via points used, so the generated paths are smooth and achievable by the robot. Two case studies (or scenarios) are presented in this task and comparative research (or study) is adopted between two algorithm’s results in order to evaluate the performance of the suggested algorithm. The results of the simulation showed that modified parameter (dynamic control limit) is avoiding static number of limit which excludes unnecessary Iteration, so it can find solution with minimum number of iterations and less computational time. From tables of result if there is an equal distance along the path such as in case A (14.490, 14.459) unit, there will be a reduction in time approximately to halve at percentage 5%.

Sign in / Sign up

Export Citation Format

Share Document