A Novel Memetic Algorithm for Unconstrained Optimization
This paper describes a novel Memetic Algorithm for unconstrained optimization. The proposed approach aims to add a probabilistic procedure to determine if employing pattern search during a specific Particle Swarm Optimization generation. To verify the effectiveness of the proposed approach, several continuous functions are selected to test the proposed approach in comparison to conventional pattern search and the conventional PSO. Moreover, two kinds of integration schema for pattern search and PSO are also compared with the proposed approach. Experimental results demonstrate that the proposed approach is extremely effective and efficient at locating global optimal solutions for unconstrained optimization.
Function Optimization Particle Swarm Optimization Pattern Search hybrid optimization
Yukun Bao Zhongyi Hu Tao Xiong Yunfei Yang
School of Management,Huazhong University of Science and Technology, Wuhan, 430074, China
国际会议
上海
英文
342-343
2010-12-10(万方平台首次上网日期,不代表论文的发表时间)