论文标题
在树网络中的系统最佳出发模式的排队不存在
Non-existence of queues for system optimal departure patterns in tree networks
论文作者
论文摘要
这项研究证明了在具有单个目的地的有向根网络中，动态系统最佳（DSO）出发模式的排队不存在。首先，明确考虑排队条件，我们将DSO问题提出为数学编程，并具有互补性约束（MPCC），以最大程度地减少由时间表和排队延迟成本组成的总系统成本。接下来，对于对MPCC的任意可行解决方案，我们证明存在另一种可行解决方案，其中每个链接上的出发流模式是相同的，但不存在队列。这意味着可以消除队列而不会更改总计划延迟成本。队列是死权损失，因此建立了DSO解决方案中队列的不存在定理。此外，作为不存在的定理的应用，我们表明可以通过消除排队条件将MPCC转换为线性编程（LP）问题。
This study proves the non-existence of queues for a dynamic system optimal (DSO) departure pattern in a directed rooted tree network with a single destination. First, considering queueing conditions explicitly, we formulate the DSO problem as mathematical programming with complementarity constraints (MPCC) that minimizes the total system cost which consists of the schedule and queueing delay costs. Next, for an arbitrary feasible solution to the MPCC, we prove the existence of another feasible solution where the departure flow pattern on every link is the same but no queue exists. This means that the queues can be eliminated without changing the total schedule delay cost. Queues are deadweight losses, and thus the non-existence theorem of queues in the DSO solution is established. Moreover, as an application of the non-existence theorem, we show that the MPCC can be transformed into a linear programming (LP) problem by eliminating the queueing conditions.
