3 articles tagged with #routing-problems. AI-curated summaries with sentiment analysis and key takeaways from 50+ sources.
Researchers introduce L2R, a learning-based framework that enables neural networks to solve vehicle routing problems at unprecedented scale by dynamically reducing search space through pattern recognition. The method achieves high-quality solutions on instances with 10 million nodes, representing a significant breakthrough in neural combinatorial optimization.
Researchers propose Group Relative Policy Optimization (GRPO), a baseline-free training algorithm for neural combinatorial optimization that eliminates the need for maintaining frozen policy copies. Testing on TSP and CVRP benchmarks shows GRPO prevents training collapse seen in standard REINFORCE while achieving competitive solution quality, offering a more stable alternative for routing problem optimization.
Researchers developed RL-CMSA, a hybrid reinforcement learning approach for solving the min-max Multiple Traveling Salesman Problem that combines probabilistic clustering, exact optimization, and solution refinement. The method outperforms existing algorithms by balancing exploration and exploitation to minimize the longest tour across multiple salesmen.
