5 articles tagged with #heuristics. AI-curated summaries with sentiment analysis and key takeaways from 50+ sources.
Researchers used large language models and evolutionary search to create the first domain-independent heuristics for symbolic AI planning that surpass hand-engineered baselines. These evolved heuristics, written in C++, solve more planning tasks than existing state-of-the-art approaches and maintain the soundness guarantees of traditional planners.
Researchers have developed a machine learning approach to automatically generate splitting heuristics for parallel string constraint solvers, replacing manual design methods. The technique was implemented in Z3seq and Z3str4, demonstrating improved performance in solving complex string constraints across multiple processor cores.
Researchers introduce Front-to-Attractors (F2A), a new heuristic class that optimizes bidirectional search algorithms by replacing computationally expensive pairwise frontier evaluations with estimates to a small set of dynamically maintained attractor states. The approach achieves 11.2x reduction in pairwise evaluations while maintaining performance gains over simpler heuristics.
Researchers have developed a machine-learning framework that learns to create admissible heuristics for optimal planning by leveraging cost partitioning and Lagrangian duality. The approach uses graph neural networks with Weisfeiler-Leman algorithms to generate cost weights that guarantee admissibility by construction, marking the first learned heuristic with formal optimality guarantees.
Researchers published a comprehensive survey on Neural Routing Solvers (NRSs) that use deep learning to solve vehicle routing problems. The study introduces a new hierarchical taxonomy based on heuristic principles and proposes an improved evaluation pipeline that reveals gaps in current research methodologies.
