Abstract
A novel global optimization method is proposed to find global minimal points more effectively and quickly. The new algorithm is based on both genetic algorithms (GA) and pattern search (PS) algorithms, thus, we have named it genetic pattern search. The procedure involves two-phases: First, GA executes a coarse search, PS then executes a fine search. Experiments on four different test functions (consisting of Hump, Powell, Rosenbrock, and Woods) demonstrate that this proposed new algorithm is superior to improved GA and improved PS with respect to success rate and computation time. Therefore, genetic pattern search is an effective and viable global optimization method.