Search - elitism

Search - elitism - List

[Other] genetic DL : 0: This program runs a GA. The roulette wheel method for parent selection is used here. Elitism is included. Parent selection is from the population including the elite chromosomes. The standard bit form is used here. As usual, code works in terms of fitness values (higher better) results, however, are reported for the loss values of actual interest. This code does not work with constraints on theta values other than those directly associated with thetamax and thetamin. -This program runs a GA. The roulette wheel method for parent selection is used here. Elitism is included. Parent selection is from the population including the elite chromosomes. The standard bit form is used here. As usual, code works in terms of fitness values (higher better) results, however, are reported for the loss values of actual interest. This code does not work with constraints on theta values other than those directly associated with thetamax and thetamin.
Date : 2025-07-08 Size : 11kb User : siva
[matlab] GAreal_tourney DL : 0: ntroduction to Stochastic Search and Optimization, 2003 This program runs a GA with real-number coding. Elitism is used and the mutation operator is simply the addition of a Gaussian random vector to the non-elite elements. The user is expected to set a variable expect_fn representing the expected number of function evaluations allowed.-ntroduction to Stochastic Search and Optimization, 2003 This program runs a GA with real-number coding. Elitism is used and the mutation operator is simply the addition of a Gaussian random vector to the non-elite elements. The user is expected to set a variable expect_fn representing the expected number of function evaluations allowed.
Date : 2025-07-08 Size : 3kb User : shahnaz
[matlab] Beale_Function DL : 0: source code using elitism for the Beale function
Date : 2025-07-08 Size : 1kb User : raj
[Other] 遗传算法——旅行商问题mfc DL : 0: 旅行商问题：一个旅行者要去很多城市，每个城市只去一次，问：该怎么走路线最短？ ? ?????? 这个问题可以转化为：随机给n个点，如何连线这n个点，使得连线最短？ ? ?????? 这个问题是遗传算法的经典问题~哈哈~~我试着写了一个程序来解决。 ? ?????? 采用的策略是： 1.?????? 精英主义：每次有2个最优解直接进入下一代。 2.?????? 轮盘赌选择生育：每次对每一代的个体进行一次轮询，如果不适应度<某个随机数，那么选择这个个体进行生育。 3.?????? 单性繁殖：因为基因组的基因是互斥的且有序的，所以不适合两性繁殖。 4.?????? 交换变异：变异的方式为——随机选择两个不同位置的基因，交换位置。(Traveling salesman problem: a traveler is going to many cities, each city only once, ask: how to go, the shortest route? This problem can be transformed into random to n points, how to connect the n points, the shortest line? This problem is a classic problem of genetic algorithm ~ ha ha ~ ~ I try to write a program to solve. Strategy is used: 1. elitism: every time there are 2 optimal solution directly into the next generation. 2. Roulette: every time a family of polling each generation of individuals, if not to "a random number, then the individual choice of fertility. 3. parthenogenesis: because genes are mutually exclusive and orderly, so it is not suitable for sexual reproduction. 4. exchange variation way -- random selection of two different positions of the gene exchange position.)
Date : 2025-07-08 Size : 88kb User : littlekai