Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Computational procedure, pp. 571 and 573 — every reachable state is a feasible allocation of the customers to trucks

Proved
ClarkeWright64.Savings.reachable_feasible

by mikedeng1 · Oct 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

fleetinvariantp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1savings-algorithmvehicle-routing

Suppose C1<⋯<CnC_1<\dots<C_nC1​<⋯<Cn​, x1=∞x_1=\inftyx1​=∞, and the initial allocation of one truck to each customer passes the Table II test (the paper's assumption that "an initial allocation of one vehicle to each customer is possible"). Then every state SSS reached by the savings procedure

  1. is an allocation: its runs are nonempty, avoid the depot, and cover every customer exactly once; and
  2. is fleet feasible: its runs can be assigned to the available trucks without exceeding any capacity.

Thus every link the procedure makes produces "feasible routes consistent with truck availabilities and capacities".

Preamble
import Mathlib
import Definitions.Def_SupplyChainTheory_vrp
import Definitions.Def_ClarkeWright64_Savings_Instance
import Definitions.Def_ClarkeWright64_Savings_Procedure
Formal statement
namespace ClarkeWright64.Savings

/-- Clarke & Wright (1964), Computational procedure, pp. 571 and 573: if `C₁ < ⋯ < C_n`,
`x₁ = ∞` and the initial allocation of one truck to each customer passes the Table II test,
then every state the procedure reaches is an allocation of the customers to runs that the
available trucks can carry. -/
theorem reachable_feasible {M n : ℕ} (I : Instance M n) (hC : StrictMono I.C)
    (hx : I.x 0 = ⊤) (hinit : I.TableIIOK ↑((init M).map I.runLoad))
    (s : State M) (hs : Reachable I s) :
    IsAllocation s ∧ I.FleetFeasible ↑(s.map I.runLoad) := by sorry

end ClarkeWright64.Savings
Source
Clarke & Wright, Scheduling of vehicles from a central depot to a number of delivery points, Oper. Res. 12 (1964), p. 571, Theoretical aspects; pp. 572–573, Computational procedure
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me