Timeline for How can I speed up the classic GA for graph coloring?
Current License: CC BY-SA 3.0
19 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 8, 2018 at 16:18 | comment | added | Szabolcs | Does this code actually reach 30? If yes, how long does it take? In a couple of minutes it only reaches 32. | |
| S Nov 1, 2012 at 18:00 | history | bounty ended | CommunityBot | ||
| S Nov 1, 2012 at 18:00 | history | notice removed | CommunityBot | ||
| Oct 24, 2012 at 18:21 | history | edited | M.R. | CC BY-SA 3.0 |
deleted 227 characters in body
|
| Oct 24, 2012 at 18:18 | answer | added | Daniel Lichtblau | timeline score: 3 | |
| Oct 24, 2012 at 18:12 | history | edited | M.R. | CC BY-SA 3.0 |
deleted 227 characters in body
|
| Oct 24, 2012 at 18:09 | comment | added | M.R. | @OleksandrR. is correct about requiring domain-specific knowledge to make the recombination framework produce children that actually retain the important genes. In this application, the important genetic information is the partition of the graph into independent sets given by the proper coloring, i.e. the "color classes". So the trick is to splice the two color vectors in a way that preserves the properness of the coloring but also modulates the color classes... And if annealing is used, colors cannot be reduced too quickly, the temperature must be dropped slowly for optimal configurations. | |
| Oct 24, 2012 at 18:01 | comment | added | Mr.Wizard | Thanks for the update. Reading now. | |
| Oct 24, 2012 at 18:00 | history | edited | M.R. | CC BY-SA 3.0 |
added 1636 characters in body; edited tags
|
| Oct 24, 2012 at 17:48 | history | edited | M.R. | CC BY-SA 3.0 |
added 3064 characters in body
|
| Oct 24, 2012 at 17:27 | comment | added | Mr.Wizard |
Would it be too much trouble for you to give some code and an example of use that does not use Graph? Since I don't have that functionality I'm not sure what your data should look like.
|
|
| Oct 24, 2012 at 17:20 | answer | added | Mr.Wizard | timeline score: 7 | |
| S Oct 24, 2012 at 16:33 | history | bounty started | M.R. | ||
| S Oct 24, 2012 at 16:33 | history | notice added | M.R. | Authoritative reference needed | |
| Oct 23, 2012 at 4:11 | comment | added | M.R. | @DanielLichtblau I'm after a fast upperbound approx algorithm to push stuff, and I'm keen on getting a GA/GP to work. I've tried others, but if a stochastic, deterministic, and annealing method works better who am I to say, just test against the benchmark... | |
| Oct 23, 2012 at 2:07 | comment | added | Oleksandr R. | I don't know that much about GAs but my impression of them is that it's trivial to write something that works after a fashion, but to do the job well requires either a lot of domain-specific knowledge and experience or very many experiments. So, this question might end up being more about GAs than about Mathematica per se. (I don't consider that a bad thing as I like domain-specific questions and find evolutionary computation techniques interesting. Others may or may not agree.) Here's a small hint: Darwinian evolution is very inefficient! | |
| Oct 22, 2012 at 23:34 | comment | added | Daniel Lichtblau | Is it necessary to use a GA? | |
| Oct 22, 2012 at 18:08 | history | tweeted | twitter.com/#!/StackMma/status/260442533916725248 | ||
| Oct 22, 2012 at 15:57 | history | asked | M.R. | CC BY-SA 3.0 |