Simplex Coding Genetic Algorithm (SCGA) Method

The SCGA is proposed by hybridizing genetic algorithm and Nelder-Mead method. In the SCGA, each chromosome in the population is a simplex and the gene is a vertex of this simplex. Selection, new multi-parents crossover and mutation procedures are used to improve the initial population. Moreover, Nelder-Mead method is applied to improve the population in the initial stage and every intermediate stage when new children are generated. Applying Nelder-Mead method again on the best point visited is the final stage in the SCGA to accelerate the search and to improve this best point.                                

Source Reference: A. Hedar and M. Fukushima, Minimizing multimodal functions by simplex coding genetic algorithm, Optimization Methods and Software, 18 (2003) 265-282. [pdf]

Source Codes: MATLAB codes for SCGA are downloadable here SCGA_ver_0.1.