Search Results for author:
Found 3 papers, 3 papers with code
ReEvo: Large Language Models as Hyper-Heuristics with Reflective Evolution
The omnipresence of NP-hard combinatorial optimization problems (COPs) compels domain experts to engage in trial-and-error heuristic design process.
GLOP: Learning Global Partition and Local Construction for Solving Large-scale Routing Problems in Real-time
The recent end-to-end neural solvers have shown promise for small-scale routing problems but suffered from limited real-time scaling-up performance.
DeepACO: Neural-enhanced Ant Systems for Combinatorial Optimization
As a Neural Combinatorial Optimization method, DeepACO performs better than or on par with problem-specific methods on canonical routing problems.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
