Fractal-based Algorithm: A New Metaheuristic Method for Continuous Optimization
In this paper a population-based metaheuristic algorithm named fractal-based algorithm is developed to solve continuous optimization problems. In this algorithm, the density of high quality and promising points in an area is considered as a heuristic which estimates the degree of promise of that area for finding the optimal solution. Afterward, the promising areas of state space are iteratively detected and partitioned into self-similar and fractal-shaped subspaces for being searched more precisely and more extensively. The proposed algorithm is compared with some metaheuristic algorithms. The results demonstrate that the algorithm is able to find high quality solutions within appropriate time.
Regarding indexing issue:
We have provided the online access of all issues & papers to the all indexing agencies (as given on our journal home web site). It’s depend on indexing agencies when, how and what manner they can index or not. So, please neither sends any question nor expects any answer from us on the behalf of third party i.e. indexing agencies. Our role is just to provide the online access to them. So we do properly this and one can visit indexing agencies website to get the authentic information.