|Title:||On the investigation of population sizing of genetic algorithms using optimal mixing||Authors:||Liao, Yi Yun
Hsu, Hung Wei
Juang, Yi Lin
|Keywords:||Estimation of Distribution Algorithms | Genetic Algorithms | Population Sizing||Issue Date:||13-Jul-2019||Source:||GECCO 2019 - Proceedings of the 2019 Genetic and Evolutionary Computation Conference||Abstract:||
© 2019 Association for Computing Machinery. Genetic algorithms using optimal mixing have shown promising results, while lack of theoretical supports. This paper investigates population sizing from the supply aspect under the optimal mixing scenario. Specifically, more precise analyses on supply, including the expectation and the lower bound, are made. In addition, considering recombining one randomly generated chromosome with the rest of the population to achieve the global optimum, the tight bounds of the size of the population providing proper fragments chosen by restricted oracles are derived. Tight bounds on problems with ring topologies where a subfunction overlaps two other subfunctions are also derived. Finally, experiments are conducted and well match the derivations.
|Appears in Collections:||電機工程學系|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.