Study on Generalized Fractal Algorithm of Global Optimization

Institute of Electronics Engineers, Inc.
Publication Type:
Conference Proceeding
Proceedings: The 2nd IEEE International Conference on Advanced Computer - Vol. 5, 2010, pp. 286 - 290
Issue Date:
Full metadata record
Files in This Item:
Filename Description Size
Thumbnail2009008199OK.pdf284.63 kB
Adobe PDF
To promote a fractal algorithm from being suitable for global optimization only on three dimensional spaces, this paper presents a simple and convenient method for dividing an n-dimensional hypercube. A key problem is then solved to develop the fractal algorithm in a high dimensional space so that the fractal algorithm becomes a generalized global optimization algorithm. The theoritical foundation of the algorithm is set up. Simulations show the generalized fractal algorithm is effective.
Please use this identifier to cite or link to this item: