International Journal of Computer Applications |
Foundation of Computer Science (FCS), NY, USA |
Volume 177 - Number 8 |
Year of Publication: 2019 |
Authors: Rahul Kumar Mishra |
10.5120/ijca2019919456 |
Rahul Kumar Mishra . Phased Bee Colony Optimization Algorithm for Solving Mathematical Function. International Journal of Computer Applications. 177, 8 ( Oct 2019), 21-27. DOI=10.5120/ijca2019919456
In this article, we have proposed an efficient Bee Colony Optimization method, namely Phased Bee Colony Optimization (PBCO) technique for solving mathematical functions in a multidimensional space. The search process of the optimization approach is directed towards a region or a hypercube in a multidimensional space to find a global optimum or near global optimum after a predefined number of iterations. The process in the entire search area to another region (new search area) surrounding the optimum value found so far after a few iterations and restarts the search process in the new region. However, the search area of the new region is reduced compared to previous search area. Thus, the search process finding advances and jumps to a new search space (with reduced area space) in several phases until the algorithm is terminated. The PBCO technique has tested on a set of mathematical benchmark functions with number of dimensions up to 100 and compared with several relevant optimizing approaches to evaluate the performance of the algorithm. It has observed that the proposed technique performs either better or similar to the performance of other optimization methods.