Topology optimization for nonlinear structural problems based on artificial bee colony algorithm

2015 ◽  
Vol 16 (1) ◽  
pp. 91-97 ◽  
Author(s):  
Jae-Yong Park ◽  
Seog-Young Han
Keyword(s):  
Topology Optimization ◽  
Artificial Bee Colony Algorithm ◽  
Artificial Bee Colony ◽  
Structural Problems ◽  
Bee Colony ◽  
Nonlinear Structural

Self-Adaptive and Adaptive Parameter Control in Improved Artificial Bee Colony Algorithm

Informatica ◽  
2017 ◽  
Vol 28 (3) ◽  
pp. 415-438 ◽  
Author(s):  
Bekir Afşar ◽  
Doğan Aydin ◽  
Aybars Uğur ◽  
Serdar Korukoğlu
Keyword(s):  
Artificial Bee Colony Algorithm ◽  
Artificial Bee Colony ◽  
Parameter Control ◽  
Adaptive Parameter ◽  
Bee Colony ◽  
Adaptive Parameter Control ◽  
Self Adaptive

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