Hybrid-Balance GFlowNet for Solving Vehicle Routing Problems
About
Existing GFlowNet-based methods for vehicle routing problems (VRPs) typically employ Trajectory Balance (TB) to achieve global optimization but often neglect important aspects of local optimization. While Detailed Balance (DB) addresses local optimization more effectively, it alone falls short in solving VRPs, which inherently require holistic trajectory optimization. To address these limitations, we introduce the Hybrid-Balance GFlowNet (HBG) framework, which uniquely integrates TB and DB in a principled and adaptive manner by aligning their intrinsically complementary strengths. Additionally, we propose a specialized inference strategy for depot-centric scenarios like the Capacitated Vehicle Routing Problem (CVRP), leveraging the depot node's greater flexibility in selecting successors. Despite this specialization, HBG maintains broad applicability, extending effectively to problems without explicit depots, such as the Traveling Salesman Problem (TSP). We evaluate HBG by integrating it into two established GFlowNet-based solvers, i.e., AGFN and GFACS, and demonstrate consistent and significant improvements across both CVRP and TSP, underscoring the enhanced solution quality and generalization afforded by our approach.
Related benchmarks
| Task | Dataset | Result | Rank | |
|---|---|---|---|---|
| Capacitated Vehicle Routing Problem | CVRP N=100 | Objective Value15.7 | 50 | |
| Traveling Salesman Problem | TSP-500 | Solution Length17.05 | 32 | |
| Traveling Salesman Problem | TSP-200 | Optimality Gap0.56 | 28 | |
| Capacitated Vehicle Routing Problem | CVRP-200 | Objective Value20.01 | 20 | |
| Traveling Salesperson Problem | TSP1000 | Objective Value24.42 | 8 | |
| Traveling Salesperson Problem | TSP5000 | Objective Value54.67 | 8 | |
| Capacitated Vehicle Routing Problem | CVRP500 | Objective Value38.19 | 7 | |
| Capacitated Vehicle Routing Problem | CVRP 1000 | Objective Value65.09 | 7 |