研究人员开发了WeCon，这是一种新颖的神经求解器，旨在高效解决多目标组合优化问题。这种新方法通过在编码和解码阶段增强问题实例特征与权重向量之间的交互来改进现有方法。WeCon还引入了一种有效的偏好优化技术，以生成更具信息量的训练数据，从而提高有效性。实验表明，WeCon在推理时间显著缩短的同时，取得了与最先进求解器相当的结果。 AI
影响 为解决复杂的优化问题引入了新颖的神经网络架构和框架，有可能提高各种应用的效率。
排序理由 该集群包含两篇学术论文，详细介绍了组合优化问题的新方法和框架。
在 arXiv cs.NE (Neural & Evolutionary) 阅读 →
AI 生成摘要 · Google Gemini · 来自 4 个来源。 我们如何撰写摘要 →
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…
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…
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…
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 …