Timeline for How to use genetic algorithm to calculate the maximum value of this matrix
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 1, 2020 at 18:41 | comment | added | Roman |
You can save some time by defining f[samp_List] := Det[Partition[samp, n] // N]: for some reason the floating-point algorithm is faster than the integer algorithm.
|
|
| Feb 1, 2020 at 13:06 | comment | added | Roman | Very nice! Glad to see my code is finding usage. | |
| Jan 31, 2020 at 16:49 | comment | added | kglr |
@Akku14, I think changing 10^4 in the 4th argument to a larger number we can get closer to the OEIS number.
|
|
| Jan 31, 2020 at 16:43 | comment | added | Akku14 |
This yields 6.838.13* for n==5. But http://oeis.org/search?q=10%2C412%2C40800%2C&sort=&language=english&go=Search gives 6.839.492 as maximum for n==5. What is true?
|
|
| Jan 31, 2020 at 16:31 | comment | added | Daniel Lichtblau | MOP is a wonderful function. Note that at its core it is simulated annealing and not a genetic method. (Presumably the original poster really wants for any working method, not necessarily one from the evolutionary algorithms family.) | |
| Jan 31, 2020 at 9:39 | history | edited | kglr | CC BY-SA 4.0 |
added 261 characters in body
|
| Jan 31, 2020 at 9:13 | history | edited | kglr | CC BY-SA 4.0 |
added 1190 characters in body
|
| Jan 31, 2020 at 9:05 | history | answered | kglr | CC BY-SA 4.0 |