Real-valued genetic algorithms with disagreements
This paper presents a composite mutation operator for real-valued genetic algorithms that refines the evolutionary process using the so-called disagreements. The idea is theoretically described and exemplified by defining a Gaussian scheme-based disagreements operator, called 6 \({\upsigma }\) -GAD. Several tests empirically prove some advantages of this simple approach that enhances diversity and search focus.
real-valued genetic algorithms disagreements mutation