Multiprocessor task scheduling in multistage hybrid flowshops: A hybrid artificial bee colony algorithm with bi-directional planning

2013 ◽  
Vol 40 (5) ◽  
pp. 1186-1195 ◽  
Author(s):  
Shih-Wei Lin ◽  
Kuo-Ching Ying ◽  
Chien-Yi Huang
Keyword(s):  
Task Scheduling ◽  
Artificial Bee Colony Algorithm ◽  
Artificial Bee Colony ◽  
Bee Colony ◽  
Multiprocessor Task Scheduling ◽  
Hybrid Flowshops

scholarly journals Artificial Bee Colony Algorithm for Cloud Task Scheduling

2015 ◽  
Vol 4 (1) ◽  
pp. 1-10
Author(s):  
Medhat Tawfik ◽  
Ashraf Bahgat ◽  
Arabi Keshk ◽  
F. Torkey
Keyword(s):  
Task Scheduling ◽  
Artificial Bee Colony Algorithm ◽  
Artificial Bee Colony ◽  
Bee Colony

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%.

Artificial bee colony algorithm with modified search strategy

2013 ◽  
Vol 32 (12) ◽  
pp. 3326-3330
Author(s):  
Yin-xue ZHANG ◽  
Xue-min TIAN ◽  
Yu-ping CAO
Keyword(s):  
Artificial Bee Colony Algorithm ◽  
Artificial Bee Colony ◽  
Search Strategy ◽  
Bee Colony
Sign in / Sign up

Export Citation Format

Share Document