Pith. sign in

REVIEW 2 cited by

Distance-aware Attention Reshaping: Enhance Generalization of Neural Solver for Large-scale Vehicle Routing Problems

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2401.06979 v1 pith:IBEDY7ZT submitted 2024-01-13 cs.AI cs.LG

classification cs.AIcs.LG
keywords neuralattentionlarge-scalesolversproblemsroutingsolvingvehicle
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Neural solvers based on attention mechanism have demonstrated remarkable effectiveness in solving vehicle routing problems. However, in the generalization process from small scale to large scale, we find a phenomenon of the dispersion of attention scores in existing neural solvers, which leads to poor performance. To address this issue, this paper proposes a distance-aware attention reshaping method, assisting neural solvers in solving large-scale vehicle routing problems. Specifically, without the need for additional training, we utilize the Euclidean distance information between current nodes to adjust attention scores. This enables a neural solver trained on small-scale instances to make rational choices when solving a large-scale problem. Experimental results show that the proposed method significantly outperforms existing state-of-the-art neural solvers on the large-scale CVRPLib dataset.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Efficient Heuristics Generation for Solving Combinatorial Optimization Problems Using Large Language Models

    cs.NE 2025-05 conditional novelty 6.0 of 10

    Hercules improves LLM-based heuristic generation by abstracting core components of elite heuristics into prompts, and Hercules-P reduces search cost by having the LLM predict heuristic fitness values instead of evalua...

  2. USPR: Learning a Unified Solver for Profiled Routing

    cs.LG 2025-05 conditional novelty 6.0 of 10

    A unified transformer-based reinforcement-learning policy, USPR, encodes arbitrary vehicle-client profile scores and profile weights and outperforms prior neural PVRP solvers on synthetic, large-scale, and CVRPLib-der...

Pith tools