Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
To explore or to exploit: An entropy-driven approach for evolutionary algorithms
International Journal of Knowledge-based and Intelligent Engineering Systems
IAMGA: intimate-based assortative mating genetic algorithm
SEMCCO'11 Proceedings of the Second international conference on Swarm, Evolutionary, and Memetic Computing - Volume Part I
Exploration and exploitation in evolutionary algorithms: A survey
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
Genetic Algorithms (GA) have been widely used inoperations research andoptimization since first proposed. A typical GAcomprises three stages, the encoding, theselection and the recombination stages. In thiswork, we focus our attention on the selectionstage of GA, and review afew commonly employed selection schemes andtheir associated scalingfunctions. We also examine common problems andsolution methods forsuch selection schemes.We then propose a new selection scheme inspiredby sexual selectionprinciples through female choice selection, andcompare the performance of this new schemewith commonly used selection methods in solvingsome well-known problems including the Royal RoadProblem, the Open Shop Scheduling Problem andthe Job Shop Scheduling Problem.