PulseAugur
中
实时 06:19:11
English(EN) An Amortized Efficiency Threshold for Comparing Neural and Heuristic Solvers in Combinatorial Optimization

新的神经求解器以增强的泛化能力解决复杂的路由问题

作者 PulseAugur 编辑部 · [4 个来源] ·

研究人员开发了新的神经网络框架来解决复杂的路由问题，旨在提高跨不同问题类型的泛化能力。SPACE 通过使用新颖的空间嵌入和自适应解码机制，统一了对称和非对称车辆路径问题 (VRP)。URS 提供统一的数据表示和混合偏置模块，以实现跨众多 VRP 变体的零样本泛化，并处理大规模实例。WeCon 通过改进权重条件上下文建模并提出一种有效的偏好优化方法来解决多目标组合优化问题。此外，一项研究引入了摊销效率阈值 (AET) 来比较神经求解器与启发式方法的能效，发现神经求解器在高部署量下可以更有效。 AI

影响 这些在路由和优化问题的神经求解器方面的进展可能导致各行业物流、资源分配和复杂决策的效率更高。

排序理由 多篇研究论文介绍了用于解决复杂优化和路由问题的新神经网络架构和框架。

在 arXiv cs.NE (Neural & Evolutionary) 阅读 →

AI 生成摘要 · Google Gemini · 来自 4 个来源。 我们如何撰写摘要 →

新的神经求解器以增强的泛化能力解决复杂的路由问题

报道来源 [4]

  1. arXiv cs.AI TIER_1 English(EN) · Rongsheng Chen, Changliang Zhou, Canhong Yu, Yuanyao Chen, Yu Zhou, Zhuo Chen, Zhenkun Wang ·

    SPACE: Unifying Symmetric and Asymmetric Routing Problems for Generalist Neural Solver

    arXiv:2605.24484v1 Announce Type: new Abstract: Generalist neural routing solvers have shown great potential in solving diverse vehicle routing problems (VRPs) with a unified model. However, existing solvers are typically limited to symmetric settings or degrade in performance wh…

  2. arXiv cs.LG TIER_1 English(EN) · Changliang Zhou, Canhong Yu, Shunyu Yao, Xi Lin, Zhenkun Wang, Yu Zhou, Qingfu Zhang ·

    URS: A Unified Neural Routing Solver for Cross-Problem Zero-Shot Generalization

    arXiv:2509.23413v2 Announce Type: replace Abstract: Multi-task neural routing solvers have emerged as a promising paradigm for their ability to solve multiple vehicle routing problems (VRPs) using a single model. However, existing neural solvers typically rely on predefined probl…

  3. arXiv cs.LG TIER_1 English(EN) · Xuan Wu, Jinbiao Chen, Yang Li, Lijie Wen, Chunguo Wu, Yuanshu Li, Yubin Xiao, Chunyan Miao, You Zhou, Di Wang ·

    WeCon: An Efficient Weight-Conditioned Neural Solver for Multi-Objective Combinatorial Optimization Problems

    arXiv:2605.22876v1 Announce Type: new Abstract: Existing neural solvers for Multi-Objective Combinatorial Optimization Problems (MOCOPs) commonly adopt decomposition-based strategies that scalarize an MOCOP into multiple subproblems associated with distinct weight vectors. Howeve…

  4. arXiv cs.NE (Neural & Evolutionary) TIER_1 English(EN) · Sohaib Afifi ·

    An Amortized Efficiency Threshold for Comparing Neural and Heuristic Solvers in Combinatorial Optimization

    A common critique of neural combinatorial-optimization solvers is that they are less energy-efficient than CPU metaheuristics, given the operational energy cost of training them on GPUs. This paper examines the inferential step from "training is expensive" to "neural solvers are …

相关实体

相关话题