An LLM-guided adaptive CFRS decomposition algorithm for capacitated vehicle routing problems scales to 500,000 customers with competitive benchmark performance and better scalability on large instances.
Spatial-temporal-demand clustering for solving large-scale vehicle routing problems with time windows.arXiv preprint arXiv:2402.00041, 2024
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.AI 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Adaptive Cluster-First Route-Second Decomposition for Industrial-Scale Vehicle Routing
An LLM-guided adaptive CFRS decomposition algorithm for capacitated vehicle routing problems scales to 500,000 customers with competitive benchmark performance and better scalability on large instances.