3 ms·
Yeah, that's cool, but I'm curious if an algorithm exists for that problem that is actually globally optimal. My understanding is that genetic algorithms can ge
by 7thaccount 2y ago
Yeah, that's cool, but I'm curious if an algorithm exists for that problem that is actually globally optimal. My understanding is that genetic algorithms can get stuck in local minimums. I guess it doesn't really matter though if you can just do a simple check at the end to see if all the rules have been met.
- hermitcrab 2y agoPretty much any optimization algorithm (apart from brute force) can get stuck at a local optima. Often with seating plans it isn't possible to satisfy all criteria. Generally you can only sit next to 2 other people. Combinatorial optimization problems are hard.