使用决策图求解不可分割网络流问题
Solving Unsplittable Network Flow Problems with Decision Diagrams
AI总结:
本文研究需求不确定的单元列车调度随机变体,提出一种基于决策图的框架,将两阶段公式分解为主问题和子问题,通过降维建模和割平面细化显著提升求解效率。
摘要:
在不可分割网络流问题中,某些节点必须满足一项组合要求,即引入的弧流在通过引出弧进行路由时不能被分割或合并。这种所谓的“不分割不合并”要求出现在单元列车调度中,因为在缺乏必要设备和人力来连接/断开车厢的车站,列车编组应保持完整。由于需要大量二元变量来确定具有不分割不合并约束的节点的引入弧和引出弧之间的匹配对,使用标准混合整数规划公式求解不可分割网络流问题在计算上非常困难。在本文中,我们研究了需求不确定的单元列车调度问题的随机变体。我们开发了一种新颖的基于决策图(DD)的框架,将底层的两阶段公式分解为一个包含组合要求的主问题和一个建模连续网络流问题的子问题。主问题通过一个变量维度较小的变换空间中的DD进行建模,从而显著缩短了求解时间。与Benders分解技术类似,子问题输出用于细化主DD的割平面。计算实验表明,与标准方法相比,DD框架在求解时间上有显著改善。
英文摘要:
In unsplittable network flow problems, certain nodes must satisfy a combinatorial requirement that the incoming arc flows cannot be split or merged when routed through outgoing arcs. This so-called "no-split no-merge" requirement arises in unit train scheduling where train consists should remain intact at stations that lack necessary equipment and manpower to attach/detach them. Solving the unsplittable network flow problems with standard mixed-integer programming formulations is computationally difficult due to the large number of binary variables needed to determine matching pairs between incoming and outgoing arcs of nodes with no-split no-merge constraint. In this paper, we study a stochastic variant of the unit train scheduling problem where the demand is uncertain. We develop a novel decision diagram (DD)-based framework that decomposes the underlying two-stage formulation into a master problem that contains the combinatorial requirements, and a subproblem that models a continuous network flow problem. The master problem is modeled by a DD in a transformed space of variables with a smaller dimension, leading to a substantial improvement in solution time. Similarly to the Benders decomposition technique, the subproblems output cutting planes that are used to refine the master DD. Computational experiments show a significant improvement in solution time of the DD framework compared with that of standard methods.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。