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.

Full Text
Paper version not known

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

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.