p. 346 — the routes in use are exactly those with bᵢ < ε, and on them 1 − qᵢ/pᵢ = √(bᵢ/ε)
ProvedWardropTraffic.MinTime.used_iff_and_sqrtp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1system-optimumtraffic-assignment
In the setting of the minimum-average-time problem (, ), let minimize the average journey time over the feasible splits of , and let be a common marginal time of the routes in use: whenever . Then and for every route :
- route is used if and only if ;
- if route is used, then
With the routes labelled so that , part 1 is the paper's "if only the first routes will be in use", and part 2 solves (28) for the flows.
Formalization Note The ordering of the is not assumed: "the first routes" is the set . The standing conditions are those of the model.
Preamble
import Mathlib import Definitions.Def_WardropTraffic_MinTime_Setting
Formal statement
namespace WardropTraffic.MinTime
/-- p. 346: at a minimum with common marginal time `ε`, `ε > 0`, the routes in use are
exactly those with `b_i < ε`, and on each of them `1 - q_i/p_i = √(b_i/ε)`. -/
theorem used_iff_and_sqrt {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) (ε : ℝ)
(hε : ∀ i, 0 < q i → b i / (1 - q i / p i) ^ 2 = ε) :
0 < ε ∧ ∀ i, (0 < q i ↔ b i < ε) ∧
(0 < q i → 1 - q i / p i = Real.sqrt (b i / ε)) := by sorry
end WardropTraffic.MinTime
Source
Wardrop, Some theoretical aspects of road traffic research, Proc. Instn Civ. Engrs Part II 1 (1952), p. 346, after (30): 'Thus if b_j < ε < b_{j+1} only the first j routes will be in use. Hence 1 − q_i/p_i = √(b_i/ε) and so p_i − q_i = p_i√(b_i/ε)'
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.