CodeEvolve: an open source evolutionary coding agent for algorithmic discovery and optimization
About
We introduce CodeEvolve, an open-source framework that combines large language models (LLMs) with evolutionary search to synthesize high-performing algorithmic solutions. CodeEvolve couples an islands-based genetic algorithm with modular LLM orchestration, using execution feedback and task-specific metrics to guide selection and variation. Exploration and exploitation are balanced through context-aware recombination, adaptive meta-prompting, and targeted refinement of promising solutions. We evaluate CodeEvolve on benchmarks used to assess Google DeepMind's AlphaEvolve, and include direct comparisons with popular open-source frameworks for algorithmic discovery and heuristic design. Our results show that CodeEvolve achieves state-of-the-art (SOTA) performance on several tasks, with open-weight models often matching or exceeding closed-source baselines at a fraction of the compute cost. We provide extensive ablations, practical hyperparameter guidance, and release our framework and experimental results at https://github.com/inter-co/science-codeevolve.
Related benchmarks
| Task | Dataset | Result | Rank | |
|---|---|---|---|---|
| Traveling Salesman Problem | TSP50 | Optimality Gap0.1 | 64 | |
| Online Bin Packing Problem | BPP online N=1k, W=100 | Optimality Gap4.18 | 35 | |
| Traveling Salesman Problem | TSP N=20 | Optimality Gap0.00e+0 | 33 | |
| Online Bin Packing Problem | BPP online N=5k, W=100 | Optimality Gap3.16 | 30 | |
| Kernel Optimization | KernelBench 1.0 (test) | Latency (us)0.0063 | 27 | |
| Traveling Salesman Problem | TSP100 | Optimality Gap (%)4 | 23 | |
| Online Bin Packing Problem | Weibull BPP 5k 500 | Optimality Gap (%)0.2 | 20 | |
| Online Bin Packing Problem | BPP online N=10k, W=100 | Optimality Gap3.22 | 18 | |
| Flow Shop Scheduling | Flow shop scheduling problem (FSSP) instances | -- | 12 | |
| Online Bin Packing | Online Bin Packing 1k items, Capacity 500 | Gap (%)0.00e+0 | 7 |