Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theoretical aspects, pp. 571–572 — links between customers are never severed; interior points are never reconsidered

Proved
ClarkeWright64.Savings.interior_points_final

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

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

Let SSS be a state reached by the savings procedure and let S′S'S′ follow SSS by one step. Then:

  1. every link between two customers survives: if ty,z=1t_{y,z}=1ty,z​=1 in SSS for customers Py,PzP_y,P_zPy​,Pz​, then ty,z=1t_{y,z}=1ty,z​=1 in S′S'S′;
  2. no customer's link count to the depot increases: ty,0(S′)≤ty,0(S)t_{y,0}(S')\le t_{y,0}(S)ty,0​(S′)≤ty,0​(S);
  3. a customer with ty,0=0t_{y,0}=0ty,0​=0 in SSS (one linked to two other customers) lies in no admissible cell of SSS or of any state reached from SSS, so it is never considered again for linking.

This is the procedure's form of the paper's remark that the only links ever severed are those to P0P_0P0​.

Formalization Note The paper argues this for its general scheme through "shadow costs"; only the conclusion is formalized, for the procedure of pp. 573–575.

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), Theoretical aspects, pp. 571–572: in a step of the procedure from a
reachable state, (a) every link between two customers survives, (b) no `t_{y,0}` increases, and
(c) a customer with `t_{y,0} = 0` (linked to two customers) lies in no admissible cell of any
later state, so it is never considered again for linking. -/
theorem interior_points_final {M n : ℕ} (I : Instance M n) (s s' : State M)
    (hs : Reachable I s) (hstep : Step I s s') :
    (∀ y z : Fin (M + 1), y ≠ 0 → z ≠ 0 → t s y z = 1 → t s' y z = 1) ∧
    (∀ y : Fin (M + 1), y ≠ 0 → t s' y 0 ≤ t s y 0) ∧
    (∀ y : Fin (M + 1), y ≠ 0 → t s y 0 = 0 →
      ∀ s'' : State M, Relation.ReflTransGen (Step I) s s'' →
        ∀ z : Fin (M + 1), ¬ Admissible I s'' y z ∧ ¬ Admissible I s'' z y) := 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), pp. 571–572, Theoretical aspects
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