基于整数规划与约束生成的反事实路由
Counterfactual Routing Using Integer Programming with Constraint Generation
查看机构详情
- Delft University of Technology（代尔夫特理工大学）
机构由 AI 辅助整理，请以论文原文为准。
浏览论文内容
中文总结 AI 辅助
该研究针对IJCAI 2025反事实路由竞赛，提出整数规划结合约束生成的方法，在解质量排第四的同时，所有测试实例的求解速度均最快，平均运行时间远低于次快方案。
中文摘要 AI 辅助
我们提交了IJCAI 2025“反事实路由竞赛”（CRC 25）的参赛方案。该竞赛的目标是为最短路径问题寻找反事实解释，即确定对道路网络进行哪些最小改动，可使用户选择的路线成为最优路线，例如“若道路X不是自行车道，你建议的路线确实会是最优的”。我们将该问题建模为整数规划问题，迭代纳入约束直至找到精确解。在对保留的测试实例进行的最终评估中，我们的方法在解质量方面排名第四，且在所有实例上的求解速度均最快，平均运行时间为9.0秒，而次快的参赛方案平均运行时间为118.8秒。
英文摘要
We present our submission to the IJCAI 2025 'Counterfactual Routing Competition' (CRC 25). The goal of the competition is to find counterfactual explanations for the shortest path problem. This requires deciding what the minimal changes to a road network would make a route chosen by the user the optimal route. This enables explanations such as "Your suggested route would indeed have been optimal, if road X were not a bicycle path." Our solution models the problem as an integer program, iteratively incorporating constraints until an exact solution is found. In the final evaluation on held-out test instances, our method ranked fourth in solution quality and obtained its solution fastest on every instance, with an average runtime of 9.0 seconds compared to 118.8 seconds for the next-fastest submission.
