scholarly journals SOFTWARE PROJECT SCHEDULING USING ANT COLONY AND ARTIFICIAL BEE COLONY ALGORITHM

2018 ◽  
Vol 4 (2) ◽  
pp. 115-123
Author(s):  
Nurhan GÜL ◽  
Nursal ARICI

Scheduling is the first and foremost step for every project implementation. Project scheduling could be a mechanism to communicate what tasks has to be compelled to get done and which resources are going to be allotted to finish those tasks in what timeframe. Project scheduling occurs during the planning phase of the project. The problem comprises the correct assignment of employees to the various tasks that frame a software project, casing in time and cost limitations. To accomplish this objective, this paper presents and discusses the EBS with ACO, FCM clustering and EBS with ABC and the conclusions are drawn from it. First, to schedule human resources to tasks we implement Event based scheduler with the Ant colony optimization algorithm (ACO) for probabilistic optimization, second, for fast scheduling we implemented Fuzzy c means clustering to assign similar data points of employees to clusters so that the searching space will be reduced. Third, for optimum scheduling we apply Artificial Bee Colony algorithm with Event Based Scheduler. Artificial bee colony (ABC) is an optimization algorithm based on stochastic calculation which has demonstrated good search capacities on numerous advancement issues. Based on these findings we briefly describe the scheduling with FCM-EBS with ABC prompt optimum values


2020 ◽  
Vol 38 (9A) ◽  
pp. 1384-1395
Author(s):  
Rakaa T. Kamil ◽  
Mohamed J. Mohamed ◽  
Bashra K. Oleiwi

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