Open Access Open Access  Restricted Access Subscription or Fee Access

Fractal-based Algorithm: A New Metaheuristic Method for Continuous Optimization

Marjan Kaedi

Abstract



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.

Keywords


Continuous optimization, Heuristic, Promising subspace, Fractal-shaped structure.

Full Text:

PDF


Disclaimer/Regarding indexing issue:

We have provided the online access of all issues and papers to the indexing agencies (as given on journal web site). It’s depend on indexing agencies when, how and what manner they can index or not. Hence, we like to inform that on the basis of earlier indexing, we can’t predict the today or future indexing policy of third party (i.e. indexing agencies) as they have right to discontinue any journal at any time without prior information to the journal. So, please neither sends any question nor expects any answer from us on the behalf of third party i.e. indexing agencies.Hence, we will not issue any certificate or letter for indexing issue. 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. Also: DOI is paid service which provided by a third party. We never mentioned that we go for this for our any journal. However, journal have no objection if author go directly for this paid DOI service.