The QUasi-Affine TRansformation Evolution (QUATRE) Algorithm: An Overview

11Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

QUasi-Affine TRansformation Evolution (QUATRE) algorithm is a new simple but powerful stochastic optimization algorithm proposed recently. The QUATRE algorithm aims to tackle the representational/positional bias inborn with DE algorithm and secures an overall better performance on commonly used Conference of Evolutionary Computation (CEC) benchmark functions. Recently, several QUATRE variants have been already proposed since its inception in 2016 and performed very well on many benchmark functions. In this paper, we mainly have a brief overview of all these proposed QUATRE variants first and then make simple contrasts between these QUATRE variants and several state-of-the-art DE variants under CEC2013 test suites for real-parameter single objective optimization benchmark functions. Experiment results show that the movement trajectory of individuals in the QUATRE structure is much more efficient than DE structure on most of the tested benchmark functions.

Cite

CITATION STYLE

APA

Meng, Z., Pan, J. S., & Li, X. (2018). The QUasi-Affine TRansformation Evolution (QUATRE) Algorithm: An Overview. In Advances in Intelligent Systems and Computing (Vol. 682, pp. 324–333). Springer Verlag. https://doi.org/10.1007/978-3-319-68527-4_35

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free