Hybrid Genetic Algorithm for Optimal User Order Routing: Multi-Objective Solver Optimization in CoW Protocol Batch Auctions
Mitchell Marfinetz

TL;DR
This paper presents a hybrid genetic algorithm for multi-objective routing in blockchain batch auctions, improving user surplus and trade-offs among gas, slippage, and risk within real-time constraints.
Contribution
It introduces a novel hybrid genetic algorithm combining multi-objective evolutionary optimization with deterministic methods for real-time DEX routing, ensuring safety and improved outcomes.
Findings
Achieves 0.40-9.82 ETH user surplus gains in benchmarks.
Converges in median 0.5 seconds within 2-second limit.
Validates safety and correctness through comprehensive testing.
Abstract
CoW Protocol batch auctions aggregate user intents and rely on solvers to find optimal execution paths that maximize user surplus across heterogeneous automated market makers (AMMs) under stringent auction deadlines. Deterministic single-objective heuristics that optimize only expected output frequently fail to exploit split-flow opportunities across multiple parallel paths and to internalize gas, slippage, and execution risk constraints in a unified search. We apply evolutionary multi-objective optimization to this blockchain routing problem, proposing a hybrid genetic algorithm (GA) architecture for real-time solver optimization that combines a production-grade, multi-objective NSGA-II engine with adaptive instance profiling and deterministic baselines. Our core engine encodes variable-length path sets with continuous split ratios and evolves candidate route-and-volume allocations…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
