Abstract

To promote a fractal algorithm from being suitable for global optimization only on three dimensional spaces to an n dimensional space, 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 theoretical foundation of the algorithm is set up. Simulations show the generalized fractal algorithm is effective.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call