A new hybrid evolutionary algorithm with quasi-simplex technique

摘要

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.