mlsanityData to 14 Oct 2026

Deep Learning--Accelerated Multi-Start Large Neighborhood Search for Real-time Freight Bundling

arXiv 2512.11187 ↗First posted 12 Dec 2025cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

Online Freight Exchange Systems (OFEX) play a crucial role in modern freight logistics by facilitating real-time matching between shippers and carrier. However, efficient combinatorial bundling of transporation jobs remains a bottleneck. We model the OFEX combinatorial bundling problem as a multi-commodity one-to-one pickup-and-delivery selective traveling salesperson problem (m1-PDSTSP), which optimizes revenue-driven freight bundling under capacity, precedence, and route-length constraints. The key challenge is to couple combinatorial bundle selection with pickup-and-delivery routing under sub-second latency. We propose a learning--accelerated hybrid search pipeline that pairs a Transformer Neural Network-based constructive policy with an innovative Multi-Start Large Neighborhood Search (MSLNS) metaheuristic within a rolling-horizon scheme in which the platform repeatedly freezes the current marketplace into a static snapshot and solves it under a short time budget. This pairing leverages the low-latency, high-quality inference of the learning-based constructor alongside the robustness of improvement search; the multi-start design and plausible seeds help LNS to explore the solution space more efficiently. Across benchmarks, our method outperforms state-of-the-art neural combinatorial optimization and metaheuristic baselines in solution quality with comparable time, achieving an optimality gap of less than 2% in total revenue relative to the best available exact baseline method. To our knowledge, this is the first work to establish that a Deep Neural Network-based constructor can reliably provide high-quality seeds for (multi-start) improvement heuristics, with applicability beyond the textitm1-PDSTSP to a broad class of selective traveling salesperson problems and pickup and delivery problems.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 11 of its 47 references that are in the map. First posted on arXiv 12 Dec 2025.

Builds on

11 of 47 references.

References · 11

  1. 2015Pointer Networkscited by 895
  2. 2018Attention, Learn to Solve Routing Problems!cited by 656
  3. 2020POMO: Policy Optimization with Multiple Optima for Reinforcement Learningcited by 348
  4. 2023DIFUSCO: Graph-based Diffusion Solvers for Combinatorial Optimizationcited by 221
  5. 2018Learning to Perform Local Rewriting for Combinatorial Optimizationcited by 185
  6. 2021Learning to Iteratively Solve Routing Problems with Dual-Aspect Collaborative Transformercited by 108
  7. 2022Simulation-guided Beam Search for Neural Combinatorial Optimizationcited by 84
  8. 2023BQ-NCO: Bisimulation Quotienting for Efficient Neural Combinatorial Optimizationcited by 82
  9. 2021Heterogeneous Attentions for Solving Pickup and Delivery Problem via Deep Reinforcement Learningcited by 36
  10. 2022Efficient Neural Neighborhood Search for Pickup and Delivery Problemscited by 29
  11. 2024Neural Combinatorial Optimization Algorithms for Solving Vehicle Routing Problems: A Comprehensive Survey with Perspectivescited by 23

Built on by

Not cited yet.