Accelerating Vehicle Routing via AI-Initialized Genetic Algorithms

2025-04-08

AI Summary

Addressing the NP-hard large-scale real-time Vehicle Routing Problem (VRP), this paper proposes EARLI: a novel framework that first integrates Proximal Policy Optimization (PPO)-based reinforcement learning with graph neural networks to generate high-quality initial solutions, followed by fine-grained optimization via an adaptive genetic algorithm (GA). EARLI enables cross-instance knowledge transfer and generalizes effectively to unseen cities using real e-commerce delivery data. On 500-node instances, EARLI produces solutions of quality comparable to state-of-the-art (SOTA) solvers within 1 second—achieving a 10× speedup—thereby significantly enhancing real-time responsiveness and scalability for last-mile delivery and interactive logistics decision-making. Its core innovations lie in the synergistic RL-GA co-optimization mechanism and its generalized modeling capability for dynamic, real-world routing scenarios.

Technology Category

Planning, Routing, and Scheduling: Planning with Language ModelsSearch and Optimization: Learning to SearchIntelligent Robots: Learning & Optimization for ROB

Application Category

Search and Retrieval-Augmented AI: Web learning to rank, online learning, and counterfactual learning for rankingGraph Algorithms and Modeling for the Web: Foundation models and LLMs for Web-related graphsEconomics, Online Markets and Human Computation: Uses of LLMs and GenAI for marketplace design, bidding, and strategic interactions

Abstract

Vehicle Routing Problems (VRP) are an extension of the Traveling Salesperson Problem and are a fundamental NP-hard challenge in combinatorial optimization. Solving VRP in real-time at large scale has become critical in numerous applications, from growing markets like last-mile delivery to emerging use-cases like interactive logistics planning. Such applications involve solving similar problem instances repeatedly, yet current state-of-the-art solvers treat each instance on its own without leveraging previous examples. We introduce a novel optimization framework that uses a reinforcement learning agent - trained on prior instances - to quickly generate initial solutions, which are then further optimized by genetic algorithms. Our framework, Evolutionary Algorithm with Reinforcement Learning Initialization (EARLI), consistently outperforms current state-of-the-art solvers across various time scales. For example, EARLI handles vehicle routing with 500 locations within 1s, 10x faster than current solvers for the same solution quality, enabling applications like real-time and interactive routing. EARLI can generalize to new data, as demonstrated on real e-commerce delivery data of a previously unseen city. Our hybrid framework presents a new way to combine reinforcement learning and genetic algorithms, paving the road for closer interdisciplinary collaboration between AI and optimization communities towards real-time optimization in diverse domains.

Problem

• Solving large-scale Vehicle Routing Problems in real-time
• Leveraging prior instances to improve routing solutions
• Combining reinforcement learning and genetic algorithms for optimization

Innovation

• Reinforcement learning initializes genetic algorithms
• Hybrid AI-optimization framework for routing
• Generalizes to unseen data efficiently