--- title: Generalized Queue Replacement Principle (GQRP) url: https://www.emergentmind.com/topics/generalized-queue-replacement-principle-gqrp type: topic --- # Generalized Queue Replacement Principle (GQRP) Generalized Queue Replacement Principle (GQRP) denotes, in the dynamic user equilibrium assignment problem with route and departure time choice, an equivalence between the equilibrium queueing delay pattern and the solution to a linear programming problem obtained by relaxing certain conditions in the original DUE-RDTC problem. In the many-to-one network setting, it provides a criterion under which the true equilibrium queues can be replaced by dual capacity shadow prices from a simpler LP, and it yields an exact dynamic user equilibrium by sequentially solving two LPs: one for the equilibrium cost pattern, including the queueing delay pattern, and one for the equilibrium flow pattern [2508.07159]. ## 1. Formal concept and scope The setting is a **many-to-one** road network with \(N+1\) nodes, where \(N\) are origins and one is a single destination. Each directed link \((i,j)\in L\) has bottleneck capacity \(\mu_{ij}\) and free-flow travel time \(c_{ij}\). Each link consists of a bottleneck section followed by a free-flow section; when inflow exceeds capacity \(\mu_{ij}\), a **point queue** forms at the bottleneck, and FIFO is assumed. Users are homogeneous: they share the same value of time, normalized to \(\alpha=1\), the same preferred arrival time at destination \(t^{\mathrm P}\), and the same schedule delay cost function \(s(t)\), which is convex in \(t\), satisfies \(s(t^{\mathrm P})=0\), and obeys \(\frac{d s(t)}{dt}>-1\) for all \(t\) [2508.07159]. A key modeling feature is a **Lagrangian-like coordinate system** in which variables are indexed by destination arrival time \(t\), not by departure time at origins. The principal state variables are \(q_i(t)\), the destination-arrival rate of users whose origin is \(i\); \(y_{ij}(t)\), the destination-arrival rate of users who pass link \((i,j)\); \(w_{ij}(t)\), the queueing delay on link \((i,j)\) experienced by users who arrive at destination at time \(t\); and \(\pi_i(t)\), the earliest travel time from node \(i\) to the destination for users arriving at time \(t\). In this coordinate system, the generalized cost of arriving at time \(t\) using path \(P\) is \[ C_P(t)=\sum_{(i,j)\in P}\left(c_{ij}+w_{ij}(t)\right)+s(t). \] The dynamic user equilibrium with route and departure time choice is defined as a state where each user chooses route and departure time so that their experienced travel cost is minimal, and no unused route–departure-time alternative offers a lower cost, given congestion caused by all users. Within this formulation, GQRP identifies conditions under which the equilibrium queueing delay pattern can be recovered from a queue-free, capacity-constrained optimization problem, rather than from the full queueing equilibrium model [2508.07159]. ## 2. DUE-RDTC formulation in Lagrangian coordinates The DUE is formulated as a mixed linear complementarity problem with variables \(x=[q,y,w,\pi,\rho]\), where \(\rho=(\rho_i)_{i\in N}\) is the constant equilibrium cost for origin \(i\). Let \(A\) be the node–link incidence matrix excluding the destination, \(A_+\) the same matrix with negative entries replaced by \(0\), and \(M\) a diagonal matrix with diagonal entries \(\mu_{ij}\). The model is characterized by six conditions [2508.07159]. Demand conservation requires \[ \int_T q(t)\,dt = Q. \] Elementwise, \[ \int_T q_i(t)\,dt = Q_i,\qquad \forall i\in N. \] Flow conservation at nodes requires \[ A y(t)-q(t)=0,\qquad \forall t\in T. \] Queueing dynamics in Lagrangian coordinates are expressed by the point-queue complementarity condition \[ 0 \le \big( M \dot{w}(t) - M A_+^\top \dot{\pi}(t) + M\mathbf{1} - y(t) \big) \perp w(t) \ge 0,\qquad \forall t\in T. \] Elementwise, if \(w_{ij}(t)>0\), then \[ \mu_{ij}(\dot{w}_{ij}(t)-\dot{\pi}_i(t)+1)-y_{ij}(t)=0, \] whereas if \(w_{ij}(t)=0\), then \[ \mu_{ij}(\dot{w}_{ij}(t)-\dot{\pi}_i(t)+1)-y_{ij}(t)\ge 0. \] The **consistency condition** \[ \dot{\pi}(t)\le \mathbf{1},\qquad \forall t\in T, \] ensures Lipschitz continuity of cumulative arrivals and physical consistency. The route-choice condition is \[ 0 \le \left(w(t)-A^\top \pi(t)+c\right)\perp y(t)\ge 0,\qquad \forall t\in T, \] so that any link with positive flow lies on a minimum-cost path. The departure-time-choice condition is \[ 0 \le \left(\pi(t)+s(t)-\rho\right)\perp q(t)\ge 0,\qquad \forall t\in T, \] which enforces that all used origin–arrival-time choices have equal and minimal cost \(\rho_i\), and unused ones are weakly more expensive. Collecting these conditions yields the problem denoted \(\text{[DUE-LCP]}\). Using a standard LCP–QP equivalence, the model is also represented as a quadratic program \(\text{[DUE-QP]}\) with objective \[ Z(q,y,w,\pi,\rho)=Z^{\mathrm Q}(w,\pi)+Z^{\mathrm L}(q,y,w,\pi,\rho), \] where the differential term \(Z^{\mathrm Q}\) is the source of the main computational difficulty [2508.07159]. ## 3. Relaxed cost determination and the formal definition of GQRP The generalized queue replacement principle is introduced by relaxing the original queueing and consistency conditions. Specifically, the consistency condition \(\dot{\pi}\le 1\) is removed, and the original queue dynamics are replaced by the simpler complementarity \[ 0\le \mu-y(t)\perp w(t)\ge 0,\qquad \forall t\in T. \] Elementwise, if \(w_{ij}(t)>0\), then \(y_{ij}(t)=\mu_{ij}\); if \(w_{ij}(t)=0\), then \(y_{ij}(t)\le \mu_{ij}\). This is an abstract capacity-constraint complementarity rather than a true queue-dynamics condition [2508.07159]. Replacing the original queueing conditions by this relaxed relation produces the **cost determination LCP**, denoted \(\text{[COST-LCP]}\). Its equivalent optimization form, \(\text{[COST-QP]}\), has objective \[ Z(q,y,w,\pi,\rho)=Z^{\mathrm P}(q,y)-Z^{\mathrm D}(w,\pi,\rho), \] which is linear because the term \(Z^{\mathrm Q}\) disappears. The resulting model decomposes into a primal–dual LP pair. The primal LP, \(\text{[COST-LP-P]}\), is \[ \min_{[q,y]\ge 0}\quad Z^{\mathrm P}(q,y)=\int_T s(t)q(t)\,dt+\int_T c\,y(t)\,dt \] subject to demand conservation, flow conservation, and \[ y(t)-\mu\le 0,\qquad \forall t\in T. \] It can be interpreted as a capacity-constrained, queue-free flow problem. The dual LP, \(\text{[COST-LP-D]}\), is \[ \max_{[w,\pi,\rho]\ge 0}\quad Z^{\mathrm D}(w,\pi,\rho)= -\int_T \pi(t)\,dt + Q^\top \rho \] subject to \[ \pi(t)+s(t)-\rho\ge 0,\qquad \forall t\in T, \] and \[ w(t)-A^\top\pi(t)+c\ge 0,\qquad \forall t\in T. \] In this dual problem, the variables \(w_{ij}(t)\) behave like shadow prices of capacity constraints on links and are interpretable as queueing-delay candidates [2508.07159]. If \((q^{\mathrm{DUE}},y^{\mathrm{DUE}},w^{\mathrm{DUE}},\pi^{\mathrm{DUE}},\rho^{\mathrm{DUE}})\) denotes the DUE solution and \((\hat q,\hat y,\hat w,\hat\pi,\hat\rho)\) the solution of the cost determination problem, then GQRP holds when \[ w^{\mathrm{DUE}}(t)=\hat w(t),\qquad \forall t\in T. \] This is the formal statement that the true equilibrium queues can be replaced by the dual capacity shadow prices of a simpler LP [2508.07159]. ## 4. Verification, exact solution, and sufficient conditions The methodology for determining whether GQRP holds is two-stage. First, one solves \(\text{[COST-LP-D]}\) and, optionally, \(\text{[COST-LP-P]}\) to obtain a candidate equilibrium cost pattern \((\hat w(t),\hat\pi(t),\hat\rho)\) and corresponding capacity-constrained flows. Second, one solves a **flow determination LP**, denoted \(\text{[FLOW-LP]}\), that reinstates the stricter queueing structure while keeping the candidate cost pattern fixed [2508.07159]. Given \((\hat w,\hat\pi,\hat\rho)\), define \[ \overline{\theta}(t)=\dot{\hat w}(t)-A_+^\top \dot{\hat\pi}(t)+\mathbf{1}. \] The flow determination LP is \[ \min_{[q,y]\ge 0}\; Z(q,y) \] subject to demand conservation, \[ A y(t)-q(t)=0,\qquad \forall t\in T, \] and \[ M\overline{\theta}(t)-y(t)\ge 0,\qquad \forall t\in T. \] Because \(\hat w,\hat\pi,\hat\rho\), and \(\overline{\theta}\) are constants in this step, \(\text{[FLOW-LP]}\) is again an LP [2508.07159]. The central characterization is exact: GQRP holds **if and only if** \(\text{[FLOW-LP]}\) is feasible and its optimal value is zero. In that case, \[ (q^{\mathrm{DUE}},y^{\mathrm{DUE}},w^{\mathrm{DUE}},\pi^{\mathrm{DUE}},\rho^{\mathrm{DUE}}) = (\hat q,\hat y,\hat w,\hat\pi,\hat\rho). \] Thus the LP-derived cost pattern is not merely approximate; it is the DUE cost pattern itself [2508.07159]. The paper also gives a constructive sufficient condition in terms of the schedule delay slope. For any origin \(i\) and times with positive demand flow \(\hat q_i(t)>0\), \[ \dot{s}(t)\le \dfrac{\sum_{j\in N^{\mathrm{OUT}(i)}} \hat{y}_{ij}(t)} {\sum_{j\in N^{\mathrm{IN}(i)}} \hat{y}_{ji}(t)-1}. \] Under this condition, the flow pattern \[ y_{ij}(t)= \begin{cases} \overline{\theta}_{ij}(t)\mu_{ij}, & \hat{w}_{ij}(t)>0 \text{ and } \overline{\lambda}_{ij}(t)=0,\\ \hat{y}_{ij}(t), & \hat{w}_{ij}(t)=0 \text{ and } \overline{\lambda}_{ij}(t)=0,\\ 0, & \text{otherwise}, \end{cases} \] with \[ q(t)=A\,y(t), \] is feasible for \(\text{[FLOW-LP]}\) and yields zero objective value. The implication is that, when the slope condition holds, no second optimization is needed: equilibrium flows can be constructed analytically from the cost determination solution [2508.07159]. A further policy-based result shows that GQRP can be enforced by scaling the late-arrival part of the schedule delay function. For \[ \tilde s(t)= \begin{cases} s(t), & t