In this paper, two well-known evolutionary algorithms, namely, Differential Evolution (DE) and Covariance Matrix Adaptation Evolution Strategy (CMA-ES), are compared on solving N-queen problem (a classical combinatorial optimization problem). Convergence velocity and robustness are our main measures in the current comparative study. Experiments are conducted on twelve chessboard dimensions. Results confirm that CMA-ES performs better than DE with respect to success rate and also success performance. Details about the N-queen problem, comparison strategies, metrics, and results are provided.
展开▼
