genetic-algorithm

NSGA-II ( Non- Dominating Sorting Algorithm )

怎甘沉沦 提交于 2019-12-03 17:08:22
I have studied about Non dominating sorting algorithtm (nsga-II). Algorithm is given on this link . http://church.cs.virginia.edu/genprog/images/2/2f/Nsga_ii.pdf I want to know it's real life application with examples.....I tried to search on the internet ,but no where found it. If you have any ideas or relevent data/link ,please share with me. You can find some real-life applications by just searching : "NSGA-II + applications" in Google Scholar : http://scholar.google.com/scholar?start=10&q=nsga-ii+application&hl=en&as_sdt=0,5 The ones who proposed NSGA-II are, indeed, Prof. Kalyanmoy Deb

Image processing using genetic algorithm

本秂侑毒 提交于 2019-12-03 15:04:16
i want to see application of GA in image processing. I was not getting how to write the fitness function for any image. Say I have a image in grey scale,which is not very clear, now if I keep matching my generated solution with this picture value then how is my solution going to be better like better clearity increased contrast/brightness etc. My favorite example of Genetic Algorithms in image processing is: http://rogeralsing.com/2008/12/07/genetic-programming-evolution-of-mona-lisa/ It evolves random shapes into something that resembles the Mona Lisa. You can actually try it and play with it

Genetic Algorithm - what is steady state selection?

霸气de小男生 提交于 2019-12-03 12:02:38
问题 I'm doing a final year project on genetic algorithms - specifically of the Dawkins Weasel type. I've done roulette selection and tournament selection, still to do steady state selection, but I'm not sure exactly what it is and references I find online are all pretty vague. Does anyone know how it should be implemented? Any pointers would be great. Many thanks. 回答1: Typically, the run of a genetic algorithm is divided into generations - each generation your selection and reproduction process

How to prevent genetic algorithm from converging on local minima?

▼魔方 西西 提交于 2019-12-03 08:53:38
I am trying to build a 4 x 4 sudoku solver by using the genetic algorithm. I have some issues with values converging to local minima. I am using a ranked approach and removing the bottom two ranked answer possibilities and replacing them with a crossover between the two highest ranked answer possibilities. For additional help avoiding local mininma, I am also using mutation. If an answer is not determined within a specific amount of generation, my population is filled with completely new and random state values. However, my algorithm seems to get stuck in local minima. As a fitness function, I

How to find the best parameters for a Genetic Algorithm?

南笙酒味 提交于 2019-12-03 08:35:44
Some Genetic Algorithm frameworks, such as http://www.aforgenet.com/ requires many parameters, such as mutation rate, population size, etc There is universal best numbers for such parameters? I believe that it depends on the problem (fitness function delay, mutation delay, recombination delay, evolution rate, etc). My first thought was to use a GA to configure another GA. Any better ideas? The one time I programmed a genetic algorithm I included those values in the values to mutate, basically like you said using a GA to configure itself. It worked surprisingly well, especially since I've found

Roulette-wheel selection in Genetic algorithm. Population needs to be sorted first?

妖精的绣舞 提交于 2019-12-03 07:02:04
In a genetic algorithm, when selecting members for crossover using roulette-wheel selection method, does the population first need to be sorted by fitness rank? The possibilities seem to be: sort population first by ascending fitness sort population by descending fitness don't sort population & let the roulette ball fall where it may.. I'm thinking that sorting either way may have no effect - a pebble landing at random on a wheel containing different sized (by fitness) slices will have exactly the same outcome chance whether the larger slices are grouped together or not. But I'm not 100%

Efficiency of crossover in genetic algorithms

隐身守侯 提交于 2019-12-03 06:42:22
问题 I've implemented a number of genetic algorithms to solve a variety of a problems. However I'm still skeptical of the usefulness of crossover/recombination. I usually first implement mutation before implementing crossover. And after I implement crossover, I don't typically see a significant speed-up in the rate at which a good candidate solution is generated compared to simply using mutation and introducing a few random individuals in each generation to ensure genetic . Of course, this may be

How to optimize parameters using genetic algorithms

我与影子孤独终老i 提交于 2019-12-03 06:22:47
问题 I'd like to optimize three parameters(gamma, cost and epsilon) in eps-regression(SVR) using GA in R. Here's what I've done. library(e1071) data(Ozone, package="mlbench") a<-na.omit(Ozone) index<-sample(1:nrow(a), trunc(nrow(a)/3)) trainset<-a[index,] testset<-a[-index,] model<-svm(V4 ~ .,data=trainset, cost=0.1, gamma=0.1, epsilon=0.1, type="eps-regression", kernel="radial") error<-model$residuals rmse <- function(error) #root mean sqaured error { sqrt(mean(error^2)) } rmse(error) Here, I set

A Genetic Algorithm for Tic-Tac-Toe

删除回忆录丶 提交于 2019-12-03 03:54:34
问题 So I was assigned the problem of writing a 5x5x5 tic-tac-toe player using a genetic algorithm. My approach was to start off with 3x3, get that working, and then extend to 5x5, and then to 5x5x5. The way it works is this: Simulate a whole bunch of games, and during each turn of each game, lookup in a corresponding table (X table or O table implemented as a c++ stdlib maps) for a response. If the board was not there, add the board to the table. Otherwise, make a random response. After I have

Neural Network size for Animation system

非 Y 不嫁゛ 提交于 2019-12-03 03:14:31
I decided to go with a Neural Network in order to create behaviors for an animation engine that I have. The neural network takes in 3 vector3s and 1 Euler angle for every body part that I have. The first vector3 is the position, the second is its velocity, and the third is its angular velocity. The Euler angle is what rotation the body part is at. and I have 7 body parts. Each one of those data types has 3 floats. 7*4*3 = 84, so I have 84 inputs for my neural network. The outputs are mapped to the muscles of the character. They provide the amount of strength to apply to each muscle, and there