Asian Journal of Information Technology
ISSN: Online 1993-5994ISSN: Print 1682-3915
Abstract
In this study present an efficient algorithm of global search to optimizing in n dimension space. This method is suitable for functions that have many extremes. Present algorithm can determine a narrow space around the global optimum in very restricted time based on a stochastic tests and an adaptive partition of the search space. The present algorithm reduces the order of the optimization problem in hand to order two before it tries to solve it, then the problem will be transformed again into its original order. Thus, the new algorithm has the ability to avoid the local optima and reduces the number of evaluations and improves the speed of the algorithm converge. The proposed algorithm tested to locate the global optimum of different test problems and finally used to identify a physical stress/ strain problem. It was found that the algorithm was effective to locate the global optimum even though the objective function has a large number of optima
How to cite this article:
Djalil Boudjehem and Nora Mansouri . An Efficient Algorithm for the Global Optimization Using Order Transformation.
DOI: https://doi.org/10.36478/ajit.2005.1141.1145
URL: https://www.makhillpublications.co/view-article/1682-3915/ajit.2005.1141.1145