A new hybrid evolutionary algorithm with quasi-simplex technique
- Publication Type:
- Conference Proceeding
- 2010 International Conference on Machine Learning and Cybernetics, ICMLC 2010, 2010, 4 pp. 1811 - 1816
- Issue Date:
Copyright Clearance Process
- Recently Added
- In Progress
- Closed Access
This item is closed access and not available.
This paper proposes a new parallel search algorithm using an evolutionary algorithm and quasi-simplex techniques (EAQST) for non-linear constrained function optimization. EAQST produces the offspring in parallel by using the Gaussian mutation, the Cauchy mutation and the quasi-simplex technique. Experimental studies on typical benchmark functions have shown that EAQST has very better performance than the compared algorithm. © 2010 IEEE.
Please use this identifier to cite or link to this item: