3 articles tagged with #metaheuristics. AI-curated summaries with sentiment analysis and key takeaways from 50+ sources.
Researchers introduce REMS, a unified framework for solving combinatorial optimization problems that views problems as resource allocation tasks. The framework enables reusable metaheuristic algorithms and outperforms established solvers like GUROBI and SCIP on large-scale instances across 10 different problem types.
Researchers introduce DyNACO, a neural-guided optimization framework that dynamically adjusts guidance during iterative search processes rather than relying on static priors. The system scales to 100,000-node problem instances and demonstrates performance improvements over existing neural baselines while maintaining computational efficiency.
Researchers have developed an enhanced Large Neighborhood Search (LNS) algorithm to solve a variant of the capacitated facility location problem that incorporates customer incompatibilities, where certain customer pairs cannot share the same facility. The new method employs hybrid destroy operators and exact solvers, achieving superior performance over existing metaheuristics on all benchmark instances.
