最新资讯
reddit.com OpenAI 称 Astra 仅满足 10% 安全任务标准 dev.to FreeToken:在自有 GPU 上运行前沿 MoE 模型及其内存需求 dev.to 当 AI Agent 说“完成”时,究竟完成了什么? dev.to 部署 Underdog Bark 3.0 Pro:逐字转写、自定义后端与分块设置 dev.to 为艰难对话构建 AI:五个 Agent、一条安全正则与一位盲评监督者 techcrunch.com Palo Alto Networks 洽谈以 5 亿美元收购 AI Agent 安全初创公司 Clutch theinformation.com 黄仁勋被要求就涉华间谍指控向国会作简报 www.infoq.com Edera 推出 Object Capability Bounded Authority,试图将凭证与 AI Agent 工作负载隔离 wechat 这波杀疯了!旗舰级模型不限量、1个月视频额度免费领 bloomberg.com AI 抛售蔓延至信用市场,软银领跌亚洲美元债 dev.to 如何在专用 GPU 服务器上用 OpenAI 兼容 API 部署 LLM dev.to 审计 153 份 Claude Code 与 Codex 会话记录:User-Agent 与 URL 中的邮箱泄露
多元动态
登录 注册
大模型 arxiv.org ·

RouteRepair:面向路由优化的基于LLM自动启发式设计中的实例级失败诊断与定向修复

原文 我的收藏

该论文针对 LLM 自动启发式设计中聚合评估掩盖特定实例结构上反复失败的问题,提出 RouteRepair:从实例级性能诊断父代弱点,对相应启发式组件做定向修改并保护已表现良好的行为,结合路由证据、求解器行为与程序上下文定义有界修复目标,并以匹配的父子评估验证失败恢复与附带退化。在 TSP 和 CVRP 上覆盖构造式搜索、引导局部搜索与蚁群优化:RouteRepair-GLS 将 TSP 平均最优性差距从 1.7476% 降至 0.7587%,构造式 CVRP 启发式相对 savings 启发式平均路径成本降低 1.91%,生成的 ACO 先验优于匹配的人工设计先验。

AI推荐理由 arXiv 新提交论文(2026-09-10),提出 RouteRepair:从实例级性能诊断父代启发式的特定弱点,并对相应启发式组件做定向修改,同时保护已表现良好的行为;用路由证据、求解器行为与程序上下文定义有界修复目标,并通过匹配的父子评估验证失败恢复与附带退化。在 TSP 与 CVRP 上覆盖构造式搜索、引导局部搜索和蚁群优化:RouteRepair-GLS 将 TSP 平均最优性差距从 1.7476% 降至 0.7587%,构造式 CVRP 启发式相对 savings 启发式平均路径成本降低 1.91%,生成的 ACO 先验也优于匹配的人工设计先验。局限是仅摘要级证据、未提供代码或复现细节,且结果限于 TSP/CVRP 两类问题。

72

正文

Computer Science > Artificial Intelligence arXiv:2609.11452 (cs) [Submitted on 10 Sep 2026] Title:RouteRepair: Instance-Level Failure Diagnosis and Targeted Repair in LLM-Based Automated Heuristic Design for Routing Optimization Authors:Binghao Ji, Di Huang, Jiahui Fang, Zhiyuan Liu View a PDF of the paper titled RouteRepair: Instance-Level Failure Diagnosis and Targeted Repair in LLM-Based Automated Heuristic Design for Routing Optimization, by Binghao Ji and 3 other authors View PDF Abstract:Efficient routing optimization is essential to freight transportation, urban logistics, and shared mobility, where high-quality heuristics are often required under limited computational budgets. Recent large language model (LLM)-based automated heuristic design methods can generate effective routing rules, but aggregate evaluation may mask recurrent failures on particular instance structures. To address this limitation, this study develops RouteRepair, which diagnoses parent-specific weaknesses from instance-level performance and applies targeted modifications to the corresponding heuristic components while protecting behavior that already performs well. Routing evidence, solver behavior, and program context are combined to define bounded repair objectives, and each intervention is validated through matched parent-child evaluation of failure recovery and collateral degradation. Experiments on the traveling salesman problem (TSP) and capacitated vehicle routing problem (CVRP) span constructive search, guided local search, and ant colony optimization. RouteRepair-GLS reduces the mean TSP optimality gap from 1.7476% to 0.7587%, while the constructive CVRP heuristic lowers average route cost by 1.91% relative to the savings heuristic; the generated ACO priors also outperform matched hand-designed priors. These results show that failure-aware, evidence-constrained refinement can improve routing heuristics on difficult instances while preserving performance on cases they already solve well. Comments: Subjects: Artificial Intelligence (cs.AI) Cite as: arXiv:2609.11452 [cs.AI] (or arXiv:2609.11452v1 [cs.AI] for this version) https://doi.org/10.48550/arXiv.2609.11452 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Di Huang [view email] [v1] Thu, 10 Sep 2026 12:21:18 UTC (2,706 KB) Full-text links: Access Paper: View a PDF of the paper titled RouteRepair: Instance-Level Failure Diagnosis and Targeted Repair in LLM-Based Automated Heuristic Design for Routing Optimization, by Binghao Ji and 3 other authors View PDF view license Current browse context: cs.AI new | recent | 2026-09 Change to browse by: cs References & Citations NASA ADS Google Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer (What is the Explorer?) Connected Papers Toggle Connected Papers (What is Connected Papers?) Litmaps Toggle Litmaps (What is Litmaps?) scite.ai Toggle scite Smart Citations (What are Smart Citations?) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv (What is alphaXiv?) Links to Code Toggle CatalyzeX Code Finder for Papers (What is CatalyzeX?) DagsHub Toggle DagsHub (What is DagsHub?) GotitPub Toggle Gotit.pub (What is GotitPub?) Huggingface Toggle Hugging Face (What is Huggingface?) ScienceCast Toggle ScienceCast (What is ScienceCast?) Demos Demos Replicate Toggle Replicate (What is Replicate?) Spaces Toggle Hugging Face Spaces (What is Spaces?) Spaces Toggle TXYZ.AI (What is TXYZ.AI?) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower (What are Influence Flowers?) Core recommender toggle CORE Recommender (What is CORE?) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs. Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)

来源报道 · 1 篇 · 以下链接均前往原始媒体

← 返回精选动态 原文

更多内容