p. 345 — the journey time (22) is at least bᵢ, with equality exactly at zero additional flow
ProvedWardropTraffic.EqualTimes.routeTime_gep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1traffic-assignmentwardrop-equilibrium
Let route have positive constants and and journey time at additional flow (equation (22)). For every flow with ,
So is the journey time of a single vehicle on an otherwise unused route, and no flow can make the route faster than that.
This is the fact behind the paper's remark that "the journey time on any route cannot be less than ", which decides which routes can be in use under the equal-times criterion.
Formalization Note The positivity of , and the range are the model's standing conditions (positive speed); the paper presupposes them.
Preamble
import Mathlib import Definitions.Def_WardropTraffic_EqualTimes_Setting
Formal statement
namespace WardropTraffic.EqualTimes
theorem routeTime_ge {D : ℕ} (b p : Fin D → ℝ) (hb : ∀ i, 0 < b i) (hp : ∀ i, 0 < p i)
(i : Fin D) (x : ℝ) (hx0 : 0 ≤ x) (hxp : x < p i) :
b i ≤ routeTime b p i x ∧ (routeTime b p i x = b i ↔ x = 0) := by sorry
end WardropTraffic.EqualTimes
Source
Wardrop, Some theoretical aspects of road traffic research, Proc. Instn Civ. Engrs Part II 1 (1952), p. 345, (1) Equal Times: "Any one of these quantities bᵢ is the journey time on route i when the additional flow qᵢ = 0" and "equation (22) shows that the journey time on any route i cannot be less than bᵢ"
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.