Daily Arxiv

This page organizes papers related to artificial intelligence published around the world.
This page is summarized using Google Gemini and is operated on a non-profit basis.
The copyright of the paper belongs to the author and the relevant institution. When sharing, simply cite the source.

Learning to Segment for Vehicle Routing Problems

Created by
  • Haebom

Author

Wenbin Ouyang, Sirui Li, Yining Ma, Cathy Wu

Outline

This study is the first to formally investigate the First-Segment-Then-Aggregate (FSTA) decomposition technique to accelerate iterative heuristics for solving the Vehicle Routing Problem (VRP). Specifically, we aim to reduce unnecessary computation by retaining stable solution segments and focusing only on unstable segments. To identify stable segments, we introduce a novel neural network framework called Learning-to-Segment (L2Seg). L2Seg comes in three variants (non-autoregressive, autoregressive, and synergistic), and experimental results on the CVRP and VRPTW problems demonstrate that L2Seg speeds up state-of-the-art solvers by a factor of 2 to 7.

Takeaways, Limitations

Takeaways:
Speeding up iterative heuristics for solving VRP.
Introduction of FSTA decomposition technology and development of L2Seg framework.
Presentation and performance comparison of three variants of L2Seg (non-autoregressive, autoregressive, and synergistic).
Performance is demonstrated through experiments on CVRP and VRPTW problems.
Compatibility with traditional, learning-based, and hybrid solvers.
Limitations:
No specific mention of Limitations in the paper.
👍