Specific Heuristic
Specific heuristics are rules of thumb used to efficiently solve complex problems, particularly in optimization and planning, where exhaustive search is computationally infeasible. Current research focuses on integrating heuristics with machine learning techniques, such as reinforcement learning and large language models, to improve performance and adaptability across diverse problem domains, including scheduling, trajectory optimization, and combinatorial optimization. This interdisciplinary approach is yielding significant advancements in solving computationally challenging problems in various fields, from robotics and logistics to artificial intelligence and mathematical problem solving. The development of more effective and adaptable heuristics has broad implications for improving the efficiency and scalability of numerous algorithms and applications.
Papers
Systematic Analysis of LLM Contributions to Planning: Solver, Verifier, Heuristic
Haoming Li, Zhaoliang Chen, Songyuan Liu, Yiming Lu, Fei Liu
Search Strategy Generation for Branch and Bound Using Genetic Programming
Gwen Maudet, Grégoire Danoy
Speeding up approximate MAP by applying domain knowledge about relevant variables
Johan Kwisthout, Andrew Schroeder
L3Ms -- Lagrange Large Language Models
Guneet S. Dhillon, Xingjian Shi, Yee Whye Teh, Alex Smola
High-level hybridization of heuristics and metaheuristics to solve symmetric TSP: a comparative study
Carlos Alberto da Silva Junior, Roberto Yuji Tanaka, Luiz Carlos Farias da Silva, Angelo Passaro
Deep Insights into Automated Optimization with Large Language Models and Evolutionary Algorithms
He Yu, Jing Liu