Algorithms & Theory × New Model Releases

Google opens mid-mile routing benchmark

Google opens mid-mile routing benchmark

✎ Story body

Google released a tool that manufactures realistic logistics planning problems. What's moving this week isn't how to solve them — it's who supplies the material a solver gets tested against.

What happened

Google Research published MilleMiglia, a generator for middle-mile logistics problems — the leg between warehouses, where freight moves in bulk before it reaches local delivery. Real operational data is commercially sensitive and rarely leaves the companies that hold it, so researchers have long had to fall back on artificial cases they built themselves. The same week brought work using large language models to hunt for the conditions under which a cyber-physical system breaks. That one also targets the test material rather than the solver: let a machine produce the cases worth trying.

Why it matters

How good an algorithm looks depends on what you measured it against. When every group brings its own problem set, there is no way to tell whether an improvement was real. A shared generator moves that foundation out of each lab and into the open. And logistics is a domain where solution quality lands on fuel bills and delivery windows, so small gains carry money with them. Whether the generated instances capture what actually makes real routing hard, though, only shows up once people put them to work.

What to watch

Whether other groups re-measure their own methods on this generator, and whether those numbers get pooled into a shared leaderboard. A tool nobody adopts leaves the comparison problem exactly where it was.

▲ Official & Press
Official

MilleMiglia: A realistic instance generator for middle-mile logistics

Google Research Blog ・ 2026-09-18 ・ 📌

Google Research unveils MilleMiglia, a middle-mile logistics instance generator

Academic (arxiv etc.) 5 ▾
Academic

Large Language Models as Falsifiers for Cyber-Physical Systems

arXiv cs.AI (Artificial Intelligence) ・ 2026-09-17

Academic

Stable Movement for Nondual Lipschitz Convex Optimization: Efficiency and Nearly Optimal Oracle Rates

arXiv cs.LG (Machine Learning) ・ 2026-09-17

Academic

Epidemiological Causal Graph Identification: Challenges, Identifiability and Algorithms

arXiv cs.LG (Machine Learning) ・ 2026-09-17

Academic

The Bias of Nonlinear Two-Time-scale Stochastic Approximation under Constant Step-Sizes

arXiv cs.LG (Machine Learning) ・ 2026-09-17

Academic

Accelerating Sharded Data Parallelism at Scale with Federated Learning

arXiv cs.AI (Artificial Intelligence) ・ 2026-09-17

← Story Archive