Context based clearing procedure: A niching method for genetic algorithms

In this paper we present cbc (context based clearing), a procedure for solving the niching problem. cbc is a clearing technique governed by the amount of heterogeneity in a subpopulation as measured by the standard deviation. cbc was tested using the m7 function, a massively multimodal deceptive optimization function typically used for testing the efficiency of finding global optima in a search space. the results are compared with a standard clearing procedure. results show that cbc reaches global optima several generations earlier than in the standard clearing procedure. in this work the target was to test the effectiveness of context information in controlling clearing. a subpopulation includes a fixed number of candidates rather than a fixed radius. each subpopulation is then cleared either totally or partially according to the heterogeneity of its candidates. this automatically regulates the radius size of the area cleared around the pivot of the subpopulation.