Answers are grounded in this paper and cite their sources.
As a global optimization method, genetic algorithm (GA) is very convenient for use in optimizing any type of parameters, especially for inverse problems, and many remarkable results have been obtained. One of the problems of GA is how to achieve the evolution towards the global minimum efficiently. This paper examines the conventional operators of GA, and introduces new techniques of mutating and seeding the population.
No takes yet. Share an insight, caveat, or question.
Meng et al. (2002) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: