(27)–(28), p. 346 — at a minimum of T, all routes in use have the same marginal time ε
ProvedWardropTraffic.MinTime.marginal_times_equalmarginal-costp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1system-optimumtraffic-assignment
Let and describe alternative routes with journey times , and let . Suppose the feasible split of minimizes the average journey time (criterion (2)). Then there is a constant , independent of the route, with
By (29) the left side is the marginal time , so this is (27)–(28): moving an infinitesimal amount of flow between two routes in use must not change . It is the system-optimum counterpart of the equal-times principle.
Formalization Note The marginal time is written in its closed form (29) rather than as a derivative. The conditions and are the model's standing conditions: positive speeds, a nontrivial flow, and a nonempty feasible set.
Preamble
import Mathlib import Definitions.Def_WardropTraffic_MinTime_Setting
Formal statement
namespace WardropTraffic.MinTime
/-- (27)–(28): at a minimum of the average journey time, the marginal journey times
`b_i / (1 - q_i/p_i)^2` of all routes in use equal one constant `ε`. -/
theorem marginal_times_equal {D : ℕ} (b p : Fin D → ℝ) (Q : ℝ)
(hb : ∀ i, 0 < b i) (hp : ∀ i, 0 < p i) (hQ : 0 < Q) (hQp : Q < ∑ i, p i)
(q : Fin D → ℝ) (hmin : IsMinAvgTime b p Q q) :
∃ ε : ℝ, ∀ i, 0 < q i → b i / (1 - q i / p i) ^ 2 = ε := by sorry
end WardropTraffic.MinTime
Source
Wardrop, Some theoretical aspects of road traffic research, Proc. Instn Civ. Engrs Part II 1 (1952), p. 346, (27)–(28)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.