Insights Blog
-- Browse All Articles --
Physics Articles
Physics Tutorials
Physics Guides
Physics FAQ
Math Articles
Math Tutorials
Math Guides
Math FAQ
Education Articles
Education Guides
Bio/Chem Articles
Technology Guides
Computer Science Tutorials
Forums
Chemistry
Biology and Medical
Earth Sciences
Computer Science
Computing and Technology
DIY Projects
Trending
Featured Threads
Log in
Register
What's new
Search
Search
Search titles only
By:
Chemistry
Biology and Medical
Earth Sciences
Computer Science
Computing and Technology
DIY Projects
Menu
Log in
Register
Navigation
More options
Contact us
Close Menu
JavaScript is disabled. For a better experience, please enable JavaScript in your browser before proceeding.
You are using an out of date browser. It may not display this or other websites correctly.
You should upgrade or use an
alternative browser
.
Forums
Other Sciences
Programming and Computer Science
How to frame a genetic algorithm for this problem?
Reply to thread
Message
[QUOTE="jedishrfu, post: 6076528, member: 376845"] Mutation means that you select a random array from a collection of random arrays (think each random array a string of letters) and then you alter one or more of its elements like you increase the count or zero one count and bump another like selectively changing the letters of the string from xxxxxxxxxx to xxYxxxZxxxxAxx the capital letters represent the mutations For crossover, you select two random arrays from your collection of random array solutions and mate them together by swapping selected elements between them. You can use a random number generator to select indices of elements to swap. array 1: aaabbbcccddd array 2: AAABBBCCCDDD new array aAAbbbCCcDdD The mutated and crossover arrays along with the original solutions become a part of your solution pool to try out for the next cycle. Their scores determine whether they remain or are tossed out. [/QUOTE]
Insert quotes…
Post reply
Forums
Other Sciences
Programming and Computer Science
How to frame a genetic algorithm for this problem?
Back
Top