Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theoretical aspects, pp. 571–572 — linking cell (y:z) saves exactly d_{0,y} + d_{0,z} − d_{y,z}

Proved
ClarkeWright64.Savings.link_saving

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

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

Let the distances be symmetric, dy,z=dz,yd_{y,z}=d_{z,y}dy,z​=dz,y​. Let SSS be a state that the savings procedure reaches from the initial basic solution, and let (y:z)(y:z)(y:z) be an admissible cell of SSS (conditions (I)–(III)). If S′S'S′ is the state obtained by linking PyP_yPy​ and PzP_zPz​, then

mileage(S′)=mileage(S)−(d0,y+d0,z−dy,z).\text{mileage}(S') = \text{mileage}(S) - \bigl(d_{0,y}+d_{0,z}-d_{y,z}\bigr).mileage(S′)=mileage(S)−(d0,y​+d0,z​−dy,z​).

Since PyP_yPy​ and PzP_zPz​ are both linked to the depot, linking them severs only their links to P0P_0P0​; this is why the cell value of the half matrix is the distance saved by the link.

Formalization Note Symmetry of ddd is the paper's half matrix (p. 573); it is needed because a run may be reversed to bring PyP_yPy​ to its end.

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: linking an admissible cell `(y:z)`
of a state reached by the procedure lowers the total mileage by exactly the saving
`d_{0,y} + d_{0,z} − d_{y,z}`, for symmetric distances. -/
theorem link_saving {M n : ℕ} (I : Instance M n) (hsymm : ∀ i j, I.d i j = I.d j i)
    (s : State M) (hs : Reachable I s) (y z : Fin (M + 1)) (hyz : Admissible I s y z) :
    I.mileage (link s y z) = I.mileage s - I.saving y z := 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; p. 573 (cell values)
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